An explicit–implicit finite element model for the numerical solution of incompressible Navier–Stokes equations on moving grids

In this paper an efficient mesh-moving Finite Element model for the simulation of the incompressible flow problems is proposed. The model is based on a combination of the explicit multi-step scheme (Runge–Kutta) with an implicit treatment of the pressure. The pressure is decoupled from the velocity...

Descripción completa

Detalles Bibliográficos
Autores: Martí, Julio Marcelo|||0000-0002-6971-1797, Ryzhakov, Pavel|||0000-0002-4672-9038
Tipo de recurso: artículo
Fecha de publicación:2019
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/185085
Acceso en línea:https://hdl.handle.net/2117/185085
https://dx.doi.org/10.1016/j.cma.2019.03.007
Access Level:acceso abierto
Palabra clave:Navier-Stokes equations--Numerical solutions
Incompressible Navier-Stokes
Accuracy
Particle Finite Element Method
Lagrangian
OpenMP
Benchmark
Equacions de Navier-Stokes -- Mètodes numèrics
Àrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi numèrica::Mètodes en elements finits
Descripción
Sumario:In this paper an efficient mesh-moving Finite Element model for the simulation of the incompressible flow problems is proposed. The model is based on a combination of the explicit multi-step scheme (Runge–Kutta) with an implicit treatment of the pressure. The pressure is decoupled from the velocity and is solved for only once per time step minimizing the computational cost of the implicit step. Novel solution algorithm alleviating time step restrictions faced by the majority of the former Lagrangian approaches is presented. The method is examined with respect to its space and time accuracy as well as the computational cost. Two numerical examples are solved: one involving a problem on a domain with fixed boundaries and the other one dealing with a free surface flow. It is shown that the method can be easily parallelized.