Projected Tikhonov regularization of large-scale discrete ill-posed problems
DOI10.1007/S10915-013-9685-0zbMATH Open1280.65038OpenAlexW2058671681MaRDI QIDQ368090FDOQ368090
Authors: D. 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
Recommendations
- Large-scale Tikhonov regularization via reduction by orthogonal projection
- Tikhonov regularization of large linear problems
- Minimization of functionals on the solution of a large-scale discrete ill-posed problem
- Tikhonov regularization of large symmetric problems
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
confidence intervallow rank approximationTikhonov regularizationalgorithmnumerical experimentsill-posed problemsleast squares problemstruncated singular value decompositionconstrained minimization problem
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22)
Cites Work
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Computing a Trust Region Step
- Restarted block Lanczos bidiagonalization methods
- Rank-Deficient and Discrete Ill-Posed Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- An introduction to the mathematical theory of inverse problems
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Tikhonov regularization of large linear problems
- Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
- Title not available (Why is that?)
- A new matrix-free algorithm for the large-scale trust-region subproblem
- Minimization of functionals on the solution of a large-scale discrete ill-posed problem
- Quadratically constrained least squares and quadratic problems
- Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems
- A Jacobi--Davidson type SVD method
- Confidence Intervals for Inequality-Constrained Least Squares Problems, with Applications to Ill-Posed Problems
- Title not available (Why is that?)
- Algorithms for the computation of functionals defined on the solution of a discrete ill-posed problem
Cited In (9)
- Discrete ill-posed least-squares problems with a solution norm constraint
- An automatic regularization parameter selection algorithm in the total variation model for image deblurring
- Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
- Confidence Intervals for Inequality-Constrained Least Squares Problems, with Applications to Ill-Posed Problems
- Tikhonov regularization and randomized GSVD
- Tensor completion via fully-connected tensor network decomposition with regularized factors
- Minimization of functionals on the solution of a large-scale discrete ill-posed problem
- Algorithms for the computation of functionals defined on the solution of a discrete ill-posed problem
Uses Software
This page was built for publication: Projected Tikhonov regularization of large-scale discrete ill-posed problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q368090)
