A parallel fast boundary element method using cyclic graph decompositions
DOI10.1007/s11075-015-9974-9zbMath1332.65177OpenAlexW2020221222WikidataQ57985783 ScholiaQ57985783MaRDI QIDQ907583
Dalibor Lukáš, Michal Merta, Tereza Kovářová, Petr Kovář
Publication date: 25 January 2016
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-015-9974-9
complexityboundary element methodparallel computingLaplace equationnumerical experimentgraph decomposition
Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Parallel numerical computation (65Y05) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Boundary element methods for boundary value problems involving PDEs (65N38)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- Rapid solution of integral equations of classical potential theory
- On the fast matrix multiplication in the boundary element method by panel clustering
- Space-filling curves
- Quadrature for \(hp\)-Galerkin BEM in \(\mathbb{R}^3\)
- Approximation of boundary element matrices
- A shape optimization method for nonlinear axisymmetric magnetostatics using a coupling of finite and boundary elements
- The fast solution of boundary integral equations.
- Fast Multipole Methods and Applications
- Second-order shape optimization using wavelet BEM
- Quadrature Over a Pyramid or Cube of Integrands with a Singularity at a Vertex
- Multigrid solvers and preconditioners for first kind integral equations
- Parallel Hierarchical Solvers and Preconditioners for Boundary Element Methods
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Efficient partitioning of sequences
- Boundary Element Methods
This page was built for publication: A parallel fast boundary element method using cyclic graph decompositions