arXiv subjects

M. Paul Laiu

Publications and source records attributed to M. Paul Laiu.

22 records · Page 2Linked to original sources

arXiv2019

A fast implicit solver for semiconductor models in one space dimension

Several different approaches are proposed for solving fully implicit discretizations of a simplified Boltzmann-Poisson system with a linear relaxation-type collision kernel. This system models the evolution of free electrons in semiconductor devices under a low-density assumption. At each implicit time step, the discretized system is formulated as a fixed-point problem, which can then be solved with a variety of methods. A key algorithmic component in all the approaches considered here is a recently developed sweeping algorithm for Vlasov-Poisson systems. A synthetic acceleration scheme has been implemented to accelerate the convergence of iterative solvers by using the solution to a drift-diffusion equation as a preconditioner. The performance of four iterative solvers and their accelerated variants has been compared on problems modeling semiconductor devices with various electron mean-free-path.

physics.comp-ph↗

arXiv2018

Analysis of the Zero Relaxation Limit of Systems of Hyperbolic Conservation Laws with Random Initial Data

We show the convergence of the zero relaxation limit in systems of $2 \times 2$ hyperbolic conservation laws with stochastic initial data. Precisely, solutions converge to a solution of the local equilibrium approximation as the relaxation time tends to zero. The initial data are assumed to depend on finitely many random variables, and the convergence is then proved via the appropriate analogues of the compensated compactness methods used in treating the deterministic case. We also demonstrate the validity of this limit in the case of the semi-linear $p$-system; the well-posedness of both the system and its equilibrium approximation are proved, and the convergence is shown with no a priori conditions on solutions. This model serves as a prototype for understanding how asymptotic approximations can be used as control variates for hyperbolic balance laws with uncertainty.

math.AP↗

arXiv2018

A Constraint-Reduced MPC Algorithm for Convex Quadratic Programming, with a Modified Active Set Identification Scheme

A constraint-reduced Mehrotra-Predictor-Corrector algorithm for convex quadratic programming is proposed. (At each iteration, such algorithms use only a subset of the inequality constraints in constructing the search direction, resulting in CPU savings.) The proposed algorithm makes use of a regularization scheme to cater to cases where the reduced constraint matrix is rank deficient. Global and local convergence properties are established under arbitrary working-set selection rules subject to satisfaction of a general condition. A modified active-set identification scheme that fulfills this condition is introduced. Numerical tests show great promise for the proposed algorithm, in particular for its active-set identification scheme. While the focus of the present paper is on dense systems, application of the main ideas to large sparse systems is briefly discussed.

math.OC↗

arXiv2018

A Positive Asymptotic Preserving Scheme for Linear Kinetic Transport Equations

We present a positive and asymptotic preserving numerical scheme for solving linear kinetic, transport equations that relax to a diffusive equation in the limit of infinite scattering. The proposed scheme is developed using a standard spectral angular discretization and a classical micro-macro decomposition. The three main ingredients are a semi-implicit temporal discretization, a dedicated finite difference spatial discretization, and realizability limiters in the angular discretization. Under mild assumptions on the initial condition and time step, the scheme becomes a consistent numerical discretization for the limiting diffusion equation when the scattering cross-section tends to infinity. The scheme also preserves positivity of the particle concentration on the space-time mesh and therefore fixes a common defect of spectral angular discretizations. The scheme is tested on the well-known line source benchmark problem with the usual uniform material medium as well as a medium composed from different materials that are arranged in a checkerboard pattern. We also report the observed order of space-time accuracy of the proposed scheme.

math.NA↗