Compression approaches for the regularized solutions of linear systems from large-scale inverse problems
From MaRDI portal
Publication:901334
Abstract: We introduce and compare new compression approaches to obtain regularized solutions of large linear systems which are commonly encountered in large scale inverse problems. We first describe how to approximate matrix vector operations with a large matrix through a sparser matrix with fewer nonzero elements, by borrowing from ideas used in wavelet image compression. Next, we describe and compare approaches based on the use of the low rank SVD, which can result in further size reductions. We describe how to obtain the approximate low rank SVD of the original matrix using the sparser wavelet compressed matrix. Some analytical results concerning the various methods are presented and the results of the proposed techniques are illustrated using both synthetic data and a very large linear system from a seismic tomography application, where we obtain significant compression gains with our methods, while still resolving the main features of the solutions.
Recommendations
- Regularization with randomized SVD for large-scale discrete inverse problems
- Randomized algorithms for large-scale inverse problems with general Tikhonov regularizations
- Exploiting compression in solving discretized linear systems
- Regularized Linear Inversion with Randomized Singular Value Decomposition
- Fast \(l_ p\) solution of large, sparse, linear systems: Application to seismic travel time tomography
Cites work
- scientific article; zbMATH DE number 108512 (Why is no real title available?)
- scientific article; zbMATH DE number 1303857 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 3227378 (Why is no real title available?)
- A breviary of seismic tomography. Imaging the interior of the earth and sun
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Biorthogonal bases of compactly supported wavelets
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Large-scale Tikhonov regularization via reduction by orthogonal projection
- Low rank approximation. Algorithms, implementation, applications
- Orthonormal bases of compactly supported wavelets
- The ``cubed sphere: A new method for the solution of partial differential equations in spherical geometry
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- Wavelets, approximation, and statistical applications
Cited in
(10)- Pass-efficient randomized algorithms for low-rank matrix approximation using any number of views
- A compressive Landweber iteration for solving ill-posed inverse problems
- Optimal regularized inverse matrices for inverse problems
- Low-Rank Eigenvector Compression of Posterior Covariance Matrices for Linear Gaussian Inverse Problems
- An efficient approach for computing optimal low-rank regularized inverse matrices
- Exploiting compression in solving discretized linear systems
- Randomized algorithms for large-scale inverse problems with general Tikhonov regularizations
- Regularization with randomized SVD for large-scale discrete inverse problems
- Analysis and Exploitation of Matrix Structure Arising in Linearized Optical Tomographic Imaging
- A framework for regularization via operator approximation
This page was built for publication: Compression approaches for the regularized solutions of linear systems from large-scale inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q901334)
