Skip to main content

About the dependence of the convergence of Gummel’s algorithm and its linear variants on the device geometry

  • Chapter
Mathematical Modelling and Simulation of Electrical Circuits and Semiconductor Devices

Abstract

The convergence of Gummel’algorithm is known for sufficiently small currents or sufficiently small MOSFET-devices. We take a closer look at the dependence of the convergence of Gummel’s algorithm and two linear variants on the device geometry. Using spectral analysis we give a sufficient condition for local convergence, where the geometry enters as the smallest eigenvalue of a certain general eigenvalue problem. Estimating the eigenvalue with a maximum principle yields an upper limit for the size of the device which guarantees local convergence of all of the three algorithms. Finally we compare à priori estimates with the computed eigenvalues.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Joseph W. Jerome, The Role of Semiconductor Device Diameter and Energy-Band-Bending in Convergence of Picard Iteration for Gummel’s Map, IEEE Trans. Elec. Dev., ED-32, No. 10, October 1985, pp 2045–2051.

    Article  Google Scholar 

  2. Thomas Kerkhoven, A Spectral Analysis of the Decoupling Algorithm for Semiconductor Simulation, Report No. UIUCDCS-R-87-1323, March 1987, University of Illinois.

    Google Scholar 

  3. Thomas Kerkhoven, A Proof of Convergence of Gummel’s Algorithm for Realistic Device Geometries, SIAM J. Num. Anal., Vol 23, No. 6, December 1986.

    Google Scholar 

  4. Ortega, Rheinboldt, Iterative Solutions of Nonlinear Equations in Several Variables, Academic Press, 1970.

    Google Scholar 

  5. Rainer-Sawatzki, Eine lokale Konvergenzanalyse iterativer Verfahren zur Lösung der stationären Halbleitergleichungen mit numerischen Beispielen, Dissertation am Fachbereich Mathematik der Universität Hamburg, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer Basel AG

About this chapter

Cite this chapter

Sawatzki, R. (1990). About the dependence of the convergence of Gummel’s algorithm and its linear variants on the device geometry. In: Bank, R.E., Merten, K., Bulirsch, R. (eds) Mathematical Modelling and Simulation of Electrical Circuits and Semiconductor Devices. International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik / Série internationale d’Analyse numérique, vol 93. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-5698-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-5698-0_17

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-5700-0

  • Online ISBN: 978-3-0348-5698-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics