Abstract
Supernode pivoting for unsymmetric matrices coupled with supernode partitioning and asynchronous computation can achieve high gigaflop rates for parallel sparse LU factorization on shared memory parallel computers. The progress in weighted graph matching algorithms helps to extend these concepts further and prepermutation of rows is used to place large matrix entries on the diagonal. Supernode pivoting allows dynamical interchanges of columns and rows during the factorization process. The BLAS-3 level efficiency is retained. An enhanced left—right looking scheduling scheme is uneffected and results in good speedup on SMP machines without increasing the operation count. These algorithms have been integrated into the recent unsymmetric version of the PARDISO solver. Experiments demonstrate that a wide set of unsymmetric linear systems can be solved and high performance is consistently achieved for large sparse unsymmetric matrices from real world applications.
This work was supported by the Swiss Commission of Technology and Innovation KTI under contract number 5648.1.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
P. R. Amestoy, I. S. Duff, J.-Y. L’Excellent, and X. S. Li. Analysis and comparison of two general sparse solvers for distributed memory computers. Technical Report TR/PA/00/90, CERFACS, Toulouse, France, December 2000. Submitted to ACM Trans. Math. Softw.
Patrick R. Amestoy, Iain S. Duff, Jean-Yves L’Excellent, and Jacko Koster. A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM J. Matrix Analysis and Applications, 23(1):15–41, 2001.
Mario Arioli, James W. Demmel, and Iain S. Duff. Solving sparse linear systems with sparse backward error. SIAMJ. Matrix Analysis and Applications, 10:165–190, 1989.
R.E. Bank, D.J. Rose, and W. Fichtner. Numerical methods for semiconductor device simulation. SIAM Journal on Scientific and Statistical Computing, 4(3):416–435, 1983.
T. A. Davis and I. S. Duff. An unsymmetric-pattern multifrontal method for sparse LU factorization. SIAM J. Matrix Analysis and Applications, 18(1):140–158, 1997.
Timothy A. Davis. UMFPACK. Software for unsymmetric multifrontal method. In NA Digest, 01(11), March 18, 2001., http://www.cise.ufl.edu/research/sparse/umfpack.
J. Demmel, J. Gilbert, and X. Li. An asynchronous parallel supernodal algorithm to sparse partial pivoting. SIAM Journal on Matrix Analysis and Applications, 20(4):915–952, 1999.
J. W. Demmel, S. C. Eisenstat, J. R. Gilbert, X. S. Li, and J. W.-H. Liu. A supernodal approach to sparse partial pivoting. SIAM J. Matrix Analysis and Applications, 20(3):720–755, 1999.
I. S. Duff and J. Koster. The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. Technical Report TR/PA/97/45, CERFACS, Toulouse, France, 1997. Also appeared as Report RAL-TR-97-059, Rutherford Appleton Laboratories, Oxfordshire.
I. S. Duff and J. Koster. The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM J. Matrix Analysis and Applications, 20(4):889–901, 1999.
A. Gupta. Fast and effective algorithms for solving graph partitioning and sparse matrix ordering. IBM Journal of Research and Development, 41(1/2):171–183, January/March 1997.
A. Gupta. Improved symbolic and numerical factorization algorithms for unsymmetric sparse matrices. Technical Report RC 22137 (99131), IBM T. J. Watson Research Center, Yorktown Heights, NY, August 1, 2001.
A. Gupta. Recent advances in direct methods for solving unsymmetric sparse systems of linear equations. Technical Report RC 22039 (98933), IBM T. J. Watson Research Center, Yorktown Heights, NY, April 20, 2001.
G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20(1):359–392, 1998.
X.S. Li and J.W Demmel. A scalable sparse direct solver using static pivoting. In Proceeding of the 9th SIAM conference on Parallel Processing for Scientic Computing, San Antonio, Texas, March 22-34, 1999.
E.G. Ng and B.W. Peyton. Block sparse Cholesky algorithms on advanced uniprocessor computers. SIAM Journal on Scientific Computing, 14:1034–1056, 1993.
O. Schenk. Scalable Parallel Sparse LU Factorization Methods on Shared Memory Multiprocessors. PhD thesis, ETH Zürich, 2000.
O. Schenk and K. Gärtner. Two-level scheduling in PARDISO: Improved scalability on shared memory multiprocessing systems. Accepted for publication in Parallel Computing.
O. Schenk and K. Gärtner. PARDISO: a high performance serial and parallel sparse linear solver in semiconductor device simulation. Future Generation Computer Systems, 789(1):1–9, 2001.
O. Schenk, K. Gärtner, and W Fichtner. Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors. BIT, 40(1):158–176, 2000.
P. Sonneveld. CGS, a fast Lanczos-type solver for nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing, 10:36–52, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schenk, O., Gärtner, K. (2002). Solving Unsymmetric Sparse Systems of Linear Equations with PARDISO. In: Sloot, P.M.A., Hoekstra, A.G., Tan, C.J.K., Dongarra, J.J. (eds) Computational Science — ICCS 2002. ICCS 2002. Lecture Notes in Computer Science, vol 2330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46080-2_37
Download citation
DOI: https://doi.org/10.1007/3-540-46080-2_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43593-8
Online ISBN: 978-3-540-46080-0
eBook Packages: Springer Book Archive