On fast factorization pivoting methods for sparse symmetric indefinite systems

Electronic Transactions on Numerical Analysis

Volumn 23, Issue , 2006, Pages 158-179

  Schenk, Olaf ^a   Gärtner, Klaus ^b  

^a UNIVERSITY OF BASEL   (Switzerland)

^b WEIERSTRASS INSTITUTE FOR APPLIED ANALYSIS AND STOCHASTICS   (Germany)

Author keywords

Direct solver; Graph algorithms; Interior point optimization; Pivoting; Sparse matrices; Symmetric indefinite matrix

Indexed keywords

ALGORITHMS; NUMERICAL METHODS; PERTURBATION TECHNIQUES; PROBLEM SOLVING; RELIABILITY;

DIRECT SOLVERS; GRAPH ALGORITHMS; INTERIOR POINT OPTIMIZATION; PIVOTING; SPARSE MATRICES; SYMMETRIC INDEFINITE MATRIX;

LINEAR SYSTEMS;

EID: 33846230007     PISSN: None     EISSN: 10689613     Source Type: Journal    
DOI: None     Document Type: Article

References (31)

1. J. AASEN, On the reduction of a symmetric matrix to triagonal form, BIT, 11 (1971), pp. 233-242.
2. C. ASHCRAFT AND R. GRIMES, The influence of relaxed supernode partitions on the multifrontal method, ACM Trans. Math. Software, 15 (1989), pp. 291-309.
3. C. ASHCRAFT, R. GRIMES, AND J. LEWIS, Accurate symmetric indefinite linear equation solvers, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 513-561.
4. Basel Sparse Matrix Collection, http://computational.unibas.ch/cs/ scicomp/matrices.
5. M. BENZI, J. HAWS, AND M. TUMA, Preconditioning highly indefinite and nonsymmetric matrices, SIAM J. Sei. Comput., 22 (2000), pp. 1333-1353.
6. J. BUNCH AND L. KAUFMANN, Some stable methods for calculating inertia and solving symmetric linear systems, Math. Comp., 31 (1977), pp. 162-179.
7. J. BUNCH AND B. PARLETT, Direct methods for solving indefinite systems of linear equations, SIAM J. Numerical Analysis, 8 (1971), pp. 639-655.
8. T. DAVIS, University of Florida Sparse Matrix Collection, University of Florida, Gainesville. http://www.cise.uf1.edu/davis/sparse/.
9. E. D. DOLAN AND J. MORE, Benchmarking optimization software with performance profiles, Math. Program., 91 (2002), pp. 201-213.
10. I. DUFF, A. ERISMAN, AND J.K.REID.D/recr Methods for Sparse Matrices, Oxford Science Publications, 1986.
11. I. S. DUFF AND J. R. GILBERT, Maximum-weighted matching and block pivoting for symmetric indefinite systems, in Abstract book of Householder Symposium XV, June 17-21 2002, pp. 73-75.
12. 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 Anal. Appl., 20 (1999), pp. 889-901.
13. I. S. DUFF AND S. PRALET, Strategies far scaling and pivoting for sparse symmetric indefinite problems, SIAM J. Matrix Anal. Appl., 27 (2005), pp. 312-340.
14. _, Towards a stable static pivoting strategy for the sequential and parallel solution of sparse symmetric indefinite systems, Technical Report RAL-TR-2005-007, Rutherford Appleton Laboratory, 2005.
15. I. S. DUFF AND J. K. REID, A comparison of sparsity orderings for obtaining a pivotal sequence in Gaussian elimination, J. Institute of Mathematics and its Applications, 14 (1974), pp. 281-291.
16. N. GOULD, Y. HU, AND J. SCOTT, A numerical evaluation of sparse direct solvers for the solution of large sparse, symmetric linear systems of equations, Tech. Report RAL-TR-2005-005, Rutherford Appleton Laboratory, 2005.
17. N. GOULD AND J. SCOTT, A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equationss, ACM Trans. Math. Software, 30 (2004), pp. 300-325.
18. A. GUPTA AND L. YING, On algorithms for finding maximum matchings in bipartite graphs, Tech. Report RC 21576 (97320), IBM T. J. Watson Research Center, Yorktown Heights, NY, October 25, 1999.
19. Harwell Subroutine Library, AEA Technology, Harwell, Oxfordshire, England catalogue of subroutines, 2004.
20. Harwell Subroutine Library Archive, AEA Technology, Harwell, Oxfordshire, England catalogue of subroutines, 2002.
21. J. HAWS AND C. MEYER, Preconditioning KKT systems. Tech. Report M&CT-TECH-01-021, Mathematics and Computing Technology, The Boeing Company, 2001.
22. N. HIGHAM, Accuracy and Stability of Numerical Algorithms, 2nd ed., SIAM, Philadelphia, 2002.
23. G. KARYPIS AND V. KUMAR, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput., 20 (1998), pp. 359-392.
24. X. S. LI AND J. W. DEMMEL, SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems, ACM Trans. Math. Software, 29 (2003), pp. 110-140.
25. M. OLSCHOWKA AND A. NEUMAIER, A new pivoting strategy for gaussian elimination, Linear Algebra Appl., 240 (1996), pp. 131-151.
26. S. RÖLLIN AND O. SCHENK, Maximum-weighted matching strategies and the application to symmetric indefinite systems, Lecture Notes in Computer Science, 3732, Springer, 2006, pp. 808-817.
27. O. SCHENK AND K. GÄRTNER, Solving unsymmetric sparse systems of linear equations with PARDISO, Journal of Future Generation Computer Systems, 20 (2004), pp. 475-487.
28. O. SCHENK, K. GÄRTNER, AND W. FICHTNER, Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors, BIT, 40 (2000), pp. 158-176.
29. O. SCHENK, S. RÖLLIN, AND A. GUPTA, The effects of unsymmetric matrix permutations and scalings in semiconductor device and circuit simulation, IEEE Transactions On Computer-Aided Design Of Integrated Circuits And Systems, 23 (2004), pp. 400-411.
30. O. SCHENK, A. WÄCHTER, AND M. HAGEMANN, Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization, Linear Algebra Issues Arising in Interior Point Methods, special issue of Comput. Optim. Appl., in press.
31. A. WÄCHTER AND L. T. BIEGLER, On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming, Math. Program., 106 (2006), pp. 25-57.