The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Tikhonov Regularization and Total Least Squares
Abstract
Discretizations of inverse problems lead to systems of linear equations with a highly ill-conditioned coefficient matrix, and in order to computestable solutions to these systems it is necessary to apply regularization methods. We show how Tikhonov's regularization method, which in its original formulation involves a least squares problem, can be recast in a total least squares formulation suited for problems in which both the coefficient matrix and the right-hand side are known only approximately. We analyze the regularizing properties of this method and demonstrate by a numerical example that, in certain cases with large perturbations, the new method is superior to standard regularization methods.
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
Solutions of Ill-Posed Problems.
Bell, J. B., Tikhonov, A. N., & Arsenin, V. Y. (1978) · Mathematics of Computation · doi:10.2307/2006360 · Cited by 8,101
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
Self-citationRegularization of Inverse Problems
Engl, H. W., Hanke, M., & Neubauer, A. (1996) · Springer eBooks · doi:10.1007/978-94-009-1740-8 · Cited by 5,275
Numerical Methods for Least Squares Problems
Björck, Å. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971484 · Cited by 3,257
The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
Hansen, P. C., & O’Leary, D. P. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914086 · Cited by 3,137
Self-citationNumerical methods for least squares problems
(1996) · Choice Reviews Online · doi:10.5860/choice.34-1602 · Cited by 3,007
Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion
Hansen, P. C. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719697 · Cited by 2,909
Self-citationRank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion
Hansen, P. C. (1987) · Medical Entomology and Zoology · Cited by 2,122
Self-citationAn Analysis of the Total Least Squares Problem
Golub, G. H., & van Loan, C. F. (1980) · SIAM Journal on Numerical Analysis · doi:10.1137/0717073 · Cited by 1,753
Self-citationREGULARIZATION TOOLS: A Matlab package for analysis and solution of discrete ill-posed problems
Hansen, P. C. (1994) · Numerical Algorithms · doi:10.1007/bf02149761 · Cited by 1,710
Self-citation
Research works printed but not linked: 3
- Engl Heinz, 1993, Surveys Math. Indust., 3, 71
- Hanke Martin, 1993, Surveys Math. Indust., 3, 253
- 10.1007/BF01389755 · doi:10.1007/bf01389755
Cited by
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Label Consistent K-SVD: Learning a Discriminative Dictionary for Recognition
Jiang, Z., Lin, Z., & Davis, L. S. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.88 · Cited by 1,222
Schneider, T. (2001) · Journal of Climate · doi:10.1175/1520-0442(2001)014<0853:aoicde>2.0.co;2 · Cited by 759
Solving inverse problems using data-driven models
Arridge, S., Maass, P., Öktem, O., & Schönlieb, C.-B. (2019) · Acta Numerica · doi:10.1017/s0962492919000059 · Cited by 686
A systematic review on overfitting control in shallow and deep neural networks
Bejani, M. M., & Ghatee, M. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-021-09975-1 · Cited by 573
Metadata
- Authors
- Golub, G. H., Hansen, P. C., & O'Leary, D. P.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 1999-01
- Volume
- 21
- Issue
- 1
- Pages
- 185-194
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2005490094
- Cited by
- 1,029
- References
- 17
- FWCI
- 4.97
- 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: Tikhonov Regularization and Total Least Squares. https://app.cochat.ai/papers/10.1137/s0895479897326432
- The paper
- Golub, G. H., Hansen, P. C., & O'Leary, D. P. (1999). Tikhonov Regularization and Total Least Squares. SIAM Journal on Matrix Analysis and Applications. https://doi.org/10.1137/s0895479897326432
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.