Low-rank approximation of integral operators by using the Green formula and quadrature
From MaRDI portal
Publication:383524
DOI10.1007/s11075-012-9679-2zbMath1329.65314MaRDI QIDQ383524
Publication date: 4 December 2013
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://nbn-resolving.org/urn:nbn:de:101:1-2012061511342
65R20: Numerical methods for integral equations
45P05: Integral operators
41A63: Multidimensional problems
65D30: Numerical integration
Related Items
Uses Software
Cites Work
- 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.
- On the fast matrix multiplication in the boundary element method by panel clustering
- Pseudo-skeleton approximations by matrices of maximal volume
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Yet another fast multipole method without multipoles -- pseudoparticle multipole method
- A theory of pseudoskeleton approximations
- Adaptive low-rank approximation of collocation matrices
- Introduction to hierarchical matrices with applications.
- Incomplete cross approximation in the mosaic-skeleton method
- Approximation of boundary element matrices
- A fast direct solver for boundary integral equations in two dimensions
- Low-rank approximation of integral operators by interpolation
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- Hybrid cross approximation of integral operators
- Hierarchische Matrizen
- Fast direct solvers for integral equations in complex three-dimensional domains
- An Implementation of the Fast Multipole Method without Multipoles
- Wavelets on Manifolds I: Construction and Domain Decomposition
- On the Compression of Low Rank Matrices
- A fast algorithm for particle simulations
