Skip to main content

Parallel Solution Techniques for Sparse Linear Systems in Circuit Simulation

  • Conference paper
Scientific Computing in Electrical Engineering

Part of the book series: Mathematics in Industry ((MATHINDUSTRY,volume 4))

Abstract

For solving sparse linear systems from circuit simulation whose coefficient matrices include a few dense rows and columns, a parallel Bi-CGSTAB algorithm with distributed Schur complement (DSC) preconditioning is presented. The parallel efficiency of the solver is increased by transforming the equation system into a problem without dense rows and columns as well as by exploitation of parallel graph partitioning methods. The costs of local, incomplete LU decompositions are decreased by fill-in reducing reordering methods of the matrix and a threshold strategy for the factorization. The efficiency of the parallel solver is demonstrated with real circuit simulation problems on a PC cluster.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Karypis, G., Kumar, V.: ParMETIS: Parallel graph partitioning and sparse matrix ordering library. Tech. rep. # 97-060, University of Minnesota (1997)

    Google Scholar 

  2. Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes in C. 2nd ed., Cambridge University Press (1994)

    Google Scholar 

  3. Saad, Y.: Iterative Methods for Sparse Linear Systems. PWS, Boston (1996)

    MATH  Google Scholar 

  4. Saad, Y., Sosonkina, M.: Distributed Schur complement techniques for general sparse linear systems. SISC 21 (1999) 1337–1356

    MathSciNet  Google Scholar 

  5. Van der Vorst, H.: Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 13 (1992) 631–644

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Basermann, A., Cortial-Goutaudier, F., Jaekel, U., Hachiya, K. (2004). Parallel Solution Techniques for Sparse Linear Systems in Circuit Simulation. In: Schilders, W.H.A., ter Maten, E.J.W., Houben, S.H.M.J. (eds) Scientific Computing in Electrical Engineering. Mathematics in Industry, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55872-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-55872-6_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21372-7

  • Online ISBN: 978-3-642-55872-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics