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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Karypis, G., Kumar, V.: ParMETIS: Parallel graph partitioning and sparse matrix ordering library. Tech. rep. # 97-060, University of Minnesota (1997)
Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes in C. 2nd ed., Cambridge University Press (1994)
Saad, Y.: Iterative Methods for Sparse Linear Systems. PWS, Boston (1996)
Saad, Y., Sosonkina, M.: Distributed Schur complement techniques for general sparse linear systems. SISC 21 (1999) 1337–1356
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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