A hybrid stochastic interpolation and compression method for kernel matrices
From MaRDI portal
Publication:6087910
DOI10.1016/j.jcp.2023.112491OpenAlexW4386629841MaRDI QIDQ6087910
Publication date: 16 November 2023
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2023.112491
randomized algorithmhybrid methodmatrix approximationpolyharmonic spline interpolationfast kernel compressing
Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Numerical linear algebra (65Fxx) Numerical methods for partial differential equations, boundary value problems (65Nxx)
Cites Work
- Unnamed Item
- Unnamed Item
- A treecode-accelerated boundary integral Poisson-Boltzmann solver for electrostatics of solvated biomolecules
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
- A randomized algorithm for the decomposition of matrices
- A heterogeneous FMM for layered media Helmholtz equation. I: Two layers in \(\mathbb{R}^2\)
- Accurate and efficient Nyström volume integral equation method for the Maxwell equations for multiple 3-D scatterers
- A fast adaptive solver for hierarchically semiseparable representations
- On selecting a maximum volume sub-matrix of a matrix and related problems
- 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
- Construction and arithmetics of \(\mathcal H\)-matrices
- Approximation of boundary element matrices
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- Geometric structure guided model and algorithms for complete deconvolution of gene expression data
- An insight into RBF-FD approximations augmented with polynomials
- A unified framework for oscillatory integral transforms: when to use NUFFT or butterfly factorization?
- An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- Fast random algorithms for manifold based optimization in reconstructing 3D chromosomal structures
- Fast algorithms for hierarchically semiseparable matrices
- Fast Evaluation of Multiquadric RBF Sums by a Cartesian Treecode
- A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
- Extensions of Lipschitz mappings into a Hilbert space
- Relative-Error $CUR$ Matrix Decompositions
- An Implementation of the Fast Multipole Method without Multipoles
- Generalized Gaussian Quadratures and Singular Value Decompositions of Integral Operators
- The Fast Multipole Method I: Error Analysis and Asymptotic Complexity
- Accurate and Efficient Nyström Volume Integral Equation Method for Electromagnetic Scattering of 3-D Metamaterials in Layered Media
- A Generalized Fast Multipole Method for Nonoscillatory Kernels
- A distributed kernel summation framework for general‐dimension machine learning
- A Kernel-Independent Treecode Based on Barycentric Lagrange Interpolation
- Fast Low-Rank Kernel Matrix Factorization Using Skeletonized Interpolation
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Hierarchical matrix techniques for low- and high-frequency Helmholtz problems
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- Compressing Rank-Structured Matrices via Randomized Sampling
- A fast algorithm for particle simulations
This page was built for publication: A hybrid stochastic interpolation and compression method for kernel matrices