On algorithms for permuting large entries to the diagonal of a sparse matrix

SIAM Journal on Matrix Analysis and Applications

Volumn 22, Issue 4, 2001, Pages 973-996

  Duff, I S ^a,b   Koster, J ^a,c  

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

^b CERFACS   (France)

^c UNIVERSITY OF BERGEN   (Norway)

Author keywords

Bipartite weighted matching; Direct methods; Iterative methods; Preconditioning; Shortest path algorithms; Sparse matrices

Indexed keywords

EID: 0035537388     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479899358443     Document Type: Article

References (38)

1. R. K. AHUJA, T. L. MAGNANTI, AND J. B. ORLIN, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
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. S. DUFF, J. NOAILLES, AND D. RUIZ, A block projection method for sparse matrices, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 47-70.
4. M. BENZI, J. C. HAWS, AND M. TŮMA, Preconditioning highly indefinite and nonsymmetric matrices, SIAM J. Sci. Comput., 22 (2000), pp. 1333-1353.
5. M. BENZI, D. B. SZYLD, AND A. VAN DUIN, Orderings for incomplete factorization preconditioning of nonsymmetric problems, SIAM J. Sci. Comput., 20 (1999), pp. 1652-1670.
6. R. E. BURKARD AND U. DERIGS, Assignment and Matching Problems: Solution Methods with FORTRAN-Programs, Lecture Notes in Econom. and Math. Systems 184, Springer, Berlin, Heidelberg, New York, 1980.
7. G. CARPANETO AND P. TOTH, Solution of the assignment problem (Algorithm 548), ACM Trans. Math. Software, 1980, pp. 104-111.
8. P. CARRARESI AND C. SODINI, An efficient algorithm for the bipartite matching problem, European J. Oper Res., 23 (1986), 86-93.
9. E. CHOW AND Y. SAAD, Experimental Study of ILU Preconditioners for Indefinite Matrices, Technical Report TR 97/95, Department of Computer Science, University of Minnesota, and Minnesota Supercomputer Institute, Minneapolis, MN, 1997.
10. T. CORMAN, C. LEISERSON, AND R. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
11. T. A. DAVIS, University of Florida sparse matrix collection, http://www.cise.ufl.edu/~davis and ftp://ftp.cise.ufl.edu/pub/faculty/davis (1997).
12. 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.
13. U. DERIGS AND A. METZ, An efficient labeling technique for solving sparse assignment problems, Computing, 36 (1986), pp. 301-311.
14. E. W. DIJKSTRA, A note on two problems in connection with graphs, Numer. Math., 1 (1959), pp. 269-271.
15. I. S. DUFF, Algorithm 575. Permutations for a zero-free diagonal, ACM Trans. Math. Software, 7 (1981), pp. 387-390.
16. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, Users' Guide for the Harwell-Boeing Sparse Matrix Collection (Release 1), Technical Report RAL-92-086, Rutherford Appleton Laboratory, Oxfordshire, England, 1992.
17. 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.
18. 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.
19. 1/2τ) assignment algorithms, ACM Trans. Math. Software, 14 (1988), pp. 267-287.
20. G. FINKE AND P. SMITH, Primal equivalents for the threshold algorithm, in Proceedings of the Third Symposium on Operations Research, University of Mannheim, Mannheim, Germany, 1978, Operations Res. Verfahren 31, 1979, pp. 185-198.
21. L. R. FORD, JR. AND D. R. FULKERSON, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
22. M. L. FREDMAN AND R. E. TARJAN, Fibonacci heaps and their uses in improved network optimization algorithms, J. Assoc. Comput. Mach., 34 (1987), pp. 596-615.
23. R. FREUND, A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems, SIAM J. Sci. Statist. Comput., 14 (1993), pp. 470-482.
24. H. N. GABOW, Scaling algorithms for network problems, J. Comput. System Sci., 31 (1985), pp. 148-168.
25. G. GALLO AND S. PALLOTTINO, Shortest path algorithms, Ann. Oper. Res., 13 (1988), pp. 3-79.
26. A. GEORGE, Computer Implementation of the Finite-Element Method, Ph.D. thesis, Report STAN CS-71-208, Department of Computer Science, Stanford University, Stanford, CA, 1971.
27. 5/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comput., 2 (1973), pp. 225-231.
28. HSL, A collection of Fortran codes for large scale scientific computation, http://www. numerical.rl.ac.uk/hsl (2000).
29. R. JONKER AND A. VOLGENANT, A shortest augmenting path algorithm for dense and sparse linear assignment problems, Computing, 38 (1987), pp. 325-340.
30. H. W. KUHN, The Hungarian method for the assignment problem, Naval Res. Logist. Quart., 2 (1955), pp. 83-97.
31. X. S. LI AND J. W. DEMMEL, A scalable sparse direct solver using static pivoting, in Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, San Antonio, Texas, 1999, CD-ROM, SIAM, Philadelphia, PA, 1999.
32. W. H. LIU AND A. H. SHERMAN, Comparative analysis of the Cuthill-McKee and the reverse Cuthill-McKee ordering algorithms for sparse matrices, SIAM J. Numer. Anal., 13 (1976), pp. 198-213.
33. M. OLSCHOWKA AND A. NEUMAIER, A new pivoting strategy for Gaussian elimination, Linear Algebra Appl., 240 (1996), pp. 131-151.
34. D. RUIZ, Solution of Large Sparse Unsymmetric Linear Systems with a Block Iterative Method in a Multiprocessor Environment, Ph.D. thesis, CERFACS, Toulouse, France, 1992.
35. Y. SAAD, Iterative Methods for Sparse Linear Systems, PWS Publishing Company, Boston, MA, 1996.
36. Y. SAAD AND M. H. SCHULTZ, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856-869.
37. R. E. TARJAN, Data Structures and Network Algorithms, CBMS-NSF Regional Conf. Ser. in Appl. Math. 44, SIAM, Philadelphia, PA, 1983.
38. H. A. VAN DER VORST, Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 631-644.