A Proof of Convergence of Gummel’s Algorithm for Realistic Device Geometries (Q4720748)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3992888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Proof of Convergence of Gummel’s Algorithm for Realistic Device Geometries |
scientific article; zbMATH DE number 3992888 |
Statements
A Proof of Convergence of Gummel’s Algorithm for Realistic Device Geometries (English)
0 references
1986
0 references
semiconductor simulation
0 references
Gummel's method
0 references
regularity
0 references
0.846928060054779
0 references
0.8279950022697449
0 references
Convergence is proven for a typical example from the class of highly successful decoupling algorithms for semiconductor simulation, collectively known as \textit{H. K. Gummel}'s method [A self-consistent iterative scheme for one-dimensional steady state transistor calculations, IEEE Trans. Elec. Dev., ED-11, 455-465 (1964)], for one-, two-, and three-dimensional models. Because a nonlinear equation is solved for the potential u at every step, the considered version corresponds closely to the algorithms used for numerical computation in practice. As opposed to most earlier publications, the dependence of the regularity of the solution on the device geometry and the nature of the boundary conditions for the system of mixed boundary value problems is considered. By a detailed analysis of the boundary conditions for a typical two-, or three-dimensional device a theoretical regularity result by \textit{M. K. V. Murthy} and \textit{G. Stampacchia} [Israel J. Math. 13, 188-224 (1972; Zbl 0255.35027)] can be applied. Hence it follows that for a physically realistic device geometry the solution is sufficiently regular for the algorithm to converge.
0 references