Unsymmetric ordering using a constrained Markowitz scheme

SIAM Journal on Matrix Analysis and Applications

Volumn 29, Issue 1, 2006, Pages 302-327

  Amestoy, Patrick R ^a   Li, Xiaoye S ^b   Pralet, Stéphane ^a  

^a UNIVERSITÉ DE TOULOUSE   (France)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

Bipartite quotient graph; Greedy heuristics; Ordering methods; Sparse unsymmetric matrices

Indexed keywords

BIPARTITE QUOTIENT GRAPH; GREEDY HEURISTICS; ORDERING METHODS; SPARSE UNSYMMETRIC MATRICES;

FACTORIZATION; GRAPH THEORY; HEURISTIC METHODS; NUMERICAL METHODS; PROBLEM SOLVING;

ALGORITHMS;

EID: 39449136272     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/050622547     Document Type: Article

References (40)

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, International Journal of Supercomputer Applications, 3 (1989), pp. 41-59.
3. P. R. AMESTOY, I. S. DUFF, J.-Y. L'EXCELLENT, AND J. KOSTER, A fully asynchronous multi-frontal solver using distributed dynamic scheduling, SIAM J. Matrix Anal. Appl., 23 (2001), pp. 15-41.
4. 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.
5. P. R. AMESTOY, X. S. LI, AND E. NG, Diagonal Markowitz scheme with local symmetrization, Tech. rep. RT/APO/03/5, ENSEEIHT-IRIT, Toulouse, France, 2003.
6. Also appeared as Lawrence Berkeley Lab report LBNL-53854, Berkeley, CA, 2003.
7. P. R. AMESTOY, X. S. LI, AND S. PRALET, Constrained Markowitz with local symmetrization, Technical rep. RT/APO/04/05, ENSEEIHT-IRIT, Toulouse, France, 2004.
8. Also appeared as Lawrence Berkeley Lab report LBNL-56861, Berkeley, CA, 2005, and CERFACS report TR/PA/04/137, Toulouse, France, 2004.
9. P. R. AMESTOY AND C. PUGLISI, An unsymmetrized multifrontal LU factorization, SIAM J. Matrix Anal. Appl., 24 (2002), pp. 553-569.
10. M. ARIOLI, J. DEMMEL, AND I. S. DUFF, Solving sparse linear systems with sparse backward error, SIAM J. Matrix Anal., Appl., 10 (1989), pp. 165-190.
11. C. ASHCRAFT, Compressed graphs and the minimum degree algorithm, SIAM J. Sci. Comput., 16 (1995), pp. 1404-1411.
12. C. ASHCRAFT AND R. G. GRIMES, SPOOLES: An object-oriented sparse matrix library, in Proceedings of the Ninth Annual SIAM Conference on Parallel Processing for Scientific Computing (San Antonio, TX), SIAM, Philadelphia, 1999.
13. T. A. DAVIS, University of Florida sparse matrix collection, http://www.cise.ufl.edu/research/sparse/matrices, 2002.
14. T. A. DAVIS, Algorithm 832: UMFPACK V4.3 - an unsymmetric-pattern multifrontal method, ACM Trans. Math. Software, 30 (2004), pp. 196-199.
15. T. A. DAVIS AND I. S. DUFF, An unsymmetric-pattern multifrontal method for sparse LU factorization, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 140-158.
16. 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 Anal. Appl., 20 (1999), pp. 720-755.
17. I. S. DUFF, A. M. ERISMAN, AND J. K. REID, Direct Methods for Sparse Matrices, Oxford University Press, London, 1986.
18. 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.
19. 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.
20. I. S. DUFF AND J. K. REID, A comparison of sparsity orderings for obtaining a pivotal sequence in Gaussian elimination, J. Inst. Math, Appl., 14 (1974), pp. 281-291.
21. I. S. DUFF AND J. K. REID, MA27 - a set of Fortran subroutines for solving sparse symmetric sets of linear equations, Technical rep. R. 10533, AERE, Harwell, England, 1982.
22. 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.
23. I. S. DUFF AND J. K. REID, The multifrontal solution of unsymmetric sets of linear equations, SIAM J. Sci. Statist. Comput., 5 (1984), pp. 633-641.
24. I. S. DUFF AND J. K. REID, MA47, o Fortran code for direct solution of indefinite sparse symmetric linear systems, Tech. Rep. RAL 95-001, Rutherford Appleton Laboratory, Chilton, Didcot, Oxon, UK, 1995.
25. A. GEORGE AND J. W. H. LIU, A fast implementation of the minimum degree algorithm using quotient graphs, ACM Trans. Math. Software, 6 (1980), pp. 337-358.
26. A. GEORGE AND J. W. H. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
27. A. GEORGE AND D. R. MCINTYRE, On the application of the minimum degree algorithm to finite element systems, SIAM J. Numer. Anal., 15 (1978), pp. 90-112.
28. A. GUPTA, Recent advances in direct methods for solving unsymmetric sparse systems of linear equations, ACM Trans. Math. Software, 28 (2002), pp. 301-324.
29. X. S. LI AND J. W. DEMMEL, A scalable sparse direct solver using static pivoting, in Proceedings of the Ninth Annual SIAM Conference on Parallel Processing for Scientific Computing (San Antonio, TX), SIAM, Philadelphia, 1999.
30. 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.
31. J. W. H. LIU, Modification of the minimum degree algorithm by multiple elimination, ACM Trans. Math. Software, U (1985), pp. 141-153.
32. E. NG AND P. RAGHAVAN, Performance of greedy ordering heuristics for sparse Cholesky fac-torization, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 902-914.
33. G. PAGALLO AND C. MAULINO, A bipartite quotient graph model for unsymmetric matrices, in Numerical Methods, Lecture Notes in Math. 1005, Springer-Verlag, Berlin, 1983, pp. 227-239.
34. S. PRALET, Constrained Orderings and Scheduling for Parallel Sparse Linear Algebra, Ph.D. thesis, Institut National Polytechnique de Toulouse, Toulouse, France, 2004. Available as CERFACS technical report, TH/PA/04/105, 2004.
35. 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.
36. A. F. VAN DER STAPPEN, R. H. BISSELING, AND J. G. G. VAN DE VORST, Parallel sparse LU decomposition on a mesh network of transputers, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 853-879.
37. R. C. WHALEY AND A. PETITET, Minimizing development and maintenance costs in supporting persistently optimized BLAS, Software: Practice and Experience, 35 (2005), pp. 101-121. Also available online from http://www.cs.utsa.edu/~whaley/papers/spercw04.ps.
38. R. C. WHALEY, A. PETITET, AND J. J. DONGARRA, Automated empirical optimization of software and the ATLAS project, Parallel Computing, 27 (2001), pp. 3-35.
39. Also available as University of Tennessee LAPACK Working Note 147, UT-CS-00-448, University of Tennessee, Knoxville, TN, 2000, http://www.netlib. org/lapack/lawns/lawn147.ps, 2000.
40. Z. ZLATEV, On some pivotal strategies in Gaussian elimination by sparse technique, SIAM J. Numer. Anal., 17 (1980), pp. 18-30.