Asymptotic Analysis of a Schrödinger-Poisson System with Quantum Wells and Macroscopic Nonlinearities in Dimension 1

2000 Mathematics Subject Classification: 35Q02, 35Q05, 35Q10, 35B40.

Multiplicity results for some classes of Schrödinger-Poisson systems

In this thesis, we study the existence and multiplicity of solutions of the following class of Schr odinger-Poisson systems: u + u + l(x) u = (x; u) in R3; = l(x)u2 in R3; where l 2 L2(R3) or l 2 L1(R3). And we consider that the nonlinearity satis es the following three kinds of cases: (i) a subcritical exponent with (x; u) = k(x)jujp 2u + h(x)u (4 p < 2 ) under an inde nite case; (ii) a general inde nite nonlinearity with (x; u) = k(x)g(u) + h(x)u; (iii) a critical growth exponent with (x; u) = k(x)juj2 2u + h(x)jujq 2u (2 q < 2 ). It is worth mentioning that the thesis contains three main innovations except overcoming several di culties, which are generated by the systems themselves. First, as an unknown referee said in his report, we are the rst authors concerning the existence of multiple positive solutions for Schr odinger- Poisson systems with an inde nite nonlinearity. Second, we nd an interesting phenomenon in Chapter 2 and Chapter 3 that we do not need the condition R R3 k(x)ep 1dx < 0 with an inde nite noncoercive case, where e1 is the rst eigenfunction of +id in H1(R3) with weight function h. A similar condition has been shown to be a su cient and necessary condition to the existence of positive solutions for semilinear elliptic equations with inde nite nonlinearity for a bounded domain (see e.g. Alama-Tarantello, Calc. Var. PDE 1 (1993), 439{475), or to be a su cient condition to the existence of positive solutions for semilinear elliptic equations with inde nite nonlinearity in RN (see e.g. Costa-Tehrani, Calc. Var. PDE 13 (2001), 159{189). Moreover, the process used in this case can be applied to study other aspects of the Schr odinger-Poisson systems and it gives a way to study the Kirchho system and quasilinear Schr odinger system. Finally, to get sign changing solutions in Chapter 5, we follow the spirit of Hirano-Shioji, Proc. Roy. Soc. Edinburgh Sect. A 137 (2007), 333, but the procedure is simpler than that they have proposed in their paper.

Multiscale Schemes for the BGK--Vlasov--Poisson System in the Quasi-Neutral and Fluid Limits. Stability Analysis and First Order Schemes

This paper deals with the development and the analysis of asymptotically stable and consistent schemes in the joint quasi-neutral and fluid limits for the collisional Vlasov-Poisson system. In these limits, the classical explicit schemes suffer from time step restrictions due to the small plasma period and Knudsen number. To solve this problem, we propose a new scheme stable for choices of time steps independent from the small scales dynamics and with comparable computational cost with respect to standard explicit schemes. In addition, this scheme reduces automatically to consistent discretizations of the underlying asymptotic systems. In this first work on this subject, we propose a first order in time scheme and we perform a relative linear stability analysis to deal with such problems. The framework we propose permits to extend this approach to high order schemes in the next future. We finally show the capability of the method in dealing with small scales through numerical experiments.

Existence of solutions and asymtptotic limits of the Euler-Poisson and the quantum drift-diffusion systems

My work concerns two different systems of equations used in the mathematical modeling of semiconductors and plasmas: the Euler-Poisson system and the quantum drift-diffusion system. The first is given by the Euler equations for the conservation of mass and momentum, with a Poisson equation for the electrostatic potential. The second one takes into account the physical effects due to the smallness of the devices (quantum effects). It is a simple extension of the classical drift-diffusion model which consists of two continuity equations for the charge densities, with a Poisson equation for the electrostatic potential. Using an asymptotic expansion method, we study (in the steady-state case for a potential flow) the limit to zero of the three physical parameters which arise in the Euler-Poisson system: the electron mass, the relaxation time and the Debye length. For each limit, we prove the existence and uniqueness of profiles to the asymptotic expansion and some error estimates. For a vanishing electron mass or a vanishing relaxation time, this method gives us a new approach in the convergence of the Euler-Poisson system to the incompressible Euler equations. For a vanishing Debye length (also called quasineutral limit), we obtain a new approach in the existence of solutions when boundary layers can appear (i.e. when no compatibility condition is assumed). Moreover, using an iterative method, and a finite volume scheme or a penalized mixed finite volume scheme, we numerically show the smallness condition on the electron mass needed in the existence of solutions to the system, condition which has already been shown in the literature. In the quantum drift-diffusion model for the transient bipolar case in one-space dimension, we show, by using a time discretization and energy estimates, the existence of solutions (for a general doping profile). We also prove rigorously the quasineutral limit (for a vanishing doping profile). Finally, using a new time discretization and an algorithmic construction of entropies, we prove some regularity properties for the solutions of the equation obtained in the quasineutral limit (for a vanishing pressure). This new regularity permits us to prove the positivity of solutions to this equation for at least times large enough.

Characterization of Schrödinger Processes with Unbounded Potentials

2000 Mathematics Subject Classification: 49L20, 60J60, 93E20

Geometric integration applied to moving mesh methods and degenerate Lagrangians

Moving mesh methods (also called r-adaptive methods) are space-adaptive strategies used for the numerical simulation of time-dependent partial differential equations. These methods keep the total number of mesh points fixed during the simulation, but redistribute them over time to follow the areas where a higher mesh point density is required. There are a very limited number of moving mesh methods designed for solving field-theoretic partial differential equations, and the numerical analysis of the resulting schemes is challenging. In this thesis we present two ways to construct r-adaptive variational and multisymplectic integrators for (1+1)-dimensional Lagrangian field theories. The first method uses a variational discretization of the physical equations and the mesh equations are then coupled in a way typical of the existing r-adaptive schemes. The second method treats the mesh points as pseudo-particles and incorporates their dynamics directly into the variational principle. A user-specified adaptation strategy is then enforced through Lagrange multipliers as a constraint on the dynamics of both the physical field and the mesh points. We discuss the advantages and limitations of our methods. The proposed methods are readily applicable to (weakly) non-degenerate field theories---numerical results for the Sine-Gordon equation are presented.

In an attempt to extend our approach to degenerate field theories, in the last part of this thesis we construct higher-order variational integrators for a class of degenerate systems described by Lagrangians that are linear in velocities. We analyze the geometry underlying such systems and develop the appropriate theory for variational integration. Our main observation is that the evolution takes place on the primary constraint and the 'Hamiltonian' equations of motion can be formulated as an index 1 differential-algebraic system. We then proceed to construct variational Runge-Kutta methods and analyze their properties. The general properties of Runge-Kutta methods depend on the 'velocity' part of the Lagrangian. If the 'velocity' part is also linear in the position coordinate, then we show that non-partitioned variational Runge-Kutta methods are equivalent to integration of the corresponding first-order Euler-Lagrange equations, which have the form of a Poisson system with a constant structure matrix, and the classical properties of the Runge-Kutta method are retained. If the 'velocity' part is nonlinear in the position coordinate, we observe a reduction of the order of convergence, which is typical of numerical integration of DAEs. We also apply our methods to several models and present the results of our numerical experiments.

Simulation of multigate SOI transistors with silicon, germanium and III-V channels

In this work by employing numerical three-dimensional simulations we study the electrical performance and short channel behavior of several multi-gate transistors based on advanced SOI technology. These include FinFETs, triple-gate and gate-all-around nanowire FETs with different channel material, namely Si, Ge, and III-V compound semiconductors, all most promising candidates for future nanoscale CMOS technologies. Also, a new type of transistor called “junctionless nanowire transistor” is presented and extensive simulations are carried out to study its electrical characteristics and compare with the conventional inversion- and accumulation-mode transistors. We study the influence of device properties such as different channel material and orientation, dimensions, and doping concentration as well as quantum effects on the performance of multi-gate SOI transistors. For the modeled n-channel nanowire devices we found that at very small cross sections the nanowires with silicon channel are more immune to short channel effects. Interestingly, the mobility of the channel material is not as significant in determining the device performance in ultrashort channels as other material properties such as the dielectric constant and the effective mass. Better electrostatic control is achieved in materials with smaller dielectric constant and smaller source-to-drain tunneling currents are observed in channels with higher transport effective mass. This explains our results on Si-based devices. In addition to using the commercial TCAD software (Silvaco and Synopsys TCAD), we have developed a three-dimensional Schrödinger-Poisson solver based on the non-equilibrium Green’s functions formalism and in the framework of effective mass approximation. This allows studying the influence of quantum effects on electrical performance of ultra-scaled devices. We have implemented different mode-space methodologies in our 3D quantum-mechanical simulator and moreover introduced a new method to deal with discontinuities in the device structures which is much faster than the coupled-mode-space approach.

Relativistic current collection by a cylindrical Langmuir probe

The current I to a cylindrical Langmuir probe with a bias Φp satisfying β≡eΦp/mec2∼O(1) is discussed. The probe is considered at rest in an unmagnetized plasma composed of electrons and ions with temperatureskTe∼kTi≪mec2. For small enough radius, the probe collects the relativistic orbital-motion-limited (OML) current I OML , which is shown to be larger than the non-relativistic result; the OML current is proportional to β1/2 and β3/2 in the limits β≪1 and β≫1, respectively. Unlike the non-relativistic case, the electron density can exceed the unperturbed density value. An asymptotic theory allowed to compute the maximum radius of the probe to collect OML current, the sheath radius for probe radius well below maximum and how the ratio I/I OML drops below unity when the maximum radius is exceeded. A numerical algorithm that solves the Vlasov-Poisson system was implemented and density and potential profiles presented. The results and their implications in a possible mission to Jupiter with electrodynamic bare tethers are discussed density value. An asymptotic theory allowed to compute the maximum radius of the probe to collect OML current, the sheath radius for probe radius well below maximum and how the ratio I/IOML drops below unity when the maximum radius is exceeded. A numerical algorithm that solves the Vlasov-Poisson system was implemented and density and potential profiles presented. The results and their implications in a possible mission to Jupiter with electrodynamic bare tethers are discussed.

Solution of the Poisson-Boltzmann equation for a system with four ionic species

The analytical solution of the Poisson-Boltzmann equation in an electrolyte with four ionic species (2:2:1:1), in the presence of a charged planar membrane or surface is presented. The function describing the mean electrical potential provides a convenient description that helps the understanding of electrical processes of biological interest.

A Numerical Solution Using an Adaptively Preconditioned Lanczos Method for a Class of Linear Systems Related with the Fractional Poisson Equation

This study considers the solution of a class of linear systems related with the fractional Poisson equation (FPE) (−∇2)α/2φ=g(x,y) with nonhomogeneous boundary conditions on a bounded domain. A numerical approximation to FPE is derived using a matrix representation of the Laplacian to generate a linear system of equations with its matrix A raised to the fractional power α/2. The solution of the linear system then requires the action of the matrix function f(A)=A−α/2 on a vector b. For large, sparse, and symmetric positive definite matrices, the Lanczos approximation generates f(A)b≈β0Vmf(Tm)e1. This method works well when both the analytic grade of A with respect to b and the residual for the linear system are sufficiently small. Memory constraints often require restarting the Lanczos decomposition; however this is not straightforward in the context of matrix function approximation. In this paper, we use the idea of thick-restart and adaptive preconditioning for solving linear systems to improve convergence of the Lanczos approximation. We give an error bound for the new method and illustrate its role in solving FPE. Numerical results are provided to gauge the performance of the proposed method relative to exact analytic solutions.

State Dependent Attempt Rate Modeling of Single Cell IEEE 802.11 WLANs with Homogeneous Nodes and Poisson Arrivals

Analytical models of IEEE 802.11-based WLANs are invariably based on approximations, such as the well-known mean-field approximations proposed by Bianchi for saturated nodes. In this paper, we provide a new approach for modeling the situation when the nodes are not saturated. We study a State Dependent Attempt Rate (SDAR) approximation to model M queues (one queue per node) served by the CSMA/CA protocol as standardized in the IEEE 802.11 DCF. The approximation is that, when n of the M queues are non-empty, the attempt probability of the n non-empty nodes is given by the long-term attempt probability of n saturated nodes as provided by Bianchi's model. This yields a coupled queue system. When packets arrive to the M queues according to independent Poisson processes, we provide an exact model for the coupled queue system with SDAR service. The main contribution of this paper is to provide an analysis of the coupled queue process by studying a lower dimensional process and by introducing a certain conditional independence approximation. We show that the numerical results obtained from our finite buffer analysis are in excellent agreement with the corresponding results obtained from ns-2 simulations. We replace the CSMA/CA protocol as implemented in the ns-2 simulator with the SDAR service model to show that the SDAR approximation provides an accurate model for the CSMA/CA protocol. We also report the simulation speed-ups thus obtained by our model-based simulation.

A mathematical programming approach to optimal Markovian switching of Poisson arrival streams to queueing systems

Motivated by certain situations in manufacturing systems and communication networks, we look into the problem of maximizing the profit in a queueing system with linear reward and cost structure and having a choice of selecting the streams of Poisson arrivals according to an independent Markov chain. We view the system as a MMPP/GI/1 queue and seek to maximize the profits by optimally choosing the stationary probabilities of the modulating Markov chain. We consider two formulations of the optimization problem. The first one (which we call the PUT problem) seeks to maximize the profit per unit time whereas the second one considers the maximization of the profit per accepted customer (the PAC problem). In each of these formulations, we explore three separate problems. In the first one, the constraints come from bounding the utilization of an infinite capacity server; in the second one the constraints arise from bounding the mean queue length of the same queue; and in the third one the finite capacity of the buffer reflect as a set of constraints. In the problems bounding the utilization factor of the queue, the solutions are given by essentially linear programs, while the problems with mean queue length constraints are linear programs if the service is exponentially distributed. The problems modeling the finite capacity queue are non-convex programs for which global maxima can be found. There is a rich relationship between the solutions of the PUT and PAC problems. In particular, the PUT solutions always make the server work at a utilization factor that is no less than that of the PAC solutions.

Adaptive optimal load balancing in a nonhomogeneous multiserver system with a central job scheduler

A model comprising several servers, each equipped with its own queue and with possibly different service speeds, is considered. Each server receives a dedicated arrival stream of jobs; there is also a stream of generic jobs that arrive to a job scheduler and can be individually allocated to any of the servers. It is shown that if the arrival streams are all Poisson and all jobs have the same exponentially distributed service requirements, the probabilistic splitting of the generic stream that minimizes the average job response time is such that it balances the server idle times in a weighted least-squares sense, where the weighting coefficients are related to the service speeds of the servers. The corresponding result holds for nonexponentially distributed service times if the service speeds are all equal. This result is used to develop adaptive quasi-static algorithms for allocating jobs in the generic arrival stream when the load parameters are unknown. The algorithms utilize server idle-time measurements which are sent periodically to the central job scheduler. A model is developed for these measurements, and the result mentioned is used to cast the problem into one of finding a projection of the root of an affine function, when only noisy values of the function can be observed

State Dependent Attempt Rate modeling of single cell IEEE 802.11 WLANs with homogeneous nodes and Poisson packet arrivals

We study a State Dependent Attempt Rate (SDAR) approximation to model M queues (one queue per node) served by the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol as standardized in the IEEE 802.11 Distributed Coordination Function (DCF). The approximation is that, when n of the M queues are non-empty, the (transmission) attempt probability of each of the n non-empty nodes is given by the long-term (transmission) attempt probability of n saturated nodes. With the arrival of packets into the M queues according to independent Poisson processes, the SDAR approximation reduces a single cell with non-saturated nodes to a Markovian coupled queueing system. We provide a sufficient condition under which the joint queue length Markov chain is positive recurrent. For the symmetric case of equal arrival rates and finite and equal buffers, we develop an iterative method which leads to accurate predictions for important performance measures such as collision probability, throughput and mean packet delay. We replace the MAC layer with the SDAR model of contention by modifying the NS-2 source code pertaining to the MAC layer, keeping all other layers unchanged. By this model-based simulation technique at the MAC layer, we achieve speed-ups (w.r.t. MAC layer operations) up to 5.4. Through extensive model-based simulations and numerical results, we show that the SDAR model is an accurate model for the DCF MAC protocol in single cells. (C) 2012 Elsevier B.V. All rights reserved.

Mechanical properties of glasses and TiO2 nanocrystal glass composites in BaO-TiO2-B2O3 system

Glasses and glass-nanocrystal (anatase TiO2) composites in BaO-TiO2-B2O3 system were fabricated by conventional melt-quenching technique and controlled heat treatment respectively. Poisson's ratio and Young's moduli were predicted through Makishima-Mackenzie theoretical equation for the as-quenched glasses by taking the four and three coordinated borons into account. Mechanical properties of the glasses and glass-nanocrystal composites were investigated in detail through nanoindentation and microindentation studies. Predicted Young's moduli of glasses were found to be in reasonable agreement with nanoindentation Measurements. Hardness and Young's modulus were enhanced with increasing volume fraction of nanocrystallites of TiO2 in glass matrix whereas fracture toughness was found susceptible to the surface features. The results were correlated to the structural units and nanocrystals present in the glasses. (C) 2013 Elsevier B.V. All rights reserved.