Compression approaches for the regularized solutions of linear systems from large-scale inverse problems
DOI10.1007/S13137-015-0073-9zbMath1338.65110arXiv1404.5684OpenAlexW1495031820MaRDI QIDQ901334
Guust Nolet, Dylan Mikesell, Sergey Voronin
Publication date: 11 January 2016
Published in: GEM - International Journal on Geomathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.5684
waveletsregularizationsingular value decompositiondata compressionerror boundsparse matrixrandomized algorithmlinear ill-posed problemslower rank approximation
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical methods for wavelets (65T60)
Related Items (1)
Uses Software
Cites Work
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Large-scale Tikhonov regularization via reduction by orthogonal projection
- Low rank approximation. Algorithms, implementation, applications
- Wavelets, approximation, and statistical applications
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- The ``cubed sphere: A new method for the solution of partial differential equations in spherical geometry
- Orthonormal bases of compactly supported wavelets
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Biorthogonal bases of compactly supported wavelets
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Compression approaches for the regularized solutions of linear systems from large-scale inverse problems
