The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Choosing Regularization Parameters in Iterative Methods for Ill-Posed Problems
Abstract
Numerical solution of ill-posed problems is often accomplished by discretization (projection onto a finite dimensional subspace) followed by regularization. If the discrete problem has high dimension, though, typically we compute an approximate solution by projecting the discrete problem onto an even smaller dimensional space, via iterative methods based on Krylov subspaces. In this work we present a common framework for efficient algorithms that regularize after this second projection rather than before it. We show that determining regularization parameters based on the final projected problem rather than on the original discretization has firmer justification and often involves less computational expense. We prove some results on the approximate equivalence of this approach to other forms of regularization, and we present numerical examples.
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
Solving Least Squares Problems
Lawson, C. L., & Hanson, R. J. (1995) · doi:10.1137/1.9781611971217 · Cited by 7,103
Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
Hansen, P. C. (1992) · SIAM Review · doi:10.1137/1034115 · Cited by 3,903
Cited by
Practical Guide To Chemometrics
(2006) · CRC Press eBooks · doi:10.1201/9781420018301 · Cited by 641
Computational Statistics and Data Analysis
(2004) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2004.08.001 · Cited by 565
Tikhonov regularization and the L-curve for large discrete ill-posed problems
Calvetti, D., Morigi, S., Reichel, L., & Sgallari, F. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00414-3 · Cited by 535
Metadata
- Authors
- Kilmer, M. E., & O'Leary., D. P.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 2001-01
- Volume
- 22
- Issue
- 4
- Pages
- 1204-1221
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2013321956
- Cited by
- 315
- References
- 2
- FWCI
- 10.94
- 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: Choosing Regularization Parameters in Iterative Methods for Ill-Posed Problems. https://app.cochat.ai/papers/10.1137/s0895479899345960
- The paper
- Kilmer, M. E., & O'Leary., D. P. (2001). Choosing Regularization Parameters in Iterative Methods for Ill-Posed Problems. SIAM Journal on Matrix Analysis and Applications. https://doi.org/10.1137/s0895479899345960
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.