Diagonal Markowitz scheme with local symmetrization

SIAM Journal on Matrix Analysis and Applications

Volumn 29, Issue 1, 2006, Pages 228-244

  Amestoy, Patrick R ^a   Li, Xiaoye S ^b   Ng, Esmond G ^b  

^a UNIVERSITÉ DE TOULOUSE   (France)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

Linear equations; Ordering methods; Sparse nonsymmetric matrices

Indexed keywords

ORDERING ALGORITHMS; ORDERING METHODS; SPARSE NONSYMMETRIC MATRICES;

COMPUTATIONAL COMPLEXITY; LINEAR EQUATIONS; MATRIX ALGEBRA; NUMERICAL METHODS;

ALGORITHMS;

EID: 39449132849     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/050637315     Document Type: Article

References (26)

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. P. R. AMESTOY AND I. S. DUFF, Vectorization of a multiprocessor multifrontal code, Int. J. Supercomputer Appl., 3 (1989), pp. 41-59.
3. 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, ACM Trans. Math. Software, 27 (2001), pp. 388-421.
4. P. R. AMESTOY, X. S. LI AND E. G. NG, Diagonal Markowitz Scheme with Local Symmetrization, Technical report LBNL-53854, Lawrence Berkeley National Laboratory, Berkeley, CA, 2003;
5. also appeared as ENSEEIHT-IRIT report RT/APO/03/05.
6. P. R. AMESTOY, X. S. LI, AND S. PRALET, Unsymmetric ordering using a constrained Markowitz scheme, SIAM J. Matrix Anal. Appl., to appear.
7. P. R. AMESTOY AND C. PUGLISI, An unsymmetrized multifrontal LU factorization, SIAM J. Matrix Anal. Appl., 24 (2002), pp. 553-569.
8. T. A. DAVIS, A column pre-ordering strategy for the unsymmetric-pattern multifrontal method, ACM Trans. Math. Software, 30 (2004), pp. 165-195.
9. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, The Rutherford-Boeing Sparse Matrix Collection, Technical report RAL-TR-97-031, Rutherford Appleton Laboratory, Didcot, UK, 1997;
10. also Technical report ISSTECH-97-017 from Boeing Information & Support Services and Report TR/PA/97/36 from CERFACS, Toulouse; http://www.cse.clrc.ac.uk/Activity/SparseMatrices/.
11. 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.
12. I. S. DUFF AND J. KOSTER, On algorithms for permuting large entries to the diagonal of a sparse matrix, SIAM J. Matrix Anal. Appl., 22 (2001), pp. 973-996.
13. I. S. DUFF, A. M. ERISMAN, AND J. K. REID, Direct Methods for Sparse Matrices, Oxford University Press, Oxford, UK, 1987.
14. I. S DUFF AND J. K. REID, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Trans. Math. Software, 9 (1983), pp. 302-325, 1983.
15. A. GEORGE AND J. W. H. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
16. K. GOTO, High-Performance BLAS, http://www.cs.utexas.edu/ users/fiame/goto/.
17. HSL, A Collection of Fortran Codes for Large Scale Scientific Computation, http://www.cse. clrc.ac.uk/Activity/HSL (2000).
18. 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.
19. J. W. H. LIU, Modification of the minimum degree algorithm by multiple elimination, ACM Trans. Math. Software, 11 (1985), pp. 141-153.
20. J. W. H. LIU, The role of elimination trees in sparse factorization, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 134-172.
21. H. M. MARKOWITZ, The elimination form of the inverse and its application to linear programming, Management Sci., 3 (1957), pp. 255-269.
22. 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.
23. M. OLSHOWKA AND A. NEUMAIER, A new pivoting strategy for Gaussian elimination, Linear Algebra Appl., 240 (1996), pp. 131-151.
24. G. PAGALLO AND C. MAULINO, A bipartite quotient graph model for unsymmetric matrices, in Numerical Methods, Lecture Notes in Math. 1005, Springer-Verlag, New York, 1983, pp. 227-239.
25. D. J. ROSE AND R. E. TARJAN, Algorithmes aspects of vertex elimination on directed graphs, SIAM J. Appl. Math., 34 (1978), pp. 176-197.
26. 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.