Search arXivSearch

arXiv · 2607.25871

Multi-Solver Coupling for Parallel Adaptive Multi-Physics Simulations with Trixi$.$jl and deal$.$II

Abstract

Many standalone frameworks for numerical solvers have been developed to tackle the simulation of specific single- or multi-physics problems. For solving coupled problems, common approaches are to extend existing solvers, to develop an entirely new solver or to couple two existing solvers by using the interface provided by a coupling library or framework. However, to the best of our knowledge, there is not yet a framework that allows the easy and direct development of coupled solvers. In this work, we prototype a portable reproducible cross-language framework for the development of coupled parallel adaptive solvers using Trixi$.$jl and deal$.$II for the numerical simulation of coupled multi-physics problems. Currently, this is tightly entangled with an example coupled solver. We show its usability by developing a partitioned strongly-coupled multi-physics solver for the dynamics of Newtonian self-gravitational gases. For the coupled solver, we validate the expected order of convergence, physical sensibility of the results and mesh adaptivity. Finally, we investigate its parallel scaling. A publicly accessible reproducibility repository for the numerical results and code is available.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vivienne Ehlert, Gregor Gassner, Martin Kronbichler, Hendrik Ranocha, Michael Schlottke-Lakemper. 2026-07-28. Multi-Solver Coupling for Parallel Adaptive Multi-Physics Simulations with Trixi$.$jl and deal$.$II. https://arxiv.org/abs/2607.25871

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Structure-Aware Analyses and Algorithms for Interpolative Decompositions

Low-rank approximation is a task of critical importance in modern science, engineering, and statistics. Many low-rank approximation algorithms, such as the randomized singular value decomposition (RSVD), project their input matrix into a subspace approximating the span of its leading singular vectors. Other algorithms compress their input into a small subset of representative rows or columns, leading to a so-called interpolative decomposition. This paper investigates how the accuracy of interpolative decompositions is affected by the structural properties of the input matrix being operated on, including how these properties affect the performance comparison between interpolative decompositions and RSVD. We give particular focus to a randomized Golub-Klema-Stewart (RGKS) algorithm, an interpolative decomposition algorithm which combines RSVD with the Golub-Klema-Stewart (GKS) pivoting strategy. Through numerical experiments, we find that matrix structures including singular subspace geometry and singular spectrum decay play a significant role in determining the performance comparison between these different algorithms. We also prove inequalities which bound the error of a general interpolative decomposition in terms of these matrix structures. Finally, we develop forms of these bounds specialized to RGKS while considering how randomization affects the approximation error of this algorithm.

math.NA

Integral equations for flexural-gravity waves: analysis and numerical methods

In this work, we develop a fast and accurate method for the scattering of flexural-gravity waves by a thin plate of varying thickness overlying a fluid of infinite depth. This problem commonly arises in the study of sea ice and ice shelves, which can have complicated heterogeneities that include ridges and rolls. With certain natural assumptions on the thickness, we present an integral equation formulation for solving this class of problems and analyze its mathematical properties. The integral equation is then discretized and solved using a high-order-accurate, FFT-accelerated algorithm. The speed, accuracy, and scalability of this approach are demonstrated through a variety of illustrative examples.

math.NA

Maximum bound principle for Q-tensor gradient flow with low regularity integrators

The Landau-de Gennes (LdG) theory is a widely used thermodynamic continuum framework for modeling the behavior of ordered states and defects in liquid crystals with a tensor-order parameter $Q$. In this study, we develop and analyze first- and second-order low-regularity integrator (LRI) schemes for the $Q$-tensor gradient flow and prove the maximum bound principle. In particular, through the reformulation of the LRI schemes, we establish rigorous modified energy dissipation laws for the LRI1a and LRI1b schemes, thereby filling a significant theoretical gap in the existing literature on LRI methods. Moreover, this reformulation establishes a structural bridge between the LRI schemes and backward differentiation formula (BDF) methods, which opens up new possibilities for the construction and analysis of LRI-type methods. We then establish first- and second-order temporal convergence under $H^1$ and $H^2$ regularity assumptions, respectively. Several numerical experiments are presented to validate our theoretical results and to simulate the evolution of defect dynamics.

math.NA