arXiv subjects

Cedric Riethmüller

Publications and source records attributed to Cedric Riethmüller.

6 recordsLinked to original sources

arXiv2026

Thermodynamically consistent phase-field modeling and numerical simulation for reactive two-phase fluid-solid dynamics

We introduce a coupled Cahn-Hilliard Navier-Stokes model that governs the reactive two-phase dynamics of a system that consists of a fluid and a solid phase and prove its thermodynamic consistency. Moreover, we present an associated fully-discrete numerical method that relies on a continuous finite element approach and a semi-implicit time-stepping method. Our main theoretical result establishes that the fully discrete method satisfies an analog of the free energy dissipation inequality, provided that the phase-field variable remains within prescribed bounds. Numerical experiments confirm the theoretical findings and show the applicability of the method for realistic settings. In this context, we provide a preprocessing strategy that enables computing fluid flow in complex geometries given a sharp-interface formulation of the initial phase distribution. Moreover, we briefly introduce different solution strategies for the novel discretization based on the monolithic and partitioned solution paradigms and assess these in a comparative study.

math.NA↗

arXiv2026

Data-driven geometric parameter optimization for PD-GMRES

Restarted GMRES is a robust and widely used iterative solver for linear systems. The control of the restart parameter is a key task to accelerate convergence and to prevent the well-known stagnation phenomenon. We focus on the Proportional-Derivative GMRES (PD-GMRES), which has been derived using control-theoretic ideas in [Cuevas Núñez, Schaerer, and Bhaya (2018)] as a versatile method for modifying the restart parameter. Several variants of a quadtree-based geometric optimization approach are proposed to find a best choice of PD-GMRES parameters. We show that the optimized PD-GMRES performs well across a large number of matrix types and we observe superior performance as compared to major other GMRES-based iterative solvers. Moreover, we propose an extension of the PD-GMRES algorithm to further improve performance by controlling the range of values for the restart parameter.

math.NA↗

arXiv2026

On the convergence and efficiency of splitting schemes for the Cahn-Hilliard-Biot model

In this paper, we present a novel solution strategy for the Cahn-Hilliard-Biot model, a three-way coupled system that features the interplay of solid phase separation, fluid dynamics, and elastic deformations in porous media. It is a phase-field model that combines the Cahn-Hilliard regularized interface equation and Biot's equations of poroelasticity. Solving the system poses significant challenges due to its coupled, nonlinear, and non-convex nature. The main goal of this work is to provide a consistent and efficient solution strategy. With this in mind, we introduce a semi-implicit time discretization such that the resulting discrete system is equivalent to a convex minimization problem. Then, using abstract theory for convex problems, we prove the convergence of an alternating minimization method to the time-discrete system. The solution strategy is relatively flexible in terms of spatial discretization, although we require standard inverse inequalities for the guaranteed convergence of the alternating minimization method. Finally, we perform some numerical experiments that show the promise of the proposed solution strategy, both in terms of efficiency and robustness.

math.NA↗

arXiv2024

Well-posedness analysis of the Cahn-Hilliard-Biot model

We investigate the well-posedness of the recently proposed Cahn-Hilliard-Biot model. The model is a three-way coupled PDE of elliptic-parabolic nature, with several nonlinearities and the fourth order term known to the Cahn-Hilliard system. We show existence of weak solutions to the variational form of the equations and uniqueness under certain conditions of the material parameters and secondary consolidation, adding regularizing effects. Existence is shown by discretizing in space and applying ODE-theory (the Peano-Cauchy theorem) to prove existence of the discrete system, followed by compactness arguments to retain solutions of the continuous system. In addition, the continuous dependence of solutions on the data is established, in particular implying uniqueness. Both results build strongly on the inherent gradient flow structure of the model.

math.AP↗

arXiv2024

Sequential solution strategies for the Cahn-Hilliard-Biot model

This paper presents a study of solution strategies for the Cahn-Hilliard-Biot equations, a complex mathematical model for understanding flow in deformable porous media with changing solid phases. Solving the Cahn-Hilliard-Biot system poses significant challenges due to its coupled, nonlinear and non-convex nature. We explore various solution algorithms, comparing monolithic and splitting strategies, focusing on both their computational efficiency and robustness.

math.NA↗

arXiv2021

Partitioned Coupling vs. Monolithic Block-Preconditioning Approaches for Solving Stokes-Darcy Systems

We consider the time-dependent Stokes-Darcy problem as a model case for the challenges involved in solving coupled systems. Keeping the model, its discretization, and the underlying numerics for the subproblems in the free-flow domain and the porous medium constant, we focus on different solver approaches for the coupled problem. We compare a partitioned coupling approach using the coupling library preCICE with a monolithic block-preconditioned one that is tailored to different formulations of the problem. Both approaches enable the reuse of already available iterative solvers and preconditioners, in our case, from the DuMux framework. Our results indicate that the approaches can yield performance and scalability improvements compared to using direct solvers: Partitioned coupling is able to solve large problems faster if iterative solvers with suitable preconditioners are applied for the subproblems. The monolithic approach shows even stronger requirements on preconditioning, as standard simple solvers fail to converge. Our monolithic block preconditioning yields the fastest runtimes for large systems, but they vary strongly with the preconditioner configuration. Interestingly, using a specialized Uzawa preconditioner for the Stokes subsystem leads to overall increased runtimes compared to block preconditioners utilizing a more general algebraic multigrid. This highlights that optimizing for the non-coupled cases does not always pay off.

math.NA↗