A hybrid stochastic interpolation and compression method for kernel matrices (Q6087910)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

A hybrid stochastic interpolation and compression method for kernel matrices

scientific article; zbMATH DE number 7766213

Language	Label	Description	Also known as
default for all languages	No label defined
English	A hybrid stochastic interpolation and compression method for kernel matrices	scientific article; zbMATH DE number 7766213

Statements

instance of

scholarly article

0 references

title

A hybrid stochastic interpolation and compression method for kernel matrices (English)

0 references

author

Duan Chen

0 references

published in

Journal of Computational Physics

0 references

publication date

16 November 2023

0 references

zbMATH Keywords

fast kernel compressing

0 references

randomized algorithm

0 references

matrix approximation

0 references

polyharmonic spline interpolation

0 references

hybrid method

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.jcp.2023.112491

0 references

cites work

Accurate and efficient Nyström volume integral equation method for the Maxwell equations for multiple 3-D scatterers

0 references

Accurate and efficient Nyström volume integral equation method for electromagnetic scattering of 3-D metamaterials in layered media

0 references

Fast random algorithms for manifold based optimization in reconstructing 3D chromosomal structures

0 references

Geometric structure guided model and algorithms for complete deconvolution of gene expression data

0 references

A fast algorithm for particle simulations

0 references

A sparse matrix arithmetic based on ${\mathfrak H}$-matrices. I: Introduction to ${\mathfrak H}$-matrices

0 references

A sparse ${\mathcal H}$-matrix arithmetic. II: Application to multi-dimensional problems

0 references

Construction and arithmetics of $\mathcal H$-matrices

0 references

Efficient numerical methods for non-local operators. $\mathcal H^2$-matrix compression, algorithms and analysis.

0 references

Data-sparse approximation by adaptive ${\mathcal H}^2$-matrices

0 references

Fast algorithms for hierarchically semiseparable matrices

0 references

A fast adaptive solver for hierarchically semiseparable representations

0 references

A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations

0 references

Relative-Error $CUR$ Matrix Decompositions

0 references

The Fast Multipole Method I: Error Analysis and Asymptotic Complexity

0 references

A Generalized Fast Multipole Method for Nonoscillatory Kernels

0 references

A treecode-accelerated boundary integral Poisson-Boltzmann solver for electrostatics of solvated biomolecules

0 references

Fast evaluation of multiquadric RBF sums by a Cartesian treecode

0 references

A heterogeneous FMM for layered media Helmholtz equation. I: Two layers in $\mathbb{R}^2$

0 references

An $\mathcal O(N\log N)$ fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation

0 references

An Implementation of the Fast Multipole Method without Multipoles

0 references

Generalized Gaussian Quadratures and Singular Value Decompositions of Integral Operators

0 references

A kernel-independent adaptive fast multipole algorithm in two and three dimensions

0 references

The black-box fast multipole method

0 references

A kernel-independent treecode based on barycentric Lagrange interpolation

0 references

A unified framework for oscillatory integral transforms: when to use NUFFT or butterfly factorization?

0 references

A distributed kernel summation framework for general‐dimension machine learning

0 references

A randomized algorithm for the decomposition of matrices

0 references

A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix

0 references

Compressing Rank-Structured Matrices via Randomized Sampling

0 references

Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication

0 references

Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix

0 references

Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition

0 references

Extensions of Lipschitz mappings into a Hilbert space

0 references

Approximation of boundary element matrices

0 references

Hierarchical matrix techniques for low- and high-frequency Helmholtz problems

0 references

A theory of pseudoskeleton approximations

0 references

On selecting a maximum volume sub-matrix of a matrix and related problems

0 references

How to find a good submatrix

0 references

The maximal-volume concept in approximation by low-rank matrices

0 references

Adaptive low-rank approximation of collocation matrices

0 references

Fast Low-Rank Kernel Matrix Factorization Using Skeletonized Interpolation

0 references

An $O(N \log N)$ hierarchical random compression method for kernel matrices by sampling partial matrix entries

0 references

An insight into RBF-FD approximations augmented with polynomials

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1016/J.JCP.2023.112491

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6087910