Decomposition methods for large linear discrete ill-posed problems
From MaRDI portal
Publication:2508945
The authors present decomposition methods for large linear discrete ill-posed problems. The main idea is a splitting of the solution space into a Krylov subspace determined by a standard iterative method of GMRES-type or the least squares QR method and a user-supplied subspace. The latter is of small dimension and can be chosen to help represent the pertinent features of the solution. Numerical tests show that the decomposition methods can yield better approximations of the solution than the standard iterative methods.
Recommendations
- Publication:4952742
- Subspace-restricted singular value decompositions for linear discrete ill-posed problems
- Range restricted iterative methods for linear discrete ill-posed problems
- scientific article; zbMATH DE number 1740439
- The structure of iterative methods for symmetric linear discrete ill-posed problems
Cites work
- A weighted pseudoinverse, generalized singular values, and constrained least squares problems
- Augmented GMRES-type methods
- Breakdown-free GMRES for Singular Systems
- Enriched Krylov subspace methods for ill-posed problems
- GMRES, L-curves, and discrete ill-posed problems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 4215266 (Why is no real title available?)
- scientific article; zbMATH DE number 1740439 (Why is no real title available?)
- scientific article; zbMATH DE number 783550 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- On the regularizing properties of the GMRES method
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- The Use of Auto-correlation for Pseudo-rank Determination in Noisy III-conditioned Linear Least-squares Problems
Cited in
(23)- Subspace preconditioned LSQR for discrete ill-posed problems
- Parameter determination for Tikhonov regularization problems in general form
- A note on augmented unprojected Krylov subspace methods
- A modified Tikhonov regularization method
- Combining approximate solutions for linear discrete ill-posed problems
- FGMRES for linear discrete ill-posed problems
- Model selection criteria for a linear model to solve discrete ill-posed problems on the basis of singular decomposition and random projection
- Tikhonov regularization based on generalized Krylov subspace methods
- Discretization strategy for linear ill-posed problems in variable Hilbert scales
- Subspace Recycling--Based Regularization Methods
- Iteratively reweighted FGMRES and FLSQR for sparse reconstruction
- On the Lanczos and Golub-Kahan reduction methods applied to discrete ill-posed problems.
- Subspace-restricted singular value decompositions for linear discrete ill-posed problems
- Range restricted iterative methods for linear discrete ill-posed problems
- Preconditioners for Krylov subspace methods: An overview
- A survey of subspace recycling iterative methods
- An iterative method for Tikhonov regularization with a general linear regularization operator
- A projection method for general form linear least-squares problems
- Inverse radiation analysis of simultaneous estimation of temperature field and radiative properties in a two-dimensional participating medium
- A study on decomposition methods
- A truncated projected SVD method for linear discrete ill-posed problems
- Tikhonov regularization via flexible Arnoldi reduction
- Inverse radiation problem of temperature field in three-dimensional rectangular enclosure containing inhomogeneous, anisotropically scattering media
This page was built for publication: Decomposition methods for large linear discrete ill-posed problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2508945)
