Skip to main content

The Application of Sparse Supernodal Factorization Algorithms for Structurally Symmetric Linear Systems in Semiconductor Device Simulation

  • Conference paper
Simulation of Semiconductor Devices and Processes

Abstract

It is well known that the solution of sparse linear systems, generally expressed in the form Ax = b, is a core task of numerical simulation. In case of semiconductor device simulation the coefficient matrix A is unsymmetric, but structurally symmetric ([2]). The solution of linear systems can be achieved by iterative or direct methods. While iterative methods do not always lead to a solution due to matrix conditions, direct methods usually consume more time and memory.

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. C.C. Ashcraft, R.R. Grimes, J.G. Lewis, B.W. Peyton, and H.D. Simon. Progress in sparse matrix methods for large linear systems on vector supercomputers. The International Journal of Supercomputer Applications, 1(4):10–30, 1987.

    Article  Google Scholar 

  2. G. Heiser, C. Pommerell, J.Weis, and W. Fichtner. Three dimensional numerical semiconductor device simulation: Algorithms, architectures, results. IEEE Transactions on Computer-Aided Design of Integrated Circuits, 10(10):1218–1230,1991.

    Article  Google Scholar 

  3. A. Liegmann. The application of supernodal techniques on the solution of structurally symmetric systems. Technical Report 92/5, Institut für Integrierte Systeme (ETH Zürich), 1992.

    Google Scholar 

  4. A. Liegmann and W. Fichtner. The application of supernodal factorization algorithms for structurally symmetric linear systems in semiconductor device simulation. Technical Report 92/17, Institut für Integrierte Systeme (ETH Zürich), 1993. Submitted to The International Journal of Supercomputer Applications.

    Google Scholar 

  5. J.W.H. Liu. Modification of the Minimum-Degree algorithm by multiple elimination. ACM Transactions on Mathematical Software, 11(2):141–153, 1985.

    Article  MATH  Google Scholar 

  6. E.G. Ng and B.W. Peyton. Block sparse Cholesky algorithms on advanced uniprocessor computers. Technical Report TM-11960, Oak Ridge National Laboratory, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Wien

About this paper

Cite this paper

Liegmann, A., Fichtner, W. (1993). The Application of Sparse Supernodal Factorization Algorithms for Structurally Symmetric Linear Systems in Semiconductor Device Simulation. In: Selberherr, S., Stippel, H., Strasser, E. (eds) Simulation of Semiconductor Devices and Processes. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6657-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6657-4_18

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-7091-7372-5

  • Online ISBN: 978-3-7091-6657-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics