The DOI matches its Crossref record.
Computational Methods of Linear Algebra
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
Cited by
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
Linear prediction: A tutorial review
Makhoul, J. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9792 · Cited by 4,023
Bregman, L. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90040-7 · Cited by 2,618
Davidson, E. R. (1975) · Journal of Computational Physics · doi:10.1016/0021-9991(75)90065-0 · Cited by 2,517
Factorization Methods for Discrete Sequential Estimation
(1977) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6052-7 · Cited by 1,847
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
Nineteen Dubious Ways to Compute the Exponential of a Matrix
Moler, C., & Van Loan, C. (1978) · SIAM Review · doi:10.1137/1020098 · Cited by 1,526
Comparison of Stopping Rules in Forward “Stepwise” Regression
Bendel, R. B., & Afifi, A. A. (1977) · Journal of the American Statistical Association · doi:10.1080/01621459.1977.10479905 · Cited by 885
Use of Kriging Models to Approximate Deterministic Computer Models
Martin, J. D., & Simpson, T. W. (2005) · AIAA Journal · doi:10.2514/1.8650 · Cited by 835
The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
Rosen, J. B. (1961) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0109044 · Cited by 520
Atchison, W. F., Conte, S. D., Hamblen, J. W., Hull, T. E., Keenan, T. A., Kehl, W. B., McCluskey, E. J., Navarro, S. O., Rheinboldt, W. C., Schweppe, E. J., et al. (1968) · Communications of the ACM · doi:10.1145/362929.362976 · Cited by 468
[16] Nonlinear least-squares analysis
Johnson, M. L., & Frasier, S. G. (1985) · Methods in Enzymology · doi:10.1016/s0076-6879(85)17018-7 · Cited by 451
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
Caswell, H. (1978) · Theoretical Population Biology · doi:10.1016/0040-5809(78)90025-4 · Cited by 440
Concus, P., Golub, G. H., & O'Leary, D. P. (1976) · Sparse Matrix Computations · doi:10.1016/b978-0-12-141050-6.50023-4 · Cited by 433
Fast Parallel Matrix Inversion Algorithms
Csanky, L. (1976) · SIAM Journal on Computing · doi:10.1137/0205040 · Cited by 397
A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
Benzi, M., Meyer, C. D., & Tůma, M. (1996) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827594271421 · Cited by 389
[2] Global analysis of biochemical and biophysical data
Beechem, J. M. (1992) · Methods in Enzymology · doi:10.1016/0076-6879(92)10004-w · Cited by 378
[1] Parameter estimation by least-squares methods
Johnson, M. L., & Faunt, L. M. (1992) · Methods in Enzymology · doi:10.1016/0076-6879(92)10003-v · Cited by 344
The Method of Configuration Interaction
Shavitt, I. (1977) · Methods of Electronic Structure Theory · doi:10.1007/978-1-4757-0887-5_6 · Cited by 336
Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
Golub, G. H., & Wilkinson, J. H. (1976) · SIAM Review · doi:10.1137/1018113 · Cited by 278
Adaptive Predictive Coding of Speech Signals
Atal, B. S., & Schroeder, M. R. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb04297.x · Cited by 256
The Structure and Analysis of Complex Reaction Systems
Wei, J., & Prater, C. D. (1962) · Advances in Catalysis · doi:10.1016/s0360-0564(08)60289-8 · Cited by 254
Spanning Forests of a Digraph and Their Applications
Agaev, R. P., & Chebotarev, P. Y. (2001) · Automation and Remote Control · doi:10.1023/a:1002862312617 · Cited by 57
Metadata
- Authors
- H., A. S., Faddeev, D. K., & Faddeeva, V. N.
- Venue
- Mathematics of Computation
- Publisher
- JSTOR
- Published
- 1964-07
- Volume
- 18
- Issue
- 87
- Pages
- 512
- ISSN
- 0025-5718 (ISSN-L)
- OpenAlex
- W2330913512
- Cited by
- 1,599
- References
- 0
- FWCI
- 58.88
- 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.