Interpolative decomposition via proxy points for kernel matrices
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1069612 (Why is no real title available?)
- scientific article; zbMATH DE number 1531793 (Why is no real title available?)
- A Fast ULV Decomposition Solver for Hierarchically Semiseparable Representations
- A Fourier-series-based kernel-independent fast multipole method
- A Generalized Fast Multipole Method for Nonoscillatory Kernels
- A fast direct solver for boundary integral equations in two dimensions
- A fast direct solver for quasi-periodic scattering problems
- A fast direct solver for structured linear systems by recursive skeletonization
- A kernel independent fast multipole algorithm for radial basis functions
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A theory of pseudoskeleton approximations
- ASKIT: approximate skeletonization kernel-independent treecode in high dimensions
- Adaptive low-rank approximation of collocation matrices
- An \(O(N)\) direct solver for integral equations on the plane
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- Analytical low-rank compression via proxy point selection
- Approximation of boundary element matrices
- Butterfly factorization
- Computing multivariate Fekete and Leja points by numerical linear algebra
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Directional \(\mathcal{H}^2\)-matrix compression for high-frequency problems.
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Fast Directional Multilevel Algorithms for Oscillatory Kernels
- Fast Low-Rank Kernel Matrix Factorization Using Skeletonized Interpolation
- Fast directional algorithms for the Helmholtz kernel
- Fast spatial Gaussian process maximum likelihood estimation via skeletonization factorizations
- Interpolation Processes
- Literature survey on low rank approximation of matrices
- On the Compression of Low Rank Matrices
- SMASH: structured matrix approximation by separation and hierarchy.
- Tensor product Gauss-Lobatto points are Fekete points for the cube
- The black-box fast multipole method
- Wideband nested cross approximation for Helmholtz problems
Cited in
(14)- A parametrix method for elliptic surface PDEs
- FMM-LU: A Fast Direct Solver for Multiscale Boundary Integral Equations in Three Dimensions
- A hierarchical matrix approach for computing hydrodynamic interactions
- Error analysis of an accelerated interpolative decomposition for 3D Laplace problems
- A simplified fast multipole method based on strong recursive skeletonization
- Efficient Construction of an HSS Preconditioner for Symmetric Positive Definite $\mathcal{H}^2$ Matrices
- Structured matrices, reproducing kernels and interpolation
- A fast direct solver for boundary integral equations using quadrature by expansion
- Parallel Skeletonization for Integral Equations in Evolving Multiply-Connected Domains
- Randomized approximate class-specific kernel spectral regression analysis for large-scale face verification
- Analytical low-rank compression via proxy point selection
- A hybrid stochastic interpolation and compression method for kernel matrices
- 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
This page was built for publication: Interpolative decomposition via proxy points for kernel matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5217103)
