Strategies for scaling and pivoting for sparse symmetric indefinite problems

SIAM Journal on Matrix Analysis and Applications

Volumn 27, Issue 2, 2006, Pages 313-340

  Duff, Iain S ^a   Pralet, Stéphane ^b  

^a RAL   (United Kingdom)

^b CERFACS   (France)

Author keywords

Direct solver for sparse symmetric indefinite matrices; Matching; Ordering; Scaling

Indexed keywords

APPROXIMATION THEORY; NUMERICAL METHODS; PROBLEM SOLVING;

DIRECT SOLVER FOR SPARSE SYMMETRIC INDEFINITE MATRICES; MATCHING; ORDERING; SCALING;

MATRIX ALGEBRA;

EID: 33646246957     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/04061043X     Document Type: Article

References (30)

1. P. R. AMESTOY, T. A. DAVIS, AND I. S. DUFF, An approximate minimum degree ordering algorithm, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 886-905.
2. C. ASHCRAFT, Compressed graphs and the minimum degree algorithm, SIAM J. Sci. Comput., 16 (1995), pp. 1404-1411.
3. J. R. BUNCH AND L. KAUFMAN, Some stable methods for calculating inertia and solving symmetric linear systems, Math. Comp., 31 (1977), pp. 162-179.
4. J. R. BUNCH AND B. N. PARLETT, Direct methods for solving symmetric indefinite systems of linear systems, SIAM J. Numer. Anal., 8 (1971), pp. 639-655.
5. A. R. CURTIS AND J. K. REID, On the automatic scaling of matrices for Gaussian elimination, J. Inst. Math. Appl., 10 (1972), pp. 118-124.
6. T. A. DAVIS, University of Florida Sparse Matrix Collection, 2002, http://www.cise.ufl.edu/ research/sparse/matrices/.
7. E. D. DOLAN AND J. J. MORE, Benchmarking optimization software with performance profiles, Math. Program., 91 (2002), pp. 201-213.
8. I. S. DUFF, MA57 - a code for the solution of sparse symmetric definite and indefinite systems, ACM Trans. Math. Software, 30 (2004), pp. 118-144.
9. I. S. DUFF AND J. R. GILBERT, Maximum-weight matching and block pivoting for symmmetric indefinite systems, in an abstract book of Householder Symposium XV, Peebles, Scotland, 2002.
10. 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.
11. I. S. DUFF AND S. PRALET, Experiments in Preprocessing and Scaling Symmetric Problems for Multifrontal Solutions, Tech. report WN/PA/04/17, CERFACS, Toulouse, France, 2004.
12. I. S. DUFF AND J. K. REID, The multifrontal solution of indefinite sparse symmetric linear systems, ACM Trans. Math. Software, 9 (1983), pp. 302-325.
13. I. S. DUFF AND J. K. REID, The multifrontal solution of unsymmetric sets of linear systems, SIAM J. Sci. Statist. Comput., 5 (1984), pp. 633-641.
14. I. S. DUFF AND J. K. REID, MA47, a Fortran Code for Direct Solution of Indefinite Sparse Symmetric Linear Systems, Tech. report RAL 95-001, Rutherford Appleton Laboratory, Oxon, UK, 1995.
15. I. S. DUFF AND J. K. REID, Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems, ACM Trans. Math. Software, 22 (1996), pp. 227-257.
16. J. EDMONDS, Maximum matching and a polyhedron with 0,1-vertices, J. Res. Nat. Bur. Standards Sect. B, 69 (1965), pp. 125-130.
17. J. EDMONDS, Paths, trees and flowers, Canad. J. Math., 17 (1965), pp. 449-467.
18. H. N. GABOW, Data structures for weighted matching and nearest common ancestors with linking, in Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1990, pp. 434-443.
19. N. I. M. GOULD, D. ORBAN, AND P. L. TOINT, CUTEr and SifDec: A constrained and unconstrained testing environment, revisited, ACM Trans. Math. Software, 29 (2003), pp. 373-394.
20. N. I. M. GOULD AND J. A. SCOTT, A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations, ACM Trans. Math. Software, 30 (2004), pp. 300-325.
21. P. HEGGERNES, S. EISENSTAT, G. KUMFERT, AND A. POTHEN, The computational complexity of the minimum degree algorithm, in Proceedings of the Norwegian Conference on Computer Science NIK, University of Tromso, Norway, 2002.
22. HSL, A Collection of Fortran Codes for Large Scale Scientific Computation, 2004.
23. G. KARYPIS AND V. KUMAR, METIS - A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices - Version 4.0, University of Minnesota, Minneapolis, MN, 1998.
24. G. KUMFERT AND A. POTHEN, Two improved algorithms for envelope and wavefront reduction, BIT, 37 (1997), pp. 559-590.
25. J. W. H. LIU, The role of elimination trees in sparse factorization, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 134-172.
26. I. MAROS AND C. MESZAROS, A repository of convex quadratic programming problems, Optim. Methods Softw., 11/12 (1999), pp. 671-681.
27. E. G. NG AND P. RAGHAVAN, Performance of greedy ordering heuristics for sparse Cholesky factorization, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 902-914.
28. S. PRALET, Constrained Orderings and Scheduling for Parallel Sparse Linear Algebra, Ph.D. thesis, CERFACS, Toulouse, France, 2004, TH/PA/04/105.
29. E. ROTHBERG AND S. C. EISENSTAT, Node selection strategies for bottom-up sparse matrix ordering, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 682-695.
30. D. RUIZ, A Scaling Algorithm to Equilibrate Both Row and Column Norms in Matrices, Tech. report RAL-TR-2001-034, Rutherford Appleton Laboratory, Oxon, UK, 2001; also appeared as ENSEEIHT-IRIT report RT/APO/01/4.