The DOI matches its Crossref record.
A New Modified Cholesky Factorization
Abstract
The modified Cholesky factorization of Gill and Murray plays an important role in optimization algorithms. Given a symmetric but not necessarily positive-definite matrix A, it computes a Cholesky factorization of $A + E$, where $E = 0$ if A is safely positive-definite, and E is a diagonal matrix chosen to make $A + E$ positive-definite otherwise. The factorization costs only a small multiple of $n^2 $ operations more than the standard Cholesky factorization. A new algorithm that has these same properties, but for which the theoretical bound on $||E||_\infty $ is substantially smaller, is presented. It is based upon two new techniques, the use of Gerschgorin bounds in selecting the elements of E, and a new way of monitoring positive definiteness. In extensive computational tests on indefinite matrices, the new factorization virtually always produces smaller values of $||E||_\infty $ than the existing method, without impairing the conditioning of $A + E$. In some cases the improvements are substantial. The new factorization has already been useful in optimization algorithms.
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
Cited by
Minimum sample size estimation in PLS‐SEM: The inverse square root and gamma‐exponential methods
Kock, N., & Hadaya, P. (2018) · Information Systems Journal · doi:10.1111/isj.12131 · Cited by 2,621
Iterative Methods for Optimization
Kelley, C. T. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970920 · Cited by 2,052
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
Complete search in continuous global optimization and constraint satisfaction
Neumaier, A. (2004) · Acta Numerica · doi:10.1017/s0962492904000194 · Cited by 430
Solving the Trust-Region Subproblem using the Lanczos Method
Gould, N. I. M., Lucidi, S., Roma, M., & Toint, P. L. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623497322735 · Cited by 280
Metadata
- Authors
- Schnabel, R. B., & Eskow, E.
- Venue
- SIAM Journal on Scientific and Statistical Computing
- Published
- 1990-11
- Volume
- 11
- Issue
- 6
- Pages
- 1136-1158
- ISSN
- 0196-5204 (ISSN-L)
- 2168-3417
- OpenAlex
- W2053627399
- Cited by
- 163
- References
- 0
- FWCI
- 2.93
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A New Modified Cholesky Factorization. https://app.cochat.ai/papers/10.1137/0911064
- The paper
- Schnabel, R. B., & Eskow, E. (1990). A New Modified Cholesky Factorization. SIAM Journal on Scientific and Statistical Computing. https://doi.org/10.1137/0911064
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.