Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation

02/22/2019
by   Joel A. Tropp, et al.
0

This paper argues that randomized linear sketching is a natural tool for on-the-fly compression of data matrices that arise from large-scale scientific simulations and data collection. The technical contribution consists in a new algorithm for constructing an accurate low-rank approximation of a matrix from streaming data. This method is accompanied by an a priori analysis that allows the user to set algorithm parameters with confidence and an a posteriori error estimator that allows the user to validate the quality of the reconstructed matrix. In comparison to previous techniques, the new method achieves smaller relative approximation errors and is less sensitive to parameter choices. As concrete applications, the paper outlines how the algorithm can be used to compress a Navier--Stokes simulation and a sea surface temperature dataset.

READ FULL TEXT
research
08/31/2016

Randomized single-view algorithms for low-rank matrix approximation

This paper develops a suite of algorithms for constructing low-rank appr...
research
03/12/2021

Projection-based QLP Algorithm for Efficiently Computing Low-Rank Approximation of Matrices

Matrices with low numerical rank are omnipresent in many signal processi...
research
07/13/2022

Jackknife Variability Estimation For Randomized Matrix Computations

Randomized algorithms based on sketching have become a workhorse tool in...
research
06/18/2017

Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data

Several important applications, such as streaming PCA and semidefinite p...
research
08/29/2023

Streaming Compression of Scientific Data via weak-SINDy

In this paper a streaming weak-SINDy algorithm is developed specifically...
research
08/23/2021

Effective Streaming Low-tubal-rank Tensor Approximation via Frequent Directions

Low-tubal-rank tensor approximation has been proposed to analyze large-s...
research
06/10/2019

Refinement of Low Rank Approximation of a Matrix at Sub-linear Cost

Low rank approximation (LRA) of a matrix is a hot subject of modern comp...

Please sign up or login with your details

Forgot password? Click here to reset