Parallel Iterative Solvers for Sparse Linear Systems in Circuit Simulation

  • Achim Basermann
  • Uwe Jaekel
  • Koutaro Hachiya
Conference paper
Part of the The European Consortium for Mathematics in Industry book series (MATHINDUSTRY, volume 5)

Abstract

One of the mathematical problems in the simulation of large electrical circuits is the solution of high-dimensional linear equation systems. While these systems are usually solved by direct methods iterative solvers are likely to outperform these if the problem dimensions are large enough. Though it is often possible to reduce the system size by utilizing the hierarchical design of electrical circuits some important problems do not lend themselves easily to this approach, and the demand for efficient solvers is ever-increasing.

Keywords

Europe 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [KK97]
    Karypis, G., Kumar, V.: ParMETIS: Parallel graph partitioning and sparse matrix ordering library. Tech. rep. # 97–060, University of Minnesota (1997)Google Scholar
  2. [SS99]
    Saad, Y., Sosonkina, M.: Distributed Schur complement techniques for general sparse linear systems. SISC, 21, 1337–1356 (1999)MathSciNetGoogle Scholar
  3. [V92]
    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, 631–644 (1992)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Achim Basermann
    • 1
  • Uwe Jaekel
    • 1
  • Koutaro Hachiya
    • 2
  1. 1.C&C Research LaboratoriesNEC Europe Ltd.Sankt AugustinGermany
  2. 2.System LSI Design Engineering DivisionNEC Electron DevicesKawasaki, KanagawaJapan

Personalised recommendations