A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems

DOI10.1137/0902037zbMath0469.65089OpenAlexW2123944402MaRDI QIDQ3923556

Dianne P. O'Leary, John A. Simmons

Publication date: 1981

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0902037

zbMATH Keywords

numerical resultsregularizationill-posed problemsLanczos algorithmconvolution kernelsfirst kind integral equationbidiagonalizationlinear least squares problems

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical methods for integral equations (65R20) Fredholm integral equations (45B05)

Related Items (49)

On the computation of a truncated SVD of a large linear discrete ill-posed problem ⋮ A Hybrid LSMR Algorithm for Large-Scale Tikhonov Regularization ⋮ On the choice of solution subspace for nonstationary iterated Tikhonov regularization ⋮ An implicit shift bidiagonalization algorithm for ill-posed systems ⋮ Inheritance of the discrete Picard condition in Krylov subspace methods ⋮ Greedy Tikhonov regularization for large linear ill-posed problems ⋮ A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations ⋮ The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data ⋮ A special modified Tikhonov regularization matrix for discrete ill-posed problems ⋮ Embedded techniques for choosing the parameter in Tikhonov regularization ⋮ A modified truncated singular value decomposition method for discrete ill-posed problems ⋮ A GCV based Arnoldi-Tikhonov regularization method ⋮ Large-scale Tikhonov regularization via reduction by orthogonal projection ⋮ A CCBM-based generalized GKB iterative regularization algorithm for inverse Cauchy problems ⋮ Monte Carlo simulation of permeability fields and reservoir performance predictions with SVD parameterization in RML compared with EnKF ⋮ Regularization properties of LSQR for linear discrete ill-posed problems in the multiple singular value case and best, near best and general low rank approximations ⋮ CGLS-GCV: A hybrid algorithm for low-rank-deficient problems. ⋮ Efficient determination of the hyperparameter in regularized total least squares problems ⋮ Some results on the regularization of LSQR for large-scale discrete ill-posed problems ⋮ An inexact non stationary Tikhonov procedure for large-scale nonlinear ill-posed problems ⋮ Generalized Hybrid Iterative Methods for Large-Scale Bayesian Inverse Problems ⋮ A new method for solving linear ill-posed problems ⋮ Optimal Kronecker Product Approximation of Block Toeplitz Matrices ⋮ GKB-FP: An algorithm for large-scale discrete ill-posed problems ⋮ Regularization parameter estimation for large-scale Tikhonov regularization using a priori information ⋮ An inner–outer iterative method for edge preservation in image restoration and reconstruction ^* ⋮ Krylov Methods for Low-Rank Regularization ⋮ Regularization of inverse problems by an approximate matrix-function technique ⋮ Some transpose-free CG-like solvers for nonsymmetric ill-posed problems ⋮ Hybrid Projection Methods with Recycling for Inverse Problems ⋮ Learning regularization parameters of inverse problems via deep neural networks ⋮ Iteratively Reweighted FGMRES and FLSQR for Sparse Reconstruction ⋮ The regularizing properties of global GMRES for solving large-scale linear discrete ill-posed problems with several right-hand sides ⋮ Numerical methods for \(A\)-optimal designs with a sparsity constraint for ill-posed inverse problems ⋮ Calculating derivatives for automatic history matching ⋮ Large-Scale Inverse Problems in Imaging ⋮ An efficient method to set up a Lanczos based preconditioner for discrete ill-posed problems ⋮ Optimal regularized low rank inverse approximation ⋮ Arnoldi-Tikhonov regularization methods ⋮ Dynamic force identification problem based on a novel improved Tikhonov regularization method ⋮ Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems ⋮ The discrete Picard condition for discrete ill-posed problems ⋮ Asymptotic behavior of singular values and singular functions of certain convolution operators ⋮ Flexible Krylov Methods for $\ell_p$ Regularization ⋮ Hybrid Projection Methods with Recycling for Inverse Problems ⋮ A Framework for Regularization via Operator Approximation ⋮ Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems ⋮ Low-CP-rank tensor completion via practical regularization ⋮ A systolic array for the regularization of ill-conditioned least-squares problem with triangular Toeplitz matrix

This page was built for publication: A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems