GKB-FP: An algorithm for large-scale discrete ill-posed problems
From MaRDI portal
Publication:1960212
The authors present a new algorithm for discrete ill-posed problems, which is called GKB-FP. This method exploits the Golub-Kahan bidiagonalization algorithm together with Tikhonov regularization in the generated Krylov subspace. The regularization parameter for the projected problem is chosen by the fixed-point method already presented by the first author. A detailed convergence analysis is provided. The paper is enriched by many numerical results on well-known problems so that the effectiveness of the method appears comparable with other methods already used, and even better.
Recommendations
- Simple and efficient determination of the Tikhonov regularization parameter chosen by the generalized discrepancy principle for discrete ill-posed problems
- Extension of GKB-FP algorithm to large-scale general-form Tikhonov regularization.
- Global Golub-Kahan bidiagonalization applied to large discrete ill-posed problems
- On a generalization of Regińska's parameter choice rule and its numerical realization in large-scale multi-parameter Tikhonov regularization
- An improved fixed-point algorithm for determining a Tikhonov regularization parameter
Cites work
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
- A Projection‐Based Approach to General‐Form Tikhonov Regularization
- A Regularization Parameter in Discrete Ill-Posed Problems
- A weighted-GCV method for Lanczos-hybrid regularization
- Algorithms for the regularization of ill-conditioned least squares problems
- An Analysis of the Zero-Crossing Method for Choosing Regularization Parameters
- An implicit shift bidiagonalization algorithm for ill-posed systems
- An improved fixed-point algorithm for determining a Tikhonov regularization parameter
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Choosing regularization parameters in iterative methods for ill-posed problems
- Determining the regularization parameters for super-resolution problems
- Efficient determination of multiple regularization parameters in a generalized L-curve framework
- Estimation of the \(L\)-curve via Lanczos bidiagonalization
- Fast CG-Based Methods for Tikhonov--Phillips Regularization
- Fixed-point iterations in determining the Tikhonov regularization parameter
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- scientific article; zbMATH DE number 1304508 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 3227378 (Why is no real title available?)
- Iterative methods for ill-posed problems and semiconvergent sequences
- Iterative methods for image deblurring: A Matlab object-oriented approach
- Iterative Regularization and MINRES
- L-curve and curvature bounds for Tikhonov regularization
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- On the choice of the regularization parameter in ill-posed problems with approximately given noise level of data
- On the regularizing properties of the GMRES method
- Regularization methods for large-scale problems
- Regularization Parameter Selection in Discrete Ill-Posed Problems — The Use of the U-Curve
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Residual periodograms for choosing regularization parameters for ill-posed problems
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Tikhonov regularization of large linear problems
- Use of extrapolation in regularization methods
Cited in
(17)- GKB-FP
- Space-dependent perfusion coefficient estimation in a 2D bioheat transfer problem
- Some results on the regularization of LSQR for large-scale discrete ill-posed problems
- On a generalization of Regińska's parameter choice rule and its numerical realization in large-scale multi-parameter Tikhonov regularization
- Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems
- An iterative method to compute minimum norm solutions of ill-posed problems in Hilbert spaces
- Simple and efficient determination of the Tikhonov regularization parameter chosen by the generalized discrepancy principle for discrete ill-posed problems
- Weighted conjugate gradient-type methods for solving quadrature discretization of Fredholm integral equations of the first kind
- Global Golub-Kahan bidiagonalization applied to large discrete ill-posed problems
- Optimal Kronecker product approximation of block Toeplitz matrices
- A hybrid LSMR algorithm for large-scale Tikhonov regularization
- A novel method for estimating the distribution of convective heat flux in ducts: Gaussian filtered singular value decomposition
- Hybrid projection methods with recycling for inverse problems
- Hybrid Projection Methods with Recycling for Inverse Problems
- Generalized Hybrid Iterative Methods for Large-Scale Bayesian Inverse Problems
- Extension of GKB-FP algorithm to large-scale general-form Tikhonov regularization.
- Sampling method based projection approach for the reconstruction of 3D acoustically penetrable scatterers
This page was built for publication: GKB-FP: An algorithm for 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 Q1960212)
