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)

Cites Work

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

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)