Interpolative Decomposition via Proxy Points for Kernel Matrices
From MaRDI portal
Publication:5217103
DOI10.1137/19M1258700zbMath1432.65052OpenAlexW3003406543MaRDI QIDQ5217103
Publication date: 21 February 2020
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m1258700
low-rank approximationkernel matrixinterpolative decompositionrank-structured matrixproxy point method
Related Items
A hierarchical matrix approach for computing hydrodynamic interactions, Randomized approximate class-specific kernel spectral regression analysis for large-scale face verification, FMM-LU: A Fast Direct Solver for Multiscale Boundary Integral Equations in Three Dimensions, A GPU-accelerated fast multipole method based on barycentric Lagrange interpolation and dual tree traversal, Fast Coulomb Matrix Construction via Compressing the Interactions Between Continuous Charge Distributions, Efficient Construction of an HSS Preconditioner for Symmetric Positive Definite $\mathcal{H}^2$ Matrices, Parallel Skeletonization for Integral Equations in Evolving Multiply-Connected Domains
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A fast direct solver for quasi-periodic scattering problems
- A Fourier-series-based kernel-independent fast multipole method
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- Fast directional algorithms for the Helmholtz kernel
- The black-box fast multipole method
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A theory of pseudoskeleton approximations
- Adaptive low-rank approximation of collocation matrices
- Approximation of boundary element matrices
- A fast direct solver for boundary integral equations in two dimensions
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- Wideband nested cross approximation for Helmholtz problems
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- A kernel independent fast multipole algorithm for radial basis functions
- An \(O(N)\) direct solver for integral equations on the plane
- Tensor product Gauss-Lobatto points are Fekete points for the cube
- Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra
- SMASH: Structured matrix approximation by separation and hierarchy
- Interpolation Processes
- Fast Directional Multilevel Algorithms for Oscillatory Kernels
- Directional ‐matrix compression for high‐frequency problems
- Fast Spatial Gaussian Process Maximum Likelihood Estimation via Skeletonization Factorizations
- Literature survey on low rank approximation of matrices
- A Generalized Fast Multipole Method for Nonoscillatory Kernels
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- A Fast Direct Solver for Structured Linear Systems by Recursive Skeletonization
- Analytical Low-Rank Compression via Proxy Point Selection
- Fast Low-Rank Kernel Matrix Factorization Using Skeletonized Interpolation
- ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions
- Butterfly Factorization
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- On the Compression of Low Rank Matrices
