Pseudo-skeleton approximations with better accuracy estimates
From MaRDI portal
Publication:1675666
DOI10.1016/j.laa.2017.09.032zbMath1376.65073MaRDI QIDQ1675666
A. I. Osinsky, Nikolai L. Zamarashkin
Publication date: 2 November 2017
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2017.09.032
Related Items
Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning, CUR LRA at Sublinear Cost Based on Volume Maximization, Tensor CUR Decomposition under T-Product and Its Perturbation, Perturbations of CUR Decompositions, Robust CUR Decomposition: Theory and Imaging Applications, A note on error bounds for pseudo skeleton approximations of matrices, A literature survey of matrix methods for data science, Polynomial time \(\rho\)-locally maximum volume search, Lower bounds for column matrix approximations, On the distance to low-rank matrices in the maximum norm, On the existence of a nearly optimal skeleton approximation of a matrix in the Frobenius norm, Rectangular maximum-volume submatrices and their applications, A two-stage surrogate model for neo-Hookean problems based on adaptive proper orthogonal decomposition and hierarchical tensor approximation, New applications of matrix methods, On the accuracy of cross and column low-rank maxvol approximations in average, Low-rank approximation algorithms for matrix completion with random sampling, On the best approximation algorithm by low-rank matrices in Chebyshev's norm, Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format, Global optimization based on TT-decomposition, Methods for nonnegative matrix factorization based on low-rank cross approximations, Linear-time CUR approximation of BEM matrices, Low rank methods of approximation in an electromagnetic problem, Tensor trains approximation estimates in the Chebyshev norm, Low complexity matrix projections preserving actions on vectors, Low Rank Structures in Solving Electromagnetic Problems
Cites Work
- Unnamed Item
- Unnamed Item
- TT-cross approximation for multidimensional arrays
- CUR matrix decompositions for improved data analysis
- A note on subset selection for matrices
- Quasioptimality of skeleton approximation of a matrix in the Chebyshev norm
- Subset selection for matrices
- On cross approximation of multi-index arrays
- A theory of pseudoskeleton approximations
- Adaptive low-rank approximation of collocation matrices
- Incomplete cross approximation in the mosaic-skeleton method
- Approximation of boundary element matrices
- Quasioptimality of maximum-volume cross interpolation of tensors
- Application of the method of incomplete cross approximation to a nonstationary problem of vortex rings dynamics
- Optimal CUR Matrix Decompositions
- Accelerating Galerkin BEM for linear elasticity using adaptive cross approximation
- Relative-Error $CUR$ Matrix Decompositions
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Inequalities: theory of majorization and its applications
