skip to main content


Title: A Comparison of Compressed Sensing and Sparse Recovery Algorithms Applied to Simulation Data

The move toward exascale computing for scientific simulations is placing new demands on compression techniques. It is expected that the I/O system will not be able to support the volume of data that is expected to be written out. To enable quantitative analysis and scientific discovery, we are interested in techniques that compress high-dimensional simulation data and can provide perfect or near-perfect reconstruction. In this paper, we explore the use of compressed sensing (CS) techniques to reduce the size of the data before they are written out. Using large-scale simulation data, we investigate how the sufficient sparsity condition and the contrast in the data affect the quality of reconstruction and the degree of compression. Also, we provide suggestions for the practical implementation of CS techniques and compare them with other sparse recovery methods. Finally, our results show that despite longer times for reconstruction, compressed sensing techniques can provide near perfect reconstruction over a range of data with varying sparsity.
 [1] ;  [1]
  1. Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Publication Date:
Report Number(s):
Journal ID: ISSN 2311-004X
Grant/Contract Number:
Accepted Manuscript
Journal Name:
Statistics, Optimization & Information Computing
Additional Journal Information:
Journal Volume: 4; Journal Issue: 3; Journal ID: ISSN 2311-004X
Research Org:
Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Sponsoring Org:
Country of Publication:
United States
97 MATHEMATICS AND COMPUTING; Compressed Sensing; Sparse Recovery; Simulation Data; Algorithms
OSTI Identifier: