Steffen Börm
Abstract
Standard discretization techniques for boundary integral equations, e.g., the Galerkin boundary element method, lead to large densely populated matrices that require fast and efficient compression techniques like the fast multipole method or hierarchical matrices. If the underlying mesh is very large, running the corresponding algorithms on a distributed computer is attractive, e.g., since distributed computers frequently are cost-effective and offer a high accumulated memory bandwidth.
Compared to the closely related particle methods, for which distributed algorithms are well-established, the Galerkin discretization poses a challenge, since the supports of the basis functions influence the block structure of the matrix and therefore the flow of data in the corresponding algorithms. This article introduces distributed ℋ2-matrices, a class of hierarchical matrices that is closely related to fast multipole methods and particularly well-suited for distributed computing. While earlier efforts required the global tree structure of the ℋ2-matrix to be stored in every node of the distributed system, the new approach needs only local multilevel information that can be obtained via a simple distributed algorithm, allowing us to scale to significantly larger systems. Experiments show that this approach can handle very large meshes with more than 130 million triangles efficiently.
- [1] . 1992. An implementation of the fast multipole method without multipoles. SIAM Journal on Scientific and Statistical Computing 13 (1992), 923–947.Google Scholar
Digital Library
- [2] . 2000. Approximation of boundary element matrices. Numerische Mathematik 86, 4 (2000), 565–589.Google ScholarCross Ref
- [3] . 2008. Hierarchical Matrices: A Means to Efficiently Solve Elliptic Boundary Value Problems. Springer.Google ScholarDigital Library
- [4] . 2005. Fast parallel solution of boundary integral equations and related problems. Computing and Visualization in Science 8 (2005), 121–135.Google ScholarDigital Library
- [5] . 2003. Adaptive low-rank approximation of collocation matrices. Computing 70, 1 (2003), 1–24.Google ScholarDigital Library
- [6] . 2008. Distributed \({\mathcal {H}}^2\)-matrices for non-local operators. Computing and Visualization in Science 11 (2008), 237–249.Google ScholarCross Ref
- [7] . 2010. Efficient Numerical Methods for Non-local Operators: \({\mathcal {H}}^2\)-Matrix Compression, Algorithms, and Analysis.
EMS Tracts in Mathematics Google ScholarCross Ref - [8] . 2016. Approximation of integral operators by Green quadrature and nested cross approximation. Numerische Mathematik 133, 3 (2016), 409–442.Google ScholarDigital Library
- [9] . 2013. Low-rank approximation of integral operators by using the Green formula and quadrature. Numerical Algorithms 64, 3 (2013), 567–592. Retrieved from Google ScholarDigital Library
- [10] . 2004. Low-rank approximation of integral operators by interpolation. Computing 72 (2004), 325–332.Google ScholarDigital Library
- [11] . 2002. Data-sparse approximation by adaptive \({\mathcal {H}}^2\)-matrices. Computing 69 (2002), 1–35.Google ScholarDigital Library
- [12] . 2002. \({\mathcal {H}}^2\)-matrix approximation of integral operators by interpolation. Applied Numerical Mathematics 43 (2002), 129–143.Google ScholarDigital Library
- [13] . 2005. Hierarchical quadrature of singular integrals. Computing 74 (2005), 75–100.Google ScholarDigital Library
- [14] . 2005. Approximation of integral operators by variable-order interpolation. Numerische Mathematik 99, 4 (2005), 605–643.Google ScholarDigital Library
- [15] . 2005. BEM with linear complexity for the classical boundary integral operators. Mathematics of Computation 74 (2005), 1139–1177.Google ScholarCross Ref
- [16] . 2006. Compression techniques for boundary integral equations — Asymptotically optimal complexity estimates. SIAM Journal on Numerical Analysis 43, 6 (2006), 2251–2271.Google ScholarDigital Library
- [17] . 1994. Wavelet approximation methods for pseudodifferential equations I: Stability and convergence. Mathematische Zeitschrift 215 (1994), 583–620.Google ScholarCross Ref
- [18] . 1999. Wavelets on manifolds I: Construction and domain decomposition. SIAM Journal on Mathematical Analysis 31 (1999), 184–230.Google ScholarCross Ref
- [19] . 1998. Efficient automatic quadrature in 3-d Galerkin BEM. Computer Methods in Applied Mechanics and Engineering 157 (1998), 215–224.Google ScholarCross Ref
- [20] . 2016. Existence of \({\mathcal {H}}\)-matrix approximants to the inverses of BEM matrices: The simple-layer operator. Mathematics of Computation 85 (2016), 119–152.Google ScholarCross Ref
- [21] . 1996. Polynomial-based Iteration Methods for Symmetric Linear Systems. Vieweg+Teubner.Google ScholarCross Ref
- [22] . 2001. Multilevel approximation of boundary integral operators. Computing 67 (2001), 183–207.Google ScholarDigital Library
- [23] . 2002. A generalized fast multipole method for nonoscillatory kernels. SIAM Journal on Scientific Computing 24, 3 (2002), 796–817.Google ScholarDigital Library
- [24] . 1990. A parallel version of the fast multipole method. Computers and Mathematics with Applications 20, 7 (1990), 63–71.Google ScholarCross Ref
- [25] . 1987. A fast algorithm for particle simulations. Journal of Computational Physics 73 (1987), 325–348.Google ScholarDigital Library
- [26] . 1994. Iterative Solution of Large Sparse Systems. Springer-Verlag New York.Google ScholarCross Ref
- [27] . 1999. A sparse matrix arithmetic based on \(\mathcal {H}\)-Matrices. Part I: Introduction to \(\mathcal {H}\)-Matrices. Computing 62, 2 (1999), 89–108.Google ScholarDigital Library
- [28] . 2015. Hierarchical Matrices: Algorithms and Analysis. Springer.Google ScholarCross Ref
- [29] . 2000. On \(\mathcal {H}^2\)-Matrices. In Proceedings of the Lectures on Applied Mathematics. , , and (Eds.), Springer-Verlag, Berlin, 9–29.Google ScholarCross Ref
- [30] . 1989. On the fast matrix multiplication in the boundary element method by panel clustering. Numerische Mathematik 54, 4 (1989), 463–491.Google ScholarDigital Library
- [31] . 2006. Wavelet Galerkin schemes for boundary integral equations – Implementation and quadrature. SIAM Journal on Scientific Computing 27 (2006), 1347–1370.Google ScholarDigital Library
- [32] . 2003. Efficient preconditioners for boundary element matrices based on grey-box algebraic multigrid methods. International Journal for Numerical Methods in Engineering 58, 13 (2003), 1937–1953.Google ScholarCross Ref
- [33] . 2012. A massively parallel adaptive fast multipole method on heterogeneous architectures. Communications of the ACM 55, 5 (2012), 101–109.Google ScholarDigital Library
- [34] . 2020. High Performance Evaluation of Helmholtz Potentials using the Multi-Level Fast Multipole Algorithm.
Technical Report .Google Scholar - [35] . 2015. A parallel fast boundary element method using cyclic graph decompositions. Numerical Algorithms 70 (2015), 807–824.Google ScholarDigital Library
- [36] . 2014. Petascale molecular dynamics simulation using the fast multipole method on K computer. Computer Physics Communications 185, 10 (2014), 2575–2585.Google ScholarCross Ref
- [37] . 1985. Rapid solution of integral equations of classical potential theory. Journal of Computational Physics 60 (1985), 187–207.Google ScholarCross Ref
- [38] . 2003. Iterative Methods for Sparse Linear Systems (2nd. Ed.). Society for Industrial Mathematics.Google ScholarDigital Library
- [39] . 1996. Cubature techniques for 3-d Galerkin BEM. In Proceedings of the Boundary Elements: Implementation and Analysis of Advanced Algorithms. and (Eds.), Vieweg-Verlag, 29–44.Google ScholarCross Ref
- [40] . 2000. Variable order panel clustering. Computing 64 (2000), 223–261.Google ScholarDigital Library
- [41] . 2011. Boundary Element Methods. Springer.Google ScholarCross Ref
- [42] . 1998. The construction of some efficient preconditioners in the boundary element method. Advances in Computational Mathematics 9 (1998), 191–216.Google ScholarCross Ref
- [43] . 2004. A variable order wavelet method for the sparse representation of layer potentials in the non-standard form. J. Journal of Numerical Mathematics 12, 3 (2004), 233–254.Google ScholarCross Ref
- [44] . 2000. Incomplete cross approximation in the mosaic-skeleton method. Computing 64 (2000), 367–380.Google ScholarDigital Library
- [45] . 1992. Multigrid solvers and preconditioners for first kind integral equations. Numerical Methods for Partial Differential Equations 8, 5 (1992), 443–450.Google ScholarCross Ref
- [46] . 1992. Astrophysical N-body simulations using hierarchical tree data structures. In Proceedings of the 1992 ACM/IEEE Conference on Supercomputing. (Ed.), 570–576.Google ScholarDigital Library
Index Terms
- Distributed ℋ2-Matrices for Boundary Element Methods
Recommendations
A new fast direct solver for the boundary element method
A new fast direct linear equation solver for the boundary element method (BEM) is presented in this paper. The idea of the new fast direct solver stems from the concept of the hierarchical off-diagonal low-rank matrix. The hierarchical off-diagonal low-...
Automatic coupling of a boundary element code with a commercial finite element system
An automatic procedure for the coupling of a linear elastic three dimensional boundary element code with a commercial finite element system is presented. Each closed BE domain in the mixed FEM/BEM model is defined as a finite macro element for which a ...
Distributed-memory lattice H -matrix factorization
We parallelize the LU factorization of a hierarchical low-rank matrix ( H -matrix) on a distributed-memory computer. This is much more difficult than the H -matrix-vector multiplication due to the dataflow of the factorization, and it is much harder than the ...
Comments