Structure-aware analyses and algorithms for interpolative decompositions

DOI10.1137/23M1610811MaRDI QIDQ6986963zbMATH OpenFDO

Authors Robin L. Armstrong, Alex Buzali, Anil Damle

Publication date 7 May 2025

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/23M1610811

zbMATH Keywords

coherenceinterpolative decompositionlow-rank approximationrandomized SVDrank-revealing QR factorizationstable rank

Mathematics Subject Classification ID

Numerical methods for low-rank matrix approximation; matrix compression (65F55) Randomized algorithms (68W20)

Cites work

• A DEIM induced CUR factorization
• A fast randomized algorithm for the approximation of matrices
• A new selection operator for the discrete empirical interpolation method -- improved a priori error bound and extensions
• A randomized algorithm for principal component analysis
• CUR matrix decompositions for improved data analysis
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• Efficient algorithms for CUR and interpolative matrix decompositions
• Efficient bounds and estimates for canonical angles in randomized subspace approximations
• Efficient volume sampling for row/column subset selection
• Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
• Fast approximation of matrix coherence and statistical leverage
• Fast monte-carlo algorithms for finding low-rank approximations
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• Functions of Matrices
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• Householder QR factorization with randomization for column pivoting (HQRRP)
• scientific article; zbMATH DE number 1215246 (Why is no real title available?)
• scientific article; zbMATH DE number 3799843 (Why is no real title available?)
• Matrix approximation and projective clustering via volume sampling
• Nonlinear model reduction via discrete empirical interpolation
• On Rank-Revealing Factorisations
• On selecting a maximum volume sub-matrix of a matrix and related problems
• On the Compression of Low Rank Matrices
• Randomized algorithms for the low-rank approximation of matrices
• Randomized Discrete Empirical Interpolation Method for Nonlinear Model Reduction
• Randomized QR with column pivoting
• Randomized subspace iteration: analysis of canonical angles and unitarily invariant norms
• Rank-Revealing QR Factorizations and the Singular Value Decomposition
• Relative-Error CUR Matrix Decompositions
• Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
• SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
• The approximation of one matrix by another of lower rank.
• The Rotation of Eigenvectors by a Perturbation. III
• The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics
• Uniform Bounds for Invariant Subspace Perturbations
• Unitarily Invariant Metrics on the Grassmann Space

Cited in

(2)

• Computing Strong Rank-Revealing Factorizations for Matrices with Orthonormal Rows
• Collect, commit, expand: efficient CPQR-based column selection for extremely wide matrices

This page was built for publication: Structure-aware analyses and algorithms for interpolative decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6986963)