Subspace-restricted singular value decompositions for linear discrete ill-posed problems
From MaRDI portal
The authors solve noisy underdetermined ill-posed linear systems, \(Ax=b+e\), of small dimensions by means of truncated singular value decomposition (SVD), truncated generalized SVD and truncated subspace-restricted SVD that allow the solution subspace or the range of \(A\) to contain specified subspaces. Theoretical comparisons and computed examples are presented.
Recommendations
- A truncated projected SVD method for linear discrete ill-posed problems
- On the computation of a truncated SVD of a large linear discrete ill-posed problem
- A modified truncated singular value decomposition method for discrete ill-posed problems.
- Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank
- Decomposition methods for large linear discrete ill-posed problems
Cites work
- A truncated projected SVD method for linear discrete ill-posed problems
- Deblurring Images
- GMRES, L-curves, and discrete ill-posed problems
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Laurent series and their Padé approximations
- Linear algebra, rational approximation and orthogonal polynomials
- Numerically robust transfer function modeling from noisy frequency domain data
- Orthogonal basis functions in discrete least-squares rational approximation.
- Partial least-squares vs. Lanczos bidiagonalization. I: Analysis of a projection method for multiple regression
- Regularization tools version 4.0 for matlab 7.3
- Regularization, GSVD and truncated GSVD
- The Modified Truncated SVD Method for Regularization in General Form
- The Use of Auto-correlation for Pseudo-rank Determination in Noisy III-conditioned Linear Least-squares Problems
- Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank
Cited in
(13)- On the perturbation of an \(L^2\)-orthogonal projection
- Solution of the ill-posed semiparametric regression model based on singular value modification restriction
- On the computation of a truncated SVD of a large linear discrete ill-posed problem
- Combining approximate solutions for linear discrete ill-posed problems
- Decomposition methods for large linear discrete ill-posed problems
- Exploiting compression in solving discretized linear systems
- Inverse subspace problems with applications.
- Hybrid projection methods with recycling for inverse problems
- Hybrid Projection Methods with Recycling for Inverse Problems
- Estimate of the spectrum of discrete sequences in ill-posed problems based on the study of the numerical rank of the trajectory matrix
- A Gauss-Newton method for mixed least squares-total least squares problems
- Efficient randomized algorithms for computing an approximation of the tensor train decomposition
- A truncated projected SVD method for linear discrete ill-posed problems
This page was built for publication: Subspace-restricted singular value decompositions for linear discrete ill-posed problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q607252)
