A Geometric View of Adaptive Cross Approximation via Exterior Algebra
From MaRDI portal
Cites work
- A DEIM induced CUR factorization
- A meshfree radial point interpolation method (RPIM) for three-dimensional solids
- A note on error bounds for pseudo skeleton approximations of matrices
- A Semi-Lagrangian Adaptive-Rank (SLAR) Method for Linear Advection and Nonlinear Vlasov-Poisson System
- A theory of pseudoskeleton approximations
- Accuracy and Stability of CUR decompositions with Oversampling
- Accuracy and stability of CUR decompositions with oversampling
- Adaptive low-rank approximation of collocation matrices
- Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation
- Coseparable nonnegative tensor factorization with t-CUR decomposition
- CUR Decompositions, Similarity Matrices, and Subspace Clustering
- CUR matrix decompositions for improved data analysis
- Efficient algorithms for CUR and interpolative matrix decompositions
- Error Analysis of Direct Methods of Matrix Inversion
- Generalized Interlacing Families: New Error Bounds for CUR Matrix Decompositions
- Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
- Introduction to hierarchical matrices with applications.
- Low-Rank Approximation by Randomly Pivoted LU
- Low-rank approximation in the Frobenius norm by column and row subset selection
- Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling
- Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositions
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
- On the accuracy of cross and column low-rank maxvol approximations in average
- On the existence of a close to optimal cross approximation in the Frobenius norm
- On the existence of a nearly optimal skeleton approximation of a matrix in the Frobenius norm
- On the low-rank approximation by the pivoted Cholesky decomposition
- Optimal CUR matrix decompositions
- Perspectives on CUR Decompositions
- Perturbations of CUR Decompositions
- Pseudo-skeleton approximations with better accuracy estimates
- Radial basis function based finite element method: formulation and applications
- Radial Basis Function Techniques for Neural Field Models on Surfaces
- Randomized algorithms for low-rank matrix factorizations: sharp performance bounds
- Randomly pivoted Cholesky: practical approximation of a kernel matrix with few entry evaluations
- Rapid Robust Principal Component Analysis: CUR Accelerated Inexact Low Rank Estimation
- Rectangular maximum-volume submatrices and their applications
- Relative-Error CUR Matrix Decompositions
- Revisiting CUR Perturbation Analysis: A Local Tangent-Space Expansion
- Robust CUR Decomposition: Theory and Imaging Applications
- Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
- Robust tensor CUR decompositions: rapid low-Tucker-rank tensor recovery with sparse corruptions
- Simpler is better: A comparative study of randomized algorithms for computing the CUR decomposition
- Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices
- Stability of Sampling for CUR Decompositions
- The growth factor and efficiency of Gaussian elimination with rook pivoting
This page was built for publication: A Geometric View of Adaptive Cross Approximation via Exterior Algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7353049)