On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
Top Cited Papers
- 1 January 2001
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 22 (4) , 973-996
- https://doi.org/10.1137/s0895479899358443
Abstract
We consider bipartite matching algorithms for computing permutations of a sparse matrix so that the diagonal of the permuted matrix has entries of large absolute value. We discuss various strategies for this and consider their implementation as computer codes. We also consider scaling techniques to further increase the relative values of the diagonal entries. Numerical experiments show the effect of the reorderings and the scaling on the solution of sparse equations by a direct method and by preconditioned iterative techniques.Keywords
This publication has 26 references indexed in Scilit:
- Preconditioning Highly Indefinite and Nonsymmetric MatricesSIAM Journal on Scientific Computing, 2000
- Orderings for Incomplete Factorization Preconditioning of Nonsymmetric ProblemsSIAM Journal on Scientific Computing, 1999
- A Supernodal Approach to Sparse Partial PivotingSIAM Journal on Matrix Analysis and Applications, 1999
- Experimental study of ILU preconditioners for indefinite matricesJournal of Computational and Applied Mathematics, 1997
- A Block Projection Method for Sparse MatricesSIAM Journal on Scientific and Statistical Computing, 1992
- Vectorization of a Multiprocessor Multifrontal CodeThe International Journal of Supercomputing Applications, 1989
- An efficient labeling technique for solving sparse assignment problemsComputing, 1986
- An efficient algorithm for the bipartite matching problemEuropean Journal of Operational Research, 1986
- Assignment and Matching Problems: Solution Methods with FORTRAN-ProgramsPublished by Springer Nature ,1980
- A note on two problems in connexion with graphsNumerische Mathematik, 1959