A new zero-finder for Tikhonov regularization

DOI10.1007/s10543-008-0179-7zbMath1161.65029OpenAlexW1977820150MaRDI QIDQ960039

Andriy Shyshkov, Lothar Reichel

Publication date: 16 December 2008

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10543-008-0179-7

zbMATH Keywords

convergencesingular valuesTikhonov regularizationdiscrepancy principleill-posed problemleast-squares problemzero-finder

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22)

Related Items (18)

Golub-Kahan vs. Monte Carlo: a comparison of bidiagonlization and a randomized SVD method for the solution of linear discrete ill-posed problems ⋮ Embedded techniques for choosing the parameter in Tikhonov regularization ⋮ Adaptive cross approximation for Tikhonov regularization in general form ⋮ Some numerical aspects of Arnoldi-Tikhonov regularization ⋮ Large-scale Tikhonov regularization via reduction by orthogonal projection ⋮ Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches ⋮ Tikhonov regularization based on generalized Krylov subspace methods ⋮ On an exact numerical simulation of solitary-wave solutions of the Burgers-Huxley equation through Cardano's method ⋮ An inner–outer iterative method for edge preservation in image restoration and reconstruction ^* ⋮ Generalized singular value decomposition with iterated Tikhonov regularization ⋮ Arnoldi-Tikhonov regularization methods ⋮ Iterative Tikhonov regularization of tensor equations based on the Arnoldi process and some of its generalizations ⋮ A survey on variational characterizations for nonlinear eigenvalue problems ⋮ Tensor Arnoldi-Tikhonov and GMRES-type methods for ill-posed problems with a t-product structure ⋮ Matrix forms of iterative algorithms to solve large-scale discrete ill-posed problems with an application to image restoration ⋮ Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications ⋮ A comparison of parameter choice rules for \(\ell^p\)-\(\ell^q\) minimization ⋮ A modified Tikhonov regularization method

Uses Software

• Regularization tools
• GQTPAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smoothing by spline functions. II
• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
• Tikhonov regularization of large linear problems
• Improvement of the resolution of an instrument by numerical solution of an integral equation
• Computing a Trust Region Step
• On Halley's Iteration Method
• The Use of Auto-correlation for Pseudo-rank Determination in Noisy III-conditioned Linear Least-squares Problems
• Algorithms for the regularization of ill-conditioned least squares problems

This page was built for publication: A new zero-finder for Tikhonov regularization