Optimal compression of kernel matrices by interpolets with application to high-dimensional approximation
From MaRDI portal
Cites work
- A fast algorithm for particle simulations
- Biorthogonal bases of compactly supported wavelets
- Compactly supported (bi)orthogonal wavelets generated by interpolatory refinable functions
- Compression Techniques for Boundary Integral Equations---Asymptotically Optimal Complexity Estimates
- Doubling the rate -- improved error bounds for orthogonal projection with application to numerical analysis
- Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification
- Hierarchical matrices: algorithms and analysis
- Kernel interpolation on generalized sparse grids
- Kernel techniques: From machine learning to meshless methods
- Multilevel preconditioning
- Multiscale analysis in Sobolev spaces on bounded domains
- Multiscale scattered data analysis in samplet coordinates
- Orthonormal bases of compactly supported wavelets
- Samplets: construction and scattered data compression
- Scattered Data Approximation
- Semi-regular Dubuc-Deslauriers wavelet tight frames
- Simple Regularity Criteria for Subdivision Schemes
- Superconvergence of kernel-based interpolation
- Support Vector Machines
- The lifting scheme: A custom-design construction of biorthogonal wavelets
- Wavelet Galerkin Schemes for Boundary Integral Equations---Implementation and Quadrature
This page was built for publication: Optimal compression of kernel matrices by interpolets with application to high-dimensional approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285007)