Alexandru Fikl

Florence Drui, Alexandru Fikl, Pierre Kestener et al.

Many physical problems involve spatial and temporal inhomogeneities that require a very fine discretization in order to be accurately simulated. Using an adaptive mesh, a high level of resolution is used in the appropriate areas while keeping a coarse mesh elsewhere. This idea allows to save time and computations, but represents a challenge for distributed-memory environments. The MARS project (for Multiphase Adaptative Refinement Solver) intends to assess the parallel library p4est for adaptive mesh, in a case of a finite volume scheme applied to two-phase flows. Besides testing the library's performances, particularly for load balancing, its user-friendliness in use and implementation are also exhibited here. First promising 3D simulations are even presented.

Alexandru Fikl, Andreas Klöckner

We construct and analyze a hierarchical direct solver for linear systems arising from the discretization of boundary integral equations using the Quadrature by Expansion (QBX) method. Our scheme builds on the existing theory of Hierarchical Semi-Separable (HSS) matrix operators that contain low-rank off-diagonal submatrices. We use proxy-based approximations of the far-field interactions and the Interpolative Decomposition (ID) to construct compressed HSS operators that are used as fast direct solvers for the original system. We describe a number of modifications to the standard HSS framework that enable compatibility with the QBX family of discretization methods. We establish an error model for the direct solver that is based on a multipole expansion of the QBX-mediated proxy interactions and standard estimates for the ID. Based on these theoretical results, we develop an automatic approach for setting scheme parameters based on user-provided error tolerances. The resulting solver seamlessly generalizes across two- and tree-dimensional problems and achieves state-of-the-art asymptotic scaling. We conclude with numerical experiments that support the theoretical expectations for the error and computational cost of the direct solver.