The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Parallel Preconditioning with Sparse Approximate Inverses
Open accessAbstract
A parallel preconditioner is presented for the solution of general sparse linear systems of equations. A sparse approximate inverse is computed explicitly and then applied as a preconditioner to an iterative method. The computation of the preconditioner is inherently parallel, and its application only requires a matrix-vector product. The sparsity pattern of the approximate inverse is not imposed a priori but captured automatically. This keeps the amount of work and the number of nonzero entries in the preconditioner to a minimum. Rigorous bounds on the clustering of the eigenvalues and the singular values are derived for the preconditioned system, and the proximity of the approximateto the true inverse is estimated. An extensive set of test problems from scientific and industrial applications provides convincing evidence of the effectiveness of this approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
van der Vorst, H. A. (1992) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0913035 · Cited by 5,308
Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods
Barrett, R., Berry, M., Chan, T. F., Demmel, J., Donato, J., Dongarra, J., Eijkhout, V., Pozo, R., Romine, C., & van der Vorst, H. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971538 · Cited by 3,479
Axelsson, O. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9780511624100 · Cited by 2,085
A Flexible Inner-Outer Preconditioned GMRES Algorithm
Saad, Y. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914028 · Cited by 1,445
Numerical methods for solving linear least squares problems
Golub, G. (1965) · Numerische Mathematik · doi:10.1007/bf01436075 · Cited by 849
Iterative solution of linear systems
Freund, R. W., Golub, G. H., & Nachtigal, N. M. (1992) · Acta Numerica · doi:10.1017/s0962492900002245 · Cited by 434
Decay rates for inverses of band matrices
Demko, S., Moss, W. F., & Smith, P. W. (1984) · Mathematics of Computation · doi:10.1090/s0025-5718-1984-0758197-9 · Cited by 384
Cited by
Just relax: convex programming methods for identifying sparse signals in noise
Tropp, J. A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864420 · Cited by 1,407
Preconditioning Techniques for Large Linear Systems: A Survey
Benzi, M. (2002) · Journal of Computational Physics · doi:10.1006/jcph.2002.7176 · Cited by 1,221
\mathcal{O}(N) methods in electronic structure calculations
Bowler, D. R., & Miyazaki, T. (2012) · Reports on Progress in Physics · doi:10.1088/0034-4885/75/3/036503 · Cited by 521
Preconditioned Quantum Linear System Algorithm
Clader, B. D., Jacobs, B. C., & Sprouse, C. R. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.250504 · Cited by 288
Metadata
- Authors
- Grote, M. J., & Huckle, T.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 1997-05
- Volume
- 18
- Issue
- 3
- Pages
- 838-853
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2038516134
- Cited by
- 600
- References
- 7
- FWCI
- 29.37
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Parallel Preconditioning with Sparse Approximate Inverses. https://app.cochat.ai/papers/10.1137/s1064827594276552
- The paper
- Grote, M. J., & Huckle, T. (1997). Parallel Preconditioning with Sparse Approximate Inverses. SIAM Journal on Scientific Computing. https://doi.org/10.1137/s1064827594276552
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.