Extension of GKB‐FP algorithm to large‐scale general‐form Tikhonov regularization
From MaRDI portal
Publication:5502416
DOI10.1002/nla.1874zbMath1340.65071OpenAlexW1741378021MaRDI QIDQ5502416
Maria Cristina C. Cunha, Leonardo S. Borges, Fermin S. Viloche Bazán
Publication date: 26 August 2015
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.1874
algorithmconvergencenumerical resultspreconditioningTikhonov regularizationill-posed problemslarge-scale problems
Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical computation of matrix norms, conditioning, scaling (65F35) Preconditioners for iterative methods (65F08)
Related Items
Weighted conjugate gradient-type methods for solving quadrature discretization of Fredholm integral equations of the first kind ⋮ Inverse time-dependent source problem for the heat equation with a nonlocal Wentzell-Neumann boundary condition ⋮ Some results on the regularization of LSQR for large-scale discrete ill-posed problems ⋮ Chebyshev pseudospectral method in the reconstruction of orthotropic conductivity ⋮ Sampling method based projection approach for the reconstruction of 3D acoustically penetrable scatterers ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Large-scale Tikhonov regularization via reduction by orthogonal projection
- Implementations of range restricted iterative methods for linear discrete ill-posed problems
- Tikhonov regularization based on generalized Krylov subspace methods
- Comparing parameter choice methods for regularization of ill-posed problems
- Computing projections with LSQR
- The discrete Picard condition for discrete ill-posed problems
- A weighted-GCV method for Lanczos-hybrid regularization
- An improved preconditioned LSQR for discrete ill-posed problems
- Regularization methods for large-scale problems
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Subspace preconditioned LSQR for discrete ill-posed problems
- A weighted pseudoinverse, generalized singular values, and constrained least squares problems
- The triangle method for finding the corner of the L-curve
- GKB-FP: An algorithm for large-scale discrete ill-posed problems
- Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
- Iterative methods for ill-posed problems and semiconvergent sequences
- An adaptive pruning algorithm for the discrete L-curve criterion
- Fixed-point iterations in determining the Tikhonov regularization parameter
- An improved fixed-point algorithm for determining a Tikhonov regularization parameter
- Remarks on choosing a regularization parameter using the quasi-optimality and ratio criterion
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Solution of Sparse Indefinite Systems of Linear Equations
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Rank-Deficient and Discrete Ill-Posed Problems
- A Regularization Parameter in Discrete Ill-Posed Problems
- A Projection‐Based Approach to General‐Form Tikhonov Regularization
- Smoothing‐Norm Preconditioning for Regularizing Minimum‐Residual Methods
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
