Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1902.08651 v1 pith:6PILRDBM submitted 2019-02-22 cs.NA cs.NA

classification cs.NA
keywords algorithmapproximationdatamatrixallowslow-rankmethodscientific
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Superfast 1-Norm Estimation

    math.NA 2025-05 conditional novelty 6.0 of 10

    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.

Pith tools