The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Updating the Inverse of a Matrix
Abstract
The Sherman–Morrison–Woodbury formulas relate the inverse of a matrix after a small-rank perturbation to the inverse of the original matrix. The history of these fomulas is presented and various applications to statistics, networks, structural analysis, asymptotic analysis, optimization, and partial differential equations are discussed. The Sherman-Morrison-Woodbury formulas express the inverse of a matrix after a small rank perturbation in terms of the inverse of the original matrix. This paper surveys the history of these formulas and we examine some applications where these formulas are helpful
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
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
Hoffman, K. A. (1961) · Cited by 2,706
Applied Numerical Linear Algebra
Demmel, J. W. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971446 · Cited by 2,299
Quasi-Newton Methods, Motivation and Theory
Dennis, Jr., & Moré, J. J. (1977) · SIAM Review · doi:10.1137/1019005 · Cited by 1,553
Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
Sherman, J., & Morrison, W. J. (1950) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729893 · Cited by 1,402
Introduction to Sensitivity and Stability Analysis in Nonlinear Programming
(1983) · Mathematics in Science and Engineering/Mathematics in science and engineering · doi:10.1016/s0076-5392(08)x6041-2 · Cited by 1,074
Linear and nonlinear programming
Sydsæter, K., Strøm, A., & Berck, P. (1999) · Economists’ Mathematical Manual · doi:10.1007/978-3-662-03995-3_15 · Cited by 864
On Direct Methods for Solving Poisson’s Equations
Buzbee, B. L., Golub, G. H., & Nielson, C. W. (1970) · SIAM Journal on Numerical Analysis · doi:10.1137/0707049 · Cited by 734
Methods for modifying matrix factorizations
Gill, P. E., Golub, G. H., Murray, W., & Saunders, M. A. (1974) · Mathematics of Computation · doi:10.1090/s0025-5718-1974-0343558-6 · Cited by 590
SOME THEOREMS IN LEAST SQUARES
PLACKETT, R. L. (1950) · Biometrika · doi:10.1093/biomet/37.1-2.149 · Cited by 433
Cited by
Amanullah, R., Lidman, C., Rubin, D., Aldering, G., Astier, P., Barbary, K., Burns, M. S., Conley, A., Dawson, K. S., Deustua, S. E., et al. (2010) · The Astrophysical Journal · doi:10.1088/0004-637x/716/1/712 · Cited by 1,352
A Linear-Time Algorithm for Gaussian and Non-Gaussian Trait Evolution Models
Tung Ho, L. S., & Ané, C. (2014) · Systematic Biology · doi:10.1093/sysbio/syu005 · Cited by 1,085
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate
Chen, Y., Davis, T. A., Hager, W. W., & Rajamanickam, S. (2008) · ACM Transactions on Mathematical Software · doi:10.1145/1391989.1391995 · Cited by 751
Self-citationFast Direct Methods for Gaussian Processes
Ambikasaran, S., Foreman-Mackey, D., Greengard, L., Hogg, D. W., & O'Neil, M. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2448083 · Cited by 669
ArtDefo: accurate real time deformable objects
James, D. L., & Pai, D. K. (1999) · Proceedings of the 26th annual conference on Computer graphics and interactive techniques - SIGGRAPH '99 · doi:10.1145/311535.311542 · Cited by 498
Efficient leave-one-out cross-validation of kernel fisher discriminant classifiers
Cawley, G. C., & Talbot, N. L. C. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(03)00136-5 · Cited by 436
Sparse Bayesian infinite factor models
Bhattacharya, A., & Dunson, D. B. (2011) · Biometrika · doi:10.1093/biomet/asr013 · Cited by 413
Efficient Algorithms for Convolutional Sparse Representations
Wohlberg, B. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2495260 · Cited by 413
Fast exact leave-one-out cross-validation of sparse least-squares support vector machines
Cawley, G. C., & Talbot, N. L. C. (2004) · Neural Networks · doi:10.1016/j.neunet.2004.07.002 · Cited by 332
Short-Term Solar Power Forecasting Based on Weighted Gaussian Process Regression
Sheng, H., Xiao, J., Cheng, Y., Ni, Q., & Wang, S. (2018) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2017.2714127 · Cited by 324
Chen, S., Caballero, R. N., Guo, Y. J., Chalumeau, A., Liu, K., Shaifullah, G., Lee, K. J., Babak, S., Desvignes, G., Parthasarathy, A., et al. (2021) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stab2833 · Cited by 283
Digital Phased Arrays: Challenges and Opportunities
Fulton, C., Yeary, M., Thompson, D., Lake, J., & Mitchell, A. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2501804 · Cited by 246
Measuring and moderating opinion polarization in social networks
Matakos, A., Terzi, E., & Tsaparas, P. (2017) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-017-0527-9 · Cited by 164
Metadata
- Authors
- Hager, W. W.
- Venue
- SIAM Review
- Published
- 1989-06
- Volume
- 31
- Issue
- 2
- Pages
- 221-239
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2139182243
- Cited by
- 1,103
- References
- 19
- FWCI
- 5.46
- 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.