The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Cholesky factorization
Abstract
This article aimed at a general audience of computational scientists, surveys the Cholesky factorization for symmetric positive definite matrices, covering algorithms for computing it, the numerical stability of the algorithms, and updating and downdating of the factorization. Cholesky factorization with pivoting for semidefinite matrices is also treated. Copyright © 2009 John Wiley & Sons, Inc. This article is categorized under: Algorithms and Computational Methods > Numerical Methods
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The Cholesky factorization [Higham, 2009] is efficient for applications with smaller study areas and a large number of focal nodes.”
From Circuitscape in Julia: High Performance Connectivity Modelling to Support Conservation Decisions (2020) · cites this paper as Higham, 2009
Citations
Cites
Functions of Matrices: Theory and Computation
Higham, N. J. (2008) · doi:10.1137/1.9780898717778 · Cited by 2,113
Self-citation
Research works printed but not linked: 8
- 10.1007/s11075-006-9059-x · DOI
- 10.1137/1.9780898719604 · DOI
- 10.1145/77626.79170 · DOI
- 10.1137/1.9780898718027 · DOI · Paper page
- Hammarling S, 2007, Applied Parallel Computing. State of the Art in Scientific Computing. 8th International Workshop, PARA 2006, 137
- 10.1016/0024-3795(88)90223-6 · DOI
- Guo CH, 2008, An Improved Arc Algorithm for Detecting Definite Hermitian Pairs
- 10.1137/1.9781611971484 · DOI
Cited by
Sorted by citations
Circuitscape in Julia: High Performance Connectivity Modelling to Support Conservation Decisions
(2020) · JuliaCon Proceedings · doi:10.21105/jcon.00058 · Cited by 163
Metadata
- Authors
- Higham, N. J.
- Venue
- WIREs Computational Statistics
- Publisher
- Wiley
- Published
- 2009-06-30
- Volume
- 1
- Issue
- 2
- Pages
- 251-254
- ISSN
- 1939-5108
- 1939-0068
- Cited by
- 152
- References
- 1
- Language
- en
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: Cholesky factorization. https://app.cochat.ai/papers/10.1002/wics.18
- The paper
- Higham, N. J. (2009). Cholesky factorization. WIREs Computational Statistics. https://doi.org/10.1002/wics.18