The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
Saad, Y., & Schultz, M. H. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907058 · Cited by 11,154
van der Vorst, H. A. (1992) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0913035 · Cited by 5,308
Fibonacci heaps and their uses in improved network optimization algorithms
Fredman, M. L., & Tarjan, R. E. (1987) · Journal of the ACM · doi:10.1145/28869.28874 · Cited by 3,132
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Hopcroft, J. E., & Karp, R. M. (1973) · SIAM Journal on Computing · doi:10.1137/0202019 · Cited by 2,802
Data Structures and Network Algorithms
Tarjan, R. E. (1983) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970265 · Cited by 2,057
A shortest augmenting path algorithm for dense and sparse linear assignment problems
Jonker, R., & Volgenant, A. (1987) · Computing · doi:10.1007/bf02278710 · Cited by 1,230
A Supernodal Approach to Sparse Partial Pivoting
Demmel, J. W., Eisenstat, S. C., Gilbert, J. R., Li, X. S., & Liu, J. W. H. (1999) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895291765 · Cited by 840
A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
Freund, R. W. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914029 · Cited by 623
Manber, U. (1989) · Cited by 566
Faster Shortest-Path Algorithms for Planar Graphs
Henzinger, M. R., Klein, P., Rao, S., & Subramanian, S. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1493 · Cited by 404
Liu, W.-H., & Sherman, A. H. (1976) · SIAM Journal on Numerical Analysis · doi:10.1137/0713020 · Cited by 294
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
Duff, I. S., & Koster, J. (1999) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479897317661 · Cited by 254
Self-citationScaling algorithms for network problems
Garbow, H. N. (1985) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(85)90039-x · Cited by 199
A new pivoting strategy for Gaussian elimination
Olschowka, M., & Neumaier, A. (1996) · Linear Algebra and its Applications · doi:10.1016/0024-3795(94)00192-8 · Cited by 126
Cited by
Numerical solution of saddle point problems
Benzi, M., Golub, G. H., & Liesen, J. (2005) · Acta Numerica · doi:10.1017/s0962492904000212 · Cited by 2,300
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
Amestoy, P. R., Duff, I. S., L'Excellent, J.-Y., & Koster, J. (2001) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479899358194 · Cited by 2,287
Self-citationDirect Methods for Sparse Matrices
Duff, I. S., Erisman, A. M., & Reid, J. K. (2017) · doi:10.1093/acprof:oso/9780198508380.001.0001 · Cited by 1,604
Self-citationPreconditioning Techniques for Large Linear Systems: A Survey
Benzi, M. (2002) · Journal of Computational Physics · doi:10.1006/jcph.2002.7176 · Cited by 1,221
A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
Davis, T. A. (2004) · ACM Transactions on Mathematical Software · doi:10.1145/992200.992205 · Cited by 419
Metadata
- Authors
- Duff, I. S., & Koster, J.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 2001-01
- Volume
- 22
- Issue
- 4
- Pages
- 973-996
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2069849438
- Cited by
- 358
- References
- 16
- FWCI
- 9.96
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.