Simple and efficient determination of the Tikhonov regularization parameter chosen by the generalized discrepancy principle for discrete ill-posed problems
From MaRDI portal
Publication:2355574
DOI10.1007/S10915-014-9888-ZzbMath1323.65038OpenAlexW2166418326MaRDI QIDQ2355574
Publication date: 24 July 2015
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-014-9888-z
algorithmconvergenceprojection methodTikhonov regularizationnumerical experimentgeneralized discrepancy principlederivative-free algorithmnoisy operatornoisy right hand sidediscrete ill-posed problems
Related Items (7)
A Tikhonov regularized penalty function approach for solving polylinear programming problems ⋮ Galerkin approach for estimating boundary data in Poisson equation on annular domain with application to heat transfer coefficient estimation in coiled tubes ⋮ A numerical reconstruction method in inverse elastic scattering ⋮ Rapid generalized Schultz iterative methods for the computation of outer inverses ⋮ Sampling method based projection approach for the reconstruction of 3D acoustically penetrable scatterers ⋮ Approximate Schur-block ILU preconditioners for regularized solution of discrete ill-posed problems ⋮ A numerical comparison of different qualitative algorithms for solving 2D inverse elastic scattering problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Overview of total least-squares methods
- A maximum product criterion as a Tikhonov parameter choice rule for Kirsch's factorization method
- An iterative method for Tikhonov regularization with a general linear regularization operator
- On the generalized discrepancy principle for Tikhonov regularization in Hilbert scales
- Moment theory and some inverse problems in potential theory and heat conduction
- A weighted-GCV method for Lanczos-hybrid regularization
- Simple square smoothing regularization operators
- Fixed-point iterations in determining a Tikhonov regularization parameter in Kirsch's factorization method
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Large-scale Tikhonov regularization of total least squares
- A weighted pseudoinverse, generalized singular values, and constrained least squares problems
- GKB-FP: An algorithm for large-scale discrete ill-posed problems
- Regularized total least squares based on quadratic eigenvalue problem solvers
- Fixed-point iterations in determining the Tikhonov regularization parameter
- Regularization of linear ill-posed problems with noisy right hand side and noisy operator
- Regularized Total Least Squares: Computational Aspects and Error Bounds
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Characterization of the shape of a scattering obstacle using the spectral data of the far field operator
- Rank-Deficient and Discrete Ill-Posed Problems
- A simple method using Morozov's discrepancy principle for solving inverse scattering problems
- Efficient Algorithms for Solution of Regularized Total Least Squares
- Tikhonov Regularization and Total Least Squares
- Extension of GKB‐FP algorithm to large‐scale general‐form Tikhonov regularization
- Two notes on the choice of regularization parameter
- Inverse acoustic and electromagnetic scattering theory
This page was built for publication: Simple and efficient determination of the Tikhonov regularization parameter chosen by the generalized discrepancy principle for discrete ill-posed problems
