Kernel-independent adaptive construction of \(\mathcal{H}^2\)-matrix approximations

DOI10.1007/s00211-021-01255-yOpenAlexW3033352716WikidataQ114231024 ScholiaQ114231024MaRDI QIDQ2068355

B. Feist, M. Bauer, Mario Bebendorf

Publication date: 19 January 2022

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.01556

zbMATH Keywords

matrix approximationadaptive construction\(\mathcal{H}^2\) matrices

Mathematics Subject Classification ID

Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42B10) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Interpolation in approximation theory (41A05) Algorithms for approximation of functions (65D15) Boundary element methods for boundary value problems involving PDEs (65N38) Harmonic analysis and PDEs (42B37) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Related Items

Fast Deterministic Approximation of Symmetric Indefinite Kernel Matrices with High Dimensional Datasets ⋮ Finite element discretizations for variable-order fractional diffusion problems ⋮ Fractional elliptic problems on Lipschitz domains: regularity and approximation

Uses Software

• hlib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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.
• Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
• Rapid solution of integral equations of classical potential theory
• Bounds on multivariate polynomials and exponential error estimates for multiquadric interpolation
• A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
• Approximation of boundary element matrices
• Approximate range searching
• Approximation of integral operators by variable-order interpolation
• A fast adaptive multipole algorithm in three dimensions
• A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
• Wideband nested cross approximation for Helmholtz problems
• Comparison of fast boundary element methods on parametric surfaces
• Hybrid cross approximation of integral operators
• Hierarchical Matrices: Algorithms and Analysis
• A Fractional Laplace Equation: Regularity of Solutions and Finite Element Approximations
• Stochastic Spectral Galerkin and Collocation Methods for PDEs with Random Coefficients: A Numerical Comparison
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme
• On the efficient computation of high-dimensional integrals and the approximation by exponential sums
• Radial Basis Functions
• Towards an Efficient Finite Element Method for the Integral Fractional Laplacian on Polygonal Domains
• Multivariate Interpolation and Conditionally Positive Definite Functions. II
• Scattered Data Approximation
• A fast algorithm for particle simulations

This page was built for publication: Kernel-independent adaptive construction of \(\mathcal{H}^2\)-matrix approximations