Abstract

In this work, we design an explicit time-stepping solver for the simulation of the incompressible turbulent flow through the combination of VMS methods and artificial compressibility. We evaluate the effect of the artificial compressibility on the accuracy of the explicit formulation for under-resolved LES simulations. A set of benchmarks have been solved, e.g., the 3D Taylor–Green vortex problem in turbulent regimes. The resulting method is proven to be an effective alternative to implicit methods in some application ranges (in terms of problem size and computational resources), providing comparable results with very low memory requirements. As an example, with the explicit approach, we are able to solve accurately the Taylor-Green vortex benchmark in a fine mesh with 5123cells on a 12 cores 64 GB ram machine.

Abstract

We examine a residual and matrix-free Jacobian formulation of compressible and nearly incompressible (v → 0.5) displacement-only linear isotropic elasticity with high-order hexahedral finite elements. A matrix-free p-multigrid method is combined with algebraic multigrid on the assembled sparse coarse grid matrix to provide an effective preconditioner. The software is verified with the method of manufactured solutions. We explore convergence to a predetermined L₂ error of 10^-4, 10^-5 and 10^-6 for the compressible case and 10^-4, 10^-5 for the nearly-incompressible cases, as the Poisson's ratio approaches 0.5, based upon grid resolution and polynomial order. We compare our results against results obtained from C3D20H mixed/hybrid element available in the commercial finite element software ABAQUS that is quadratic in displacement and linear in pressure. We determine, for the same problem size, that our matrix-free approach for displacement-only implementation is faster and more efficient for quadratic elements compared to the C3D20H element from ABAQUS that is specially designed to handle nearly-incompressible and incompressible elasticity problems. However, as we approach the near incompressibility limit, the number of Conjugate Gradient iterations required to achieve the desired solution increases significantly.