The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Methods for modifying matrix factorizations
Open accessAbstract
In recent years, several algorithms have appeared for modifying the factors of a matrix following a rank-one change. These methods have always been given in the context of specific applications and this has probably inhibited their use over a wider field. In this report, several methods are described for modifying Cholesky factors. Some of these have been published previously while others appear for the first time. In addition, a new algorithm is presented for modifying the complete orthogonal factorization of a general matrix, from which the conventional QR factors are obtained as a special case. A uniform notation has been used and emphasis has been placed on illustrating the similarity between different methods.
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
The algebraic eigenvalue problem
Wilkinson, J. H. (1965) · Cited by 5,833
The Algebraic Eigenvalue Problem
I., E., & Wilkinson, J. H. (1966) · Mathematics of Computation · doi:10.2307/2003558 · Cited by 5,140
Least Squares Computations by Givens Transformations Without Square Roots
GENTLEMAN, W. M. (1973) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/12.3.329 · Cited by 479
Quasi-Newton Methods for Unconstrained Optimization
GILL, P. E., & MURRAY, W. (1972) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/9.1.91 · Cited by 359
Self-citationExtensions and applications of the Householder algorithm for solving linear least squares problems
Hanson, R. J., & Lawson, C. L. (1969) · Mathematics of Computation · doi:10.1090/s0025-5718-1969-0258258-9 · Cited by 158
Numerical Techniques in Mathematical Programming
Bartels, R. H., Golub, G. H., & Saunders, M. A. (1970) · Elsevier eBooks · doi:10.1016/b978-0-12-597050-1.50009-9 · Cited by 66
Self-citation
Cited by
Bundle Adjustment — A Modern Synthesis
Triggs, B., McLauchlan, P. F., Hartley, R. I., & Fitzgibbon, A. W. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44480-7_21 · Cited by 3,988
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Gill, P. E., Murray, W., & Saunders, M. A. (2005) · SIAM Review · doi:10.1137/s0036144504446096 · Cited by 2,834
Self-citationSNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Gill, P. E., Murray, W., & Saunders, M. A. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623499350013 · Cited by 1,587
Self-citationQuasi-Newton Methods, Motivation and Theory
Dennis, Jr., & Moré, J. J. (1977) · SIAM Review · doi:10.1137/1019005 · Cited by 1,553
iSAM2: Incremental smoothing and mapping using the Bayes tree
Kaess, M., Johannsson, H., Roberts, R., Ila, V., Leonard, J. J., & Dellaert, F. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364911430419 · Cited by 1,362
Metadata
- Authors
- Gill, P. E., Golub, G. H., Murray, W., & Saunders, M. A.
- Venue
- Mathematics of Computation
- Publisher
- American Mathematical Society (AMS)
- Published
- 1974
- Volume
- 28
- Issue
- 126
- Pages
- 505-535
- ISSN
- 0025-5718 (ISSN-L)
- 1088-6842
- OpenAlex
- W2035814233
- Cited by
- 590
- References
- 6
- FWCI
- 19.01
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Methods for modifying matrix factorizations. https://app.cochat.ai/papers/10.1090/s0025-5718-1974-0343558-6
- The paper
- Gill, P. E., Golub, G. H., Murray, W., & Saunders, M. A. (1974). Methods for modifying matrix factorizations. Mathematics of Computation. https://doi.org/10.1090/s0025-5718-1974-0343558-6
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.