The DOI matches its Crossref record; 117 of the 117 references it cites were found in a registry or an index.
Recent computational developments in Krylov subspace methods for linear systems
Abstract
Many advances in the development of Krylov subspace methods for the iterative solution of linear systems during the last decade and a half are reviewed. These new developments include different versions of restarted, augmented, deflated, flexible, nested, and inexact methods. Also reviewed are methods specifically tailored to systems with special properties such as special forms of symmetry and those depending on one or more parameters. Copyright © 2006 John Wiley & Sons, Ltd.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Iterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790
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
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Methods of conjugate gradients for solving linear systems
Hestenes, M. R., & Stiefel, E. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.044 · Cited by 8,132
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
van der Vorst, H. A. (1992) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0913035 · Cited by 5,308
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
Lanczos, C. (1950) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.045.026 · Cited by 4,391
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
Paige, C. C., & Saunders, M. A. (1982) · ACM Transactions on Mathematical Software · doi:10.1145/355984.355989 · Cited by 4,387
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
Numerical Methods for Least Squares Problems
Björck, Å. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971484 · Cited by 3,257
Numerical methods for least squares problems
(1996) · Choice Reviews Online · doi:10.5860/choice.34-1602 · Cited by 3,007
A class of methods for solving nonlinear simultaneous equations
Broyden, C. G. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0198670-6 · Cited by 2,788
Numerical solution of saddle point problems
Benzi, M., Golub, G. H., & Liesen, J. (2005) · Acta Numerica · doi:10.1017/s0962492904000212 · Cited by 2,300
Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion
Hansen, P. C. (1987) · Medical Entomology and Zoology · Cited by 2,122
Axelsson, O. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9780511624100 · Cited by 2,085
Iterative methods for linear and nonlinear equations
(1996) · Choice Reviews Online · doi:10.5860/choice.33-4556 · Cited by 1,947
Jacobian-free Newton–Krylov methods: a survey of approaches and applications
Knoll, D. A., & Keyes, D. E. (2004) · Journal of Computational Physics · doi:10.1016/j.jcp.2003.08.010 · Cited by 1,930
Domain decomposition: Parallel multilevel methods for elliptic partial differential equations
(1997) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(97)90035-3 · Cited by 1,836
The principle of minimized iterations in the solution of the matrix eigenvalue problem
Arnoldi, W. E. (1951) · Quarterly of Applied Mathematics · doi:10.1090/qam/42792 · Cited by 1,818
Iterative Methods for Linear and Nonlinear Equations
Kelley, C. T. (1995) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970944 · Cited by 1,635
Solution of Sparse Indefinite Systems of Linear Equations
Paige, C. C., & Saunders, M. A. (1975) · SIAM Journal on Numerical Analysis · doi:10.1137/0712047 · Cited by 1,620
Interpolation and Approximation
(2003) · A Numerical Library in Java for Scientists and Engineers · doi:10.1201/9780203507643.ch7 · Cited by 1,608
Direct 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
Spectra and Pseudospectra: The Behavior of Nonnormal Matrices and Operators
Trefethen, L. N., & Embree, M. (2005) · doi:10.1515/9780691213101 · Cited by 1,586
A Flexible Inner-Outer Preconditioned GMRES Algorithm
Saad, Y. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914028 · Cited by 1,445
The Quadratic Eigenvalue Problem
Tisseur, F., & Meerbergen, K. (2001) · SIAM Review · doi:10.1137/s0036144500381988 · Cited by 1,402
Lanczos Algorithms for Large Symmetric Eigenvalue Computations: Vol. I: Theory
Cullum, J. K., & Willoughby, R. A. (2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719192 · Cited by 1,291
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
Montvay, I., & Münster, G. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9780511470783 · Cited by 1,197
CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
Sonneveld, P. (1989) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0910004 · Cited by 1,169
The Total Least Squares Problem: Computational Aspects and Analysis.
Fisher, G. W., Huffel, S. V., & Vandewalle, J. (1992) · Mathematics of Computation · doi:10.2307/2153088 · Cited by 1,164
Implicit Application of Polynomial Filters in a k -Step Arnoldi Method
Sorensen, D. C. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613025 · Cited by 1,111
Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide
Demmel, J. W., Dongarra, J. J., Ruhe, A., van der Vorst, H. A., & Bai, Z. (1987) · Medical Entomology and Zoology · Cited by 1,102
Iterative Methods for Solving Linear Systems
(2006) · Texts in Applied Mathematics · doi:10.1007/0-387-22750-4_4 · Cited by 1,014
QMR: a quasi-minimal residual method for non-Hermitian linear systems
Freund, R. W., & Nachtigal, N. M. (1991) · Numerische Mathematik · doi:10.1007/bf01385726 · Cited by 979
Iterative Methods for Solving Linear Systems
Greenbaum, A. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970937 · Cited by 958
Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
Eisenstat, S. C., Elman, H. C., & Schultz, M. H. (1983) · SIAM Journal on Numerical Analysis · doi:10.1137/0720023 · Cited by 929
Solution of systems of linear equations by minimized iterations
Lanczos, C. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.006 · Cited by 929
Lecture notes in computational science and engineering
Viola, I. M., Ponzini, R., Rocchi, D., & Fossati, F. (2010) · Cited by 901
Conjugate gradient methods for indefinite systems
Fletcher, R. (1976) · Lecture notes in mathematics · doi:10.1007/bfb0080116 · Cited by 802
On Krylov Subspace Approximations to the Matrix Exponential Operator
Hochbruck, M., & Lubich, C. (1997) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142995280572 · Cited by 795
Iterative Krylov Methods for Large Linear Systems
van der Vorst, H. A. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511615115 · Cited by 729
A survey of model reduction methods for large-scale systems
Antoulas, A. C., Sorensen, D. C., & Gugercin, S. (2001) · Contemporary Mathematics · doi:10.1090/conm/280/04630 · Cited by 680
Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide
(2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719581 · Cited by 670
Krylov subspace methods for solving large unsymmetric linear systems
Saad, Y. (1981) · Mathematics of Computation · doi:10.1090/s0025-5718-1981-0616364-6 · Cited by 449
A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
Grimes, R. G., Lewis, J. G., & Simon, H. D. (1994) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479888151111 · Cited by 436
Iterative solution of linear systems
Freund, R. W., Golub, G. H., & Nachtigal, N. M. (1992) · Acta Numerica · doi:10.1017/s0962492900002245 · Cited by 434
Trefethen, L. N., & Embree, M. (2020) · Princeton University Press eBooks · doi:10.2307/j.ctvzxx9kj · Cited by 416
Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
Freund, R. W. (1992) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0913023 · Cited by 371
The rate of convergence of Conjugate Gradients
van der Sluis, A., & van der Vorst, H. A. (1986) · Numerische Mathematik · doi:10.1007/bf01389450 · Cited by 351
Matrix Preconditioning Techniques and Applications
Chen, K. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511543258 · Cited by 346
An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
Freund, R. W., Gutknecht, M. H., & Nachtigal, N. M. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914009 · Cited by 304
On the rate of convergence of the preconditioned conjugate gradient method
Axelsson, O., & Lindskog, G. (1986) · Numerische Mathematik · doi:10.1007/bf01389448 · Cited by 304
GMRES with Deflated Restarting
Morgan, R. B. (2002) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827599364659 · Cited by 289
Biros, G., & Ghattas, O. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/s106482750241565x · Cited by 269
Approximate solutions and eigenvalue bounds from Krylov subspaces
Paige, C. C., Parlett, B. N., & van der Vorst, H. A. (1995) · Numerical Linear Algebra with Applications · doi:10.1002/nla.1680020205 · Cited by 260
Convergence of Iterations for Linear Equations
Nevanlinna, O. (1993) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-8547-8 · Cited by 257
Computer Solution of Large Linear Systems
(1999) · Studies in Mathematics and Its Applications · doi:10.1016/s0168-2024(99)x8001-5 · Cited by 240
A look-ahead Lánczos algorithm for unsymmetric matrices
Parlett, B. Ν., Taylor, D. R., & Liu, Z. A. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0771034-2 · Cited by 233
Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
Simoncini, V., & Szyld, D. B. (2003) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827502406415 · Cited by 231
Self-citationA Technique for Accelerating the Convergence of Restarted GMRES
Baker, A. H., Jessup, E. R., & Manteuffel, T. (2005) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479803422014 · Cited by 230
Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
Golub, G. H., & O’Leary, D. P. (1989) · SIAM Review · doi:10.1137/1031003 · Cited by 229
Preconditioned conjugate gradients for solving singular systems
Kaasschieter, E. F. (1988) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(88)90358-5 · Cited by 229
Notay, Y. (2000) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827599362314 · Cited by 229
Deflated and Augmented Krylov Subspace Techniques
Chapman, A., & Saad, Y. (1997) · Numerical Linear Algebra with Applications · doi:10.1002/(sici)1099-1506(199701/02)4:1<43::aid-nla99>3.0.co;2-z · Cited by 205
Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
Golub, G. H., & Ye, Q. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827597323415 · Cited by 202
Computing interior eigenvalues of large matrices
Morgan, R. B. (1991) · Linear Algebra and its Applications · doi:10.1016/0024-3795(91)90381-6 · Cited by 188
The Lanczos and conjugate gradient algorithms in finite precision arithmetic
Meurant, G., & Strakoš, Z. (2006) · Acta Numerica · doi:10.1017/s096249290626001x · Cited by 158
Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
Morgan, R. B. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479897321362 · Cited by 156
A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
Gutknecht, M. H. (1994) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479890188803 · Cited by 146
Convergence properties of block GMRES and matrix polynomials
Simoncini, V., & Gallopoulos, E. (1996) · Linear Algebra and its Applications · doi:10.1016/0024-3795(95)00093-3 · Cited by 140
Self-citationA Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
Eiermann, M., & Ernst, O. G. (2006) · SIAM Journal on Numerical Analysis · doi:10.1137/050633846 · Cited by 139
A survey of preconditioned iterative methods
Bruaset, A. M. (2018) · Routledge eBooks · doi:10.1201/9781315136516 · Cited by 131
Inexact Krylov Subspace Methods for Linear Systems
van den Eshof, J., & Sleijpen, G. L. G. (2004) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479802403459 · Cited by 130
A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
Gutknecht, M. H. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613037 · Cited by 129
Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
Paige, C. C., Rozložńık, M., & Strakoš, Z. (2006) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/050630416 · Cited by 122
A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
Parlett, B. Ν., Taylor, D. R., & Liu, Z. A. (1985) · Mathematics of Computation · doi:10.2307/2007796 · Cited by 111
A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
Chan, T. F.-C., Gallopoulos, E., Simoncini, V., Szeto, T., & Tong, C. H. (1994) · SIAM Journal on Scientific Computing · doi:10.1137/0915023 · Cited by 110
Self-citationApproximation theory and numerical linear algebra
Trefethen, L. N. (1990) · Springer eBooks · doi:10.1007/978-1-4899-3442-0_30 · Cited by 109
From Potential Theory to Matrix Iterations in Six Steps
Driscoll, T. A., Toh, K.-C., & Trefethen, L. N. (1998) · SIAM Review · doi:10.1137/s0036144596305582 · Cited by 108
Lanczos-type solvers for nonsymmetric linear systems of equations
Gutknecht, M. H. (1997) · Acta Numerica · doi:10.1017/s0962492900002737 · Cited by 107
On the Application of the Generalized BiConjugate Gradient Method
Sarkar, T. K. (1987) · Journal of Electromagnetic Waves and Applications · doi:10.1163/156939387x00036 · Cited by 96
Convergence analysis of Krylov subspace methods
Liesen, J., & Tichý, P. (2004) · GAMM-Mitteilungen · doi:10.1002/gamm.201490008 · Cited by 86
Drkošová, J., Greenbaum, A., Rozložńık, M., et al. (1995) · BIT Numerical Mathematics · doi:10.1007/bf01732607 · Cited by 84
Inexact Inverse Iteration for Generalized Eigenvalue Problems
Golub, G. H., & Ye, Q. (2000) · BIT Numerical Mathematics · doi:10.1023/a:1022388317839 · Cited by 81
Analysis of Projection Methods for Rational Function Approximation to the Matrix Exponential
Lopez, L., & Simoncini, V. (2006) · SIAM Journal on Numerical Analysis · doi:10.1137/05062590 · Cited by 81
Self-citationStrakoš, Z., & Tichý, P. (2002) · Cited by 80
Convergence Analysis of Krylov Subspace Iterations with Methods from Potential Theory
Kuijlaars, A. B. J. (2006) · SIAM Review · doi:10.1137/s0036144504445376 · Cited by 79
A stopping criterion for the conjugate gradient algorithm in a finite element method framework
Arioli, M. (2004) · Numerische Mathematik · doi:10.1007/s00211-003-0500-y · Cited by 78
Proceedings of the Cornelius Lanczos International Centenary Conference
Plemmons, R. J. (1994) · Cited by 78
On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
Simoncini, V., & Szyld, D. B. (2005) · SIAM Review · doi:10.1137/s0036144503424439 · Cited by 71
Self-citationStopping criteria for iterations in finite element methods
Arioli, M., Loghin, D., & Wathen, A. (2004) · Numerische Mathematik · doi:10.1007/s00211-004-0568-z · Cited by 64
On the numerical solution ofAX −XB =C
Simoncini, V. (1996) · BIT Numerical Mathematics · doi:10.1007/bf01733793 · Cited by 57
Self-citationKrylov Subspace Iterations for Deterministick-Eigenvalue Calculations
Warsa, J. S., Wareing, T. A., Morel, J. E., et al. (2004) · Nuclear Science and Engineering · doi:10.13182/nse04-1 · Cited by 57
The Solution of Parametrized Symmetric Linear Systems
Meerbergen, K. (2003) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479800380386 · Cited by 56
A generalized nonsymmetric Lanczos procedure
Cullum, J. K., Kerner, W., & Willoughby, R. A. (1989) · Computer Physics Communications · doi:10.1016/0010-4655(89)90146-x · Cited by 49
Ritz and harmonic Ritz values and the convergence of FOM and GMRES
Goossens, S., & Roose, D. (1999) · Numerical Linear Algebra with Applications · doi:10.1002/(sici)1099-1506(199906)6:4 · Cited by 46
Golub, G. H., Zhang, Z., & Zha, H. (2000) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(99)00204-9 · Cited by 45
Sleijpen, G. L. G., van der Vorst, H. A., & Modersitzki, J. (2001) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479897323087 · Cited by 44
Zavorin, I., O’Leary, D. P., & Elman, H. C. (2003) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(02)00612-2 · Cited by 44
Least Squares Residuals and Minimal Residual Methods
Liesen, J., Rozložńık, M., & Strakoš, Z. (2002) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827500377988 · Cited by 43
Expressions and Bounds for the GMRES Residual
Ipsen, I. C. F. (2000) · BIT Numerical Mathematics · doi:10.1023/a:1022371814205 · Cited by 41
Maryška, J., Rozložńık, M., & Tůma, M. (2000) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827598339608 · Cited by 38
Relaxation strategies for nested Krylov methods
van den Eshof, J., Sleijpen, G. L. G., & van Gijzen, M. B. (2004) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2004.09.024 · Cited by 37
Variable Accuracy of Matrix-Vector Products in Projection Methods for Eigencomputation
Simoncini, V. (2005) · SIAM Journal on Numerical Analysis · doi:10.1137/040605333 · Cited by 36
Self-citationLook-ahead in Bi-CGSTAB and other product methods for linear systems
Brezinski, C., & Redivo‐Zaglia, M. (1995) · BIT Numerical Mathematics · doi:10.1007/bf01737161 · Cited by 35
Residual and Backward Error Bounds in Minimum Residual Krylov Subspace Methods
Paige, C. C., & Strakoš, Z. (2002) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827500381239 · Cited by 34
Error Analysis of Krylov Methods In a Nutshell
Hochbruck, M., & Lubich, C. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595290450 · Cited by 31
Convergence in Backward Error of Relaxed GMRES
Giraud, L., Gratton, S., & Langou, J. (2007) · SIAM Journal on Scientific Computing · doi:10.1137/040608416 · Cited by 29
The Worst-Case GMRES for Normal Matrices
Liesen, J., & Tichý, P. (2004) · BIT Numerical Mathematics · doi:10.1023/b:bitn.0000025083.59864.bd · Cited by 25
Breakdowns in the implementation of the Lánczos method for solving linear systems
Brezinski, C., Redivo‐Zaglia, M., & Sadok, H. (1997) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)00217-9 · Cited by 17
Complementary cycles of restarted GMRES
Zhong, B., & Morgan, R. B. (2008) · Numerical Linear Algebra with Applications · doi:10.1002/nla.589 · Cited by 16
Analysis of a Minimum Perturbation Algorithm for Nonsymmetric Linear Systems
Kasenally, E. M., & Simoncini, V. (1997) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142994266844 · Cited by 12
Self-citation
Cited by
Computational Methods for Linear Matrix Equations
Simoncini, V. (2016) · SIAM Review · doi:10.1137/130912839 · Cited by 487
Self-citation
Metadata
- Authors
- Simoncini, V., & Szyld, D. B.
- Venue
- Numerical Linear Algebra with Applications
- Publisher
- Wiley
- Published
- 2006-10-09
- Volume
- 14
- Issue
- 1
- Pages
- 1-59
- ISSN
- 1070-5325 (ISSN-L)
- 1099-1506
- OpenAlex
- W2074780612
- Cited by
- 375
- References
- 117
- FWCI
- 16.74
- 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.