A parallel linear system solver for circuit simulation problems

Numerical Linear Algebra with Applications

Volumn 7, Issue 7-8, 2000, Pages 649-665

  Bomhof, C W ^a,b   Van Der Vorst, H A ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

^b PHILIPS RESEARCH LABORATORIES   (Netherlands)

Author keywords

Circuit simulation; GMRES; Iterative solution methods; Mixed direct iterative method; Parallel iterative method; Preconditioner; Schur complement; Sparse LU factorization

Indexed keywords

EID: 0034367303     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/1099-1506(200010/12)7:7/8<649::AID-NLA217>3.0.CO;2-W     Document Type: Article

References (26)

1. McQuain WD, Ribbens CJ, Watson LT, Melville RC. Preconditioned iterative methods for sparse linear algebra problems arising in circuit simulation. Computational Mathematics and Applications 1994; 27(8):25-45.
2. Hysom D, Pothen A. Efficient computation of ILU preconditioners. In Super Computing 1999 Conference Proceedings, available at: http://www.sc99.org/proceedings/papers/hysom.pdf
3. Karypis G, Kumar V. Parallel threshold-based ILU factorization. In Super Computing 1997 Conference Proceedings, available at: http://www. supercomp.org/sc97/proceedings/TECH/KARYPIS/_INDEX.HTM
4. Lengowski L. CGS preconditioned with ILUT as a solver for circuit simulation. Nat. Lab Unclassified Report 828/98, Philips Electronics N.V., 1998.
5. Demmel JW, Gilbert JR, Li XS. An asynchronous parallel supernodal algorithm for sparse Gaussian elimination. SIAM Journal on Matrix Analysis and Applications 1999; 20(4):915-952.
6. Rothberg E, Silicon Graphics, Inc. Man-page for PSLDU.
7. Li XS, Demmel JW. Making sparse Gaussian elimination scalable by static pivoting. In Proceedings of Supercomputing 98 Conference, 7-13 November 1998, Orlando, FL.
8. Jiang B, Richman S, Shen K, Yang T. Efficient sparse LU factorization with lazy space allocation. In SIAM 1999 Parallel Processing Conference on Scientific Computing. 1999.
9. McCalla WJ. Fundamentals of computer-aided Circuit Simulation. Kluwer Academic: Dordrecht, The Netherlands, 1988.
10. Liu JWH. Modification of the minimum degree algorithm by multiple elimination. ACM Transactions on Mathematical Software 1985; 11:141-153.
11. Duff IS, Erisman AM, Reid JK. Direct Methods for Sparse Matrices. Oxford University Press, Oxford, UK, 1986.
12. Kundert K. Sparse matrix techniques. In Circuit Analysis, Simulation and Design, Ruehli A (ed.), North-Holland, 1986.
13. Gilbert JR, Moler C, Schreiber R. Sparse matrices in Matlab: design and implementation. SIAM Journal on Matrix Analysis and Applications 1992; 13(1):333-356.
14. Saad Y, Schultz M. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing 1986; 7:856-869.
15. Liu JWH. The role of elimination trees in sparse factorization. SIAM Journal on Matrix Analysis and Applications 1990; 11(1):134-172.
16. Bomhof CW. Implementation of a parallel mixed direct/iterative linear system solver. PhD thesis, Mathematical Institute, Utrecht University, to appear.
17. Karypis G, Kumar V. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 1999; 20:359-392.
18. Hendrickson B, Leland R. An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM Journal on Scientific and Statistical Computing 1995; 16(2):452-469.
19. Duff IS, Koster J. The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM Journal on Matrix Analysis and Applications 1999; 20(4):889-901.
20. Matrix Market. Collection of test matrices. Available at: http://math.nist.gov/MatrixMarket/ index.html.
21. Larimore SI. An approximate minimum degree column ordering algorithm. MS thesis, CISE Technical Report TR-98-016, University of Florida, 1998. Available at ftp://ftp.cise.ufl.edu/cis/tech-reports/ tr98/tr98-016.ps
22. Gilbert JR, Peierls T. Sparse partial pivoting in time proportional to arithmetic operations. SIAM Journal on Scientific Computing 1988; 9(5):862-874.
23. Eisenstat SC, Liu JWH. Exploiting structural symmetry in unsymmetric sparse symbolic factorization. SIAM Journal on Matrix Analysis and Applications 1992; 13(1):202-211.
24. Eisenstat SC, Liu JWH. Exploiting structural symmetry in a sparse partial pivoting code. SIAM Journal on Matrix Analysis and Applications 1993; 14(1):253-257.
25. Demmel JW, Eisenstat SC, Gilbert JR, Li XS, Liu JWH. A supernodal approach to sparse partial pivoting. SIAM Journal on Matrix Analysis and Applications 1999; 20(3):720-755.
26. Davis TA, Duff IS. An unsymmetric-pattern multifrontal method for sparse LU factorization. SIAM Journal on Matrix Analysis and Applications 1997; 18(1):140-158.