Compression Approaches for the Regularized Solutions of Linear Systems from Large-Scale Inverse Problems

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.

References in corpus (1)

• Improving CUR Matrix Decomposition and the Nyström Approximation via Adaptive Sampling

Cited by in corpus (6)

• A fast algorithm for regularized focused 3-D inversion of gravity data using the randomized SVD
• Total variation regularization of the $3$-D gravity inverse problem using a randomized generalized singular value decomposition
• A fast methodology for large-scale focusing inversion of gravity and magnetic data using the structured model matrix and the $2D$ fast Fourier transform
• Large-scale focusing joint inversion of gravity and magnetic data with Gramian constraint
• Inversion of electromagnetic induction data using a novel wavelet-based and scale-dependent regularization term
• Semiparametric Wavelet-based JPEG IV Estimator for endogenously truncated data