Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 315

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

Kilmer, Misha E., O'Leary., Dianne P.·2001·SIAM Journal on Matrix Analysis and Applications

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/s0895479899345960

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 2 references

Cited by

See all 315

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.