Maximal volume matrix cross approximation for image compression and least squares solution

DOI10.1007/S10444-024-10196-7MaRDI QIDQ6624470zbMATH OpenFDO

Authors Kenneth Allen, Ming-Jun Lai, Zhaiming Shen

Publication date 25 October 2024

Published in Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10444-024-10196-7

zbMATH Keywords

greedy maximal volume algorithmleast squares approximationlow rank integer matrixmatrix completion and compressionmatrix cross approximation

Mathematics Subject Classification ID

Numerical methods for low-rank matrix approximation; matrix compression (65F55) Computing methodologies for image processing (68U10)

Recommendations

• On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
• Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices
• On the accuracy of cross and column low-rank maxvol approximations in average
• Fast low rank approximations of matrices and tensors
• Pseudo-skeleton approximations by matrices of maximal volume

Cites work

• A DEIM induced CUR factorization
• A new selection operator for the discrete empirical interpolation method -- improved a priori error bound and extensions
• A note on error bounds for pseudo skeleton approximations of matrices
• A theory of pseudoskeleton approximations
• A volume associated with \(m{\times}n\) matrices
• Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition
• CUR matrix decompositions for improved data analysis
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• How to find a good submatrix
• Literature survey on low rank approximation of matrices
• Mode-wise tensor decompositions: multi-dimensional generalizations of CUR decompositions
• Nonlinear model reduction via discrete empirical interpolation
• On best uniform approximation by low-rank matrices
• On selecting a maximum volume sub-matrix of a matrix and related problems
• On the existence and computation of rank-revealing LU factorizations
• Orthogonal rank-one matrix pursuit for low rank matrix completion
• Perspectives on CUR decompositions
• Principal submatrices. IX: Interlacing inequalities for singular values of submatrices
• Pseudo-skeleton approximations with better accuracy estimates
• Rank revealing Gaussian elimination by the maximum volume concept
• Rectangular maximum-volume submatrices and their applications
• Relative-Error CUR Matrix Decompositions
• Sparse Solutions of Underdetermined Linear Systems and Their Applications
• Sparsity and incoherence in compressive sampling
• The maximal-volume concept in approximation by low-rank matrices
• TT-cross approximation for multidimensional arrays

Cited in

(3)

• Optimal linear B-spline approximation via Kolmogorov superposition theorem and its applications
• Structure-Preserving Reduced-Order Modeling via Low-Rank Transport Signatures
• Iterative Methods for Computing the Moore--Penrose Inverse of Split-Quaternion Matrices with Applications

This page was built for publication: Maximal volume matrix cross approximation for image compression and least squares solution

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