Pith. sign in

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

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

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.

fields

math.NA 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Superfast 1-Norm Estimation

math.NA · 2025-05-26 · conditional · novelty 6.0

Randomized sparsification of the vectors in LAPACK's 1-norm estimator produces sublinear-cost estimates whose mean errors are small on the paper's test suite.

citing papers explorer

Showing 1 of 1 citing paper.

  • Superfast 1-Norm Estimation math.NA · 2025-05-26 · conditional · none · ref 39 · internal anchor

    Randomized sparsification of the vectors in LAPACK's 1-norm estimator produces sublinear-cost estimates whose mean errors are small on the paper's test suite.