CUR LRA at Sublinear Cost Based on Volume Maximization

DOI10.1007/978-3-030-43120-4_10OpenAlexW3013514068MaRDI QIDQ5014668FDOQ5014668

Authors Qi Luan, Victor Y. Pan

Publication date 8 December 2021

Published in Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-43120-4_10

zbMATH Keywords

maximal volumecross-approximation (C-A)CUR LRAlow rank approximation (LRA)sublinear costsymmetric positive semidefinite (SPSD) matrices

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Recommendations

• Sublinear Cost Low Rank Approximation via Subspace Sampling
• Relative-Error $CUR$ Matrix Decompositions
• Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods

Cites work

• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• A theory of pseudoskeleton approximations
• Approximation of boundary element matrices
• CUR matrix decompositions for improved data analysis
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• New studies of randomized augmentation and additive preprocessing
• Numerically safe Gaussian elimination with no pivoting
• On Rank-Revealing Factorisations
• On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
• On selecting a maximum volume sub-matrix of a matrix and related problems
• Pseudo-skeleton approximations with better accuracy estimates
• Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
• Relative-Error $CUR$ Matrix Decompositions
• The maximal-volume concept in approximation by low-rank matrices

Cited in

(1)

• Sublinear Cost Low Rank Approximation via Subspace Sampling

This page was built for publication: CUR LRA at Sublinear Cost Based on Volume Maximization

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