Search arXivSearch

arXiv · 2407.00823

Semi-implicit hybrid finite volume/finite element method for the GPR model of continuum mechanics

Abstract

We present a new hybrid semi-implicit finite volume / finite element numerical scheme for the solution of incompressible and weakly compressible media. From the continuum mechanics model proposed by Godunov, Peshkov and Romenski (GPR), we derive the incompressible GPR formulation as well as a weakly compressible GPR system. As for the original GPR model, the new formulations are able to describe different media, from elastoplastic solids to viscous fluids, depending on the values set for the model's relaxation parameters. Then, we propose a new numerical method for the solution of both models based on the splitting of the original systems into three subsystems: one containing the convective part and non-conservative products, a second subsystem for the source terms of the distortion tensor and heat flux equations and, finally, a pressure subsystem. In the first stage of the algorithm, the transport subsystem is solved by employing an explicit finite volume method, while the source terms are solved implicitly. Next, the pressure subsystem is implicitly discretised using finite elements. Within this methodology, unstructured grids are employed, with the pressure defined in the primal grid and the rest of the variables computed in the dual grid. To evaluate the performance of the proposed scheme, a numerical convergence analysis is carried out, which confirms the second order of accuracy in space. A wide range of benchmarks is reproduced for the incompressible and weakly compressible cases, considering both solid and fluid media. These results demonstrate the good behaviour and robustness of the proposed scheme in a variety of scenarios and conditions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Saray Busto, Laura Río-Martín. 2024-06-30. Semi-implicit hybrid finite volume/finite element method for the GPR model of continuum mechanics. https://doi.org/10.1007/s10915-024-02770-4

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

KEEP EXPLORING

Related papers

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

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

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