Projected Tikhonov regularization of large-scale discrete ill-posed problems
From MaRDI portal
Publication:368090
DOI10.1007/s10915-013-9685-0zbMath1280.65038OpenAlexW2058671681MaRDI QIDQ368090
David R. Martin, Lothar Reichel
Publication date: 18 September 2013
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-013-9685-0
algorithmnumerical experimentsTikhonov regularizationill-posed problemsconfidence intervaltruncated singular value decompositionleast squares problemslow rank approximationconstrained minimization problem
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22)
Related Items
Tensor completion via fully-connected tensor network decomposition with regularized factors, Provable stochastic algorithm for large-scale fully-connected tensor network decomposition, An automatic regularization parameter selection algorithm in the total variation model for image deblurring, Tikhonov Regularization and Randomized GSVD
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Restarted block Lanczos bidiagonalization methods
- Algorithms for the computation of functionals defined on the solution of a discrete ill-posed problem
- Quadratically constrained least squares and quadratic problems
- Tikhonov regularization of large linear problems
- Minimization of functionals on the solution of a large-scale discrete ill-posed problem
- Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems
- A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem
- A Jacobi--Davidson Type SVD Method
- Computing a Trust Region Step
- Confidence Intervals for Inequality-Constrained Least Squares Problems, with Applications to Ill-Posed Problems
- Rank-Deficient and Discrete Ill-Posed Problems
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- An introduction to the mathematical theory of inverse problems
