An arbitrary Lagrangian-Eulerian semi-implicit hybrid method for continuum mechanics with GLM cleaning

Saray Busto

Home/Archive/arXiv

arXiv · 2512.03741

An arbitrary Lagrangian-Eulerian semi-implicit hybrid method for continuum mechanics with GLM cleaning

Saray Busto

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper proposes a semi-implicit arbitrary Lagrangian-Eulerian (ALE) method for the solution of the unified Godunov-Peshkov-Romenski (GPR) model of continuum mechanics. To handle the curl free involutions arising in the solid limit of the model, the original system is augmented by adopting a thermodynamically compatible generalized Lagrangian multiplier (GLM) approach. Next, an operator splitting strategy decouples the computation of fast pressure waves from the bulk velocity of the medium yielding a transport subsystem, containing convective terms and non-conservative products, and a Poisson-type subsystem, for the pressure. A second splitting yields an ODE subsystem comprising only the potentially stiff source terms, responsible for the relaxation of the model between its fluid and solid limits. The mesh motion can be driven by two sources: the local fluid velocity and a prescribed boundary displacement. For the spatial discretization, we employ unstructured staggered grids, with the pressure defined on the primal mesh and all remaining variables on the dual grid. The transport subsystem is advanced via an explicit finite volume method, in which integration over closed space-time control volumes ensures verification of the geometric conservation law (GCL). On the other hand, implicit continuous finite elements are used for the discretization of the pressure subsystem and an implicit DIRK scheme is employed to solve the ODE subsystem. Consequently, the proposed approach is well suited to address all Mach number flows. A comprehensive set of benchmarks is employed to assess the accuracy and robustness of the proposed methodology in tackling both fluid and solid mechanics problems.

Explore related subjects

math.NA cs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Saray Busto. 2025-12-03. An arbitrary Lagrangian-Eulerian semi-implicit hybrid method for continuum mechanics with GLM cleaning. https://arxiv.org/abs/2512.03741

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

KEEP EXPLORING

Related papers

arXiv2026

The Stability of Block Eliminations and Additive Modifications

The block elimination with additive modifications (BEAM) method was recently proposed as a alternative to LU with partial pivoting requiring less communication. Because of the novelty of BEAM, the existing theoretical analysis is lacking. To that end, we analyze both the numerical stability of the underlying block LU factorization and the effects of additive modifications. For the block LU factorization, we are able to improve the previous results of Demmel et al. from being cubic in the element growth to merely quadratic. Furthermore, we propose an alternative measure of element growth that is better aligned with block LU; this new measure of growth allows our analysis to apply to matrices that cannot be factored with pointwise LU. In the second part, we analyzed the modifications produced by BEAM and the effect they have on the condition number and growth factor. Finally, we show that BEAM will not apply any modifications in some cases that regular block LU can safely factor.

math.NA↗

arXiv2026

Efficient Rigorous Continuation via Chebyshev Series Expansion I

We study the global continuation of solution manifolds arising in dynamical systems. We present a rigorous continuation method based on a Chebyshev series expansion of the solution manifold. The branch is first approximated by a high-order Chebyshev interpolation polynomial, and an explicit error bound is then obtained by verifying the contraction of a quasi-Newton operator near this approximation. The contraction is formulated on a weighted $\ell^1$ space, giving a finer control than the typical $C^0$-error bound obtained from the uniform contraction theorem. In fact, the latter follows directly from our contraction operator. Furthermore, we discuss how our strategy applies naturally to pseudo-arclength continuation, where the continuation parameter fails to provide a valid local coordinate, and extends to multi-parameter continuation. Lastly, we detail two applications in which we compute a two-parameter family of steady-states for the Cahn--Hilliard equation, and a one-parameter family of steady-states undergoing saddle-node bifurcations for the Shigesada--Kawasaki--Teramoto system.

math.NA↗

arXiv2026

Efficient iterative techniques for solving tensor problems with the T-product

This paper develops two efficient iterative methods for solving tensor equations under the T-product framework. For T-symmetric positive definite tensor equations of the form $\mathcal{C} \star \mathcal{X} = \mathcal{D}$, we propose a conjugate-gradient-type algorithm that generates orthogonal residual and $\mathcal{C}$-orthogonal direction sequences, ensuring convergence within a finite number of steps. For general consistent tensor equations, we extend the method using a normal-equation transformation, and further adapt it to handle inconsistent systems by solving a least-squares minimization problem. Key advantages include direct tensor-based computations without explicit matrix expansion, rigorous finite-step convergence proofs, and the ability to obtain minimal Frobenius norm solutions. Numerical experiments on synthetic data, benchmark images, and video sequences demonstrate that the proposed algorithms achieve high precision with low computational time, confirming their practicality for large-scale multidimensional problems.

math.NA↗