The design and use of algorithms for permuting large entries to the diagonal of sparse matrices

SIAM Journal on Matrix Analysis and Applications

Volumn 20, Issue 4, 1999, Pages 889-901

  Duff, Iain S ^a   Koster, Jacko ^a,b  

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

^b CERFACS   (France)

Author keywords

Direct methods; Iterative methods; Maximum transversal; Preconditioning; Sparse matrices

Indexed keywords

EID: 0033242220     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479897317661     Document Type: Article

References (19)

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, Internat. J. Supercomputer Appl., 3 (1989), pp. 41-59.
3. M. ARIOLI, I. DUFF, J. NOAILLES, AND D. RUIZ, A block projection method for sparse matrices, SIAM J. Sci. Statistical Comput., 13 (1992), pp. 47-70.
4. M. BENZI, H. CHOI, AND D. SZYLD, Threshold ordering for preconditioning nonsymmetric problems, in Proc. Workshop on Scientific Computing '97, Hong Kong, G. H. Golub, ed., Lecture Notes in Comput. Sci., Springer-Verlag, Berlin, New York, 1997, pp. 159-165.
5. T. A. DAVIS. University of Florida Sparse Matrix Collection, http://www.cise.ufl.edu/~davis, ftp://ftp.cise.ufl.edu/pub/faculty/davis (1997).
6. I. S. DUFF, MA28 - A Set of Fortran Subroutines for Sparse Unsymmetric Linear Equations, Tech. report AERE R8730, Her Majesty's Stationery Office, London, UK, 1977.
7. I. S. DUFF, The design and use of a frontal scheme for solving sparse unsymmetric equations, in Numerical Analysis, Proc. 3rd IIMAS Workshop, Lecture Notes in Math. 909, J. P. Hennart, ed., Springer-Verlag, Berlin, New York, pp. 240-247.
8. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
9. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, Users' Guide for the Harwell-Boeing Sparse Matrix Collection (Release I), Tech. report RAL 92-086, Rutherford Appleton Laboratory, Oxon, UK, 1992.
10. 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.
11. 1/2T) assignment algorithms, ACM Trans. Math. Software, 14 (1988), pp. 267-287.
12. D. FULKERSON, I. GLICKSBERG, AND O. GROSS, A Production Line Assignment Problem, Tech. report RM-1102, Rand Corporation, 1953.
13. K. A. GALLIVAN, B. A. MARSOLF, AND H. A. G. WIJSHOFF, Solving large nonsymmetric sparse linear systems using MCSPARSE, Parallel Comput., 22 (1996), pp. 1291-1333.
14. (5/2) algorithm for maximum matchings in bipartite graphs, SIAM J. Comput., 2 (1973), pp. 225-231.
15. HSL, Harwell Subroutine Library. A Catalogue of Subroutines (Release 12), AEA Technology, Harwell Laboratory, Oxfordshire, UK, 1996.
16. M. OLSCHOWKA AND A. NEUMAIER, A new pivoting strategy for Gaussian elimination, Linear Algebra Appl., 240 (1996), pp. 131-151.
17. A. POTHEN AND C. FAN, Computing the block triangular form of a sparse matrix, ACM Trans. Math. Software, 16 (1990), pp. 303-324.
18. Y. SAAD, Iterative Methods for Sparse Linear Systems, PWS Publishing, New York, 1996.
19. H. A. G. WIJSHOFF, Symmetric Orderings for Unsymmetric Sparse Matrices, Tech. report CSRD 901, Center for Supercomputing Research and Development, University of Illinois, Urbana, IL, 1989.