The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Solving Ill-Conditioned and Singular Linear Systems: A Tutorial on Regularization
Abstract
It is shown that the basic regularization procedures for finding meaningful approximate solutions of ill-conditioned or singular linear systems can be phrased and analyzed in terms of classical linear algebra that can be taught in any numerical analysis course. Apart from rewriting many known results in a more elementary form, we also derive a new two-parameter family of merit functions for the determination of the regularization parameter. The traditional merit functions from generalized cross validation (GCV) and generalized maximum likelihood (GML) are recovered as special cases.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Regularization 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
Spline Models for Observational Data.
Muller, H.-G., & Wahba, G. (1991) · Journal of the American Statistical Association · doi:10.2307/2290434 · Cited by 4,928
Spline Models for Observational Data
Wahba, G. (1990) · doi:10.1137/1.9781611970128 · Cited by 4,184
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
Craven, P., & Wahba, G. (1978) · Numerische Mathematik · doi:10.1007/bf01404567 · Cited by 3,388
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
Numerical 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
Solution of incorrectly formulated problems and the regularization method
Tikhonov, A. N. (1963) · Medical Entomology and Zoology · Cited by 2,359
Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion
Hansen, P. C. (1987) · Medical Entomology and Zoology · Cited by 2,122
A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
Phillips, D. L. (1962) · Journal of the ACM · doi:10.1145/321105.321114 · Cited by 1,985
Banham, M. R., & Katsaggelos, A. K. (1997) · IEEE Signal Processing Magazine · doi:10.1109/79.581363 · Cited by 1,678
Iterative Methods for Total Variation Denoising
Vogel, C. R., & Oman, M. E. (1996) · SIAM Journal on Scientific Computing · doi:10.1137/0917016 · Cited by 1,076
Generalizing the Singular Value Decomposition
Loan, C. F. V. (1976) · SIAM Journal on Numerical Analysis · doi:10.1137/0713009 · Cited by 656
Wahba, G. (1985) · The Annals of Statistics · doi:10.1214/aos/1176349743 · Cited by 523
Least Squares Methods for Ill-Posed Problems with a Prescribed Bound
Miller, K. (1970) · SIAM Journal on Mathematical Analysis · doi:10.1137/0501006 · Cited by 504
Whittaker, E. T. (1922) · Proceedings of the Edinburgh Mathematical Society · doi:10.1017/s0013091500077853 · Cited by 504
Barndorff-Nielsen, O. E., & Cox, D. R. (2017) · Routledge eBooks · doi:10.1201/9780203750940 · Cited by 491
Presentations of faithful d.g. near-rings
Meldrum, J. D. P. (1980) · Proceedings of the Edinburgh Mathematical Society · doi:10.1017/s001309150000359x · Cited by 474
Algorithms for the regularization of ill-conditioned least squares problems
Eldén, L. (1977) · BIT Numerical Mathematics · doi:10.1007/bf01932285 · Cited by 308
Minimizing GCV/GML Scores with Multiple Smoothing Parameters via the Newton Method
Gu, C., & Wahba, G. (1991) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0912021 · Cited by 188
The Stability of Inverse Problems
Bertero, M., Mol, C. D., & Viano, G. A. (1980) · Topics in current physics · doi:10.1007/978-3-642-81472-3_5 · Cited by 157
Computing the Generalized Singular Value Decomposition
Paige, C. C. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907077 · Cited by 143
Asymptotic Inference for Mixture Models by Using Data-Dependent Priors
Wasserman, L. (2000) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/1467-9868.00226 · Cited by 126
A General Heuristic for Choosing the Regularization Parameter in Ill-Posed Problems
Hanke, M., & Raus, T. (1996) · SIAM Journal on Scientific Computing · doi:10.1137/0917062 · Cited by 123
Riley, J. D. (1955) · Mathematics of Computation · doi:10.1090/s0025-5718-1955-0074915-1 · Cited by 116
Computing the CS and the generalized singular value decompositions
Loan, C. F. V. (1985) · Numerische Mathematik · doi:10.1007/bf01389653 · Cited by 105
The regularizing properties of the adjoint gradient method in ill-posed problems
Nemirovski, A. S. (1986) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(86)90002-9 · Cited by 104
PET regularization by envelope guided conjugate gradients
Kaufman, L., & Neumaier, A. (1996) · IEEE Transactions on Medical Imaging · doi:10.1109/42.500147 · Cited by 45
Self-citationSuperfast algorithms for Cauchy-like matrix computations and extensions
Pan, V. Y., & Zheng, A.-L. (2000) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(00)00041-0 · Cited by 30
Cited by
A sparse signal reconstruction perspective for source localization with sensor arrays
Malioutov, D., Cetin, M., & Willsky, A. S. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.850882 · Cited by 2,638
An Interior-Point Method for Large-Scale -Regularized Least Squares
Kim, S.-J., Koh, K., Lustig, M., Boyd, S., & Gorinevsky, D. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910971 · Cited by 2,083
Speech emotion recognition using deep 1D & 2D CNN LSTM networks
Zhao, J., Mao, X., & Chen, L. (2019) · Biomedical Signal Processing and Control · doi:10.1016/j.bspc.2018.08.035 · Cited by 1,044
Reconstruction of Abel-transformable images: The Gaussian basis-set expansion Abel transform method
Dribinski, V., Ossadtchi, A., Mandelshtam, V. A., & Reisler, H. (2002) · Review of Scientific Instruments · doi:10.1063/1.1482156 · Cited by 943
Ten quick tips for machine learning in computational biology
Chicco, D. (2017) · BioData Mining · doi:10.1186/s13040-017-0155-3 · Cited by 878
Metadata
- Authors
- Neumaier, A.
- Venue
- SIAM Review
- Published
- 1998-01
- Volume
- 40
- Issue
- 3
- Pages
- 636-666
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2019787708
- Cited by
- 644
- References
- 31
- FWCI
- 12.60
- 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
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.