We propose here a displacement-based updated Lagrangian fluid model developed to facilitate a monolithic coupling with a wide range of structural elements described in terms of displacements. The novelty of the model consists in the use of the explicit streamline integration for predicting the end-of-step configuration of the fluid domain. It is shown that this prediction considerably alleviates the time step size restrictions faced by the former Lagrangian models due to the possibility of an element inversion within one time step. The method is validated and compared with conventional approaches using three numerical examples. Time step size and corresponding Courant numbers leading to optimal behavior in terms of computational efficiency are identified.
Abstract
We propose here a displacement-based updated Lagrangian fluid [...]
In this paper, we present an explicit formulation for reduced‐order models of the stabilized finite element approximation of the incompressible Navier–Stokes equations. The basic idea is to build a reduced‐order model based on a proper orthogonal decomposition and a Galerkin projection and treat all the terms in an explicit way in the time integration scheme, including the pressure. This is possible because the reduced model snapshots do already fulfill the continuity equation. The pressure field is automatically recovered from the reduced‐order basis and solution coefficients. The main advantage of this explicit treatment of the incompressible Navier–Stokes equations is that it allows for the easy use of hyper‐reduced order models, because only the right‐hand side vector needs to be recovered by means of a gappy data reconstruction procedure. A method for choosing the optimal set of sampling points at the discrete level in the gappy procedure is also presented. Numerical examples show the performance of the proposed strategy
Abstract
In this paper, we present an explicit formulation for reduced‐order models of the stabilized finite element approximation of the incompressible Navier–Stokes equations. The basic [...]
The rise of GPUs in modern high-performance systems increases the interest in porting portion of codes to such hardware. The current paper aims to explore the performance of a portable state-of-the-art FE solver on GPU accelerators. Performance evaluation is done by comparing with an existing highly-optimized OpenMP version of the solver. Code portability is ensured by writing the program using the OpenCL 1.1 specifications, while performance portability is sought through an optimization step performed at the beginning of the calculations to find out the optimal parameter set for the solver. The results show that the new implementation can be several times faster than the OpenMP version.
Abstract
The rise of GPUs in modern high-performance systems increases the interest in porting portion of codes to such hardware. The current paper aims to explore the performance of a portable [...]