To read this content please select one of the options below:

ANALYSIS OF A DISCRETIZATION ALGORITHM FOR TIME‐DEPENDENT SEMICONDUCTOR MODELS

Michael SEVER (Department of Mathematics, The Hebrew University, Jerusalem, Israel)

Abstract

A new algorithm is presented for the discretization of semiconductor models in one space dimension plus time. A complete error analysis is given, showing that the discretization errors do not depend on any derivatives of ill‐behaved quantities such as carrier densities. In this algorithm, the electrostatic potential is updated from a discretization of the equation of total current continuity, and parabolic equations for the current densities are discretized, rather than those for the carrier densities. Projection methods, e.g. simple finite‐element methods, are used for the space discretization. The equations for the current densities are similar to the familiar Scharfetter‐Gummel expressions in the stationary limit. However, the discrete time‐dependent current densities are required here to be H1 functions of x, obtained in a space with at least second order approximation property in L2. This method is fully compatible with recently developed methods for uncoupling the discrete systems to be solved at each time step, for an individual device or when a given problem involves multiple, coupled devices.

Citation

SEVER, M. (1987), "ANALYSIS OF A DISCRETIZATION ALGORITHM FOR TIME‐DEPENDENT SEMICONDUCTOR MODELS", COMPEL - The international journal for computation and mathematics in electrical and electronic engineering, Vol. 6 No. 3, pp. 171-189. https://doi.org/10.1108/eb010033

Publisher

:

MCB UP Ltd

Copyright © 1987, MCB UP Limited

Related articles