A fast and accurate method to solve the incompressible Navier-Stokes equations

Purpose: The purpose of this paper is to highlight the possibilities of a novel Lagrangian formulation in dealing with the solution of the incompressible Navier-Stokes equations with very large time steps. Design/methodology/approach: The design of the paper is based on introducing the origin of thi...

Descripción completa

Detalles Bibliográficos
Autores: Idelsohn, Sergio Rodolfo, Nigro, Norberto Marcelo, Gimenez, Juan Marcelo, Rossi, Riccardo, Marti, Julio Marcelo
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2013
País:Argentina
Institución:Consejo Nacional de Investigaciones Científicas y Técnicas
Repositorio:CONICET Digital (CONICET)
Idioma:inglés
OAI Identifier:oai:ri.conicet.gov.ar:11336/8864
Acceso en línea:http://hdl.handle.net/11336/8864
Access Level:acceso abierto
Palabra clave:Navier-Stokes Equations
Particle Methods
Large Time-Steps
Incompressible Fluid Flows
Real Time Cfd
https://purl.org/becyt/ford/2.3
https://purl.org/becyt/ford/2
Descripción
Sumario:Purpose: The purpose of this paper is to highlight the possibilities of a novel Lagrangian formulation in dealing with the solution of the incompressible Navier-Stokes equations with very large time steps. Design/methodology/approach: The design of the paper is based on introducing the origin of this novel numerical method, originally inspired on the Particle Finite Element Method (PFEM), summarizing the previously published theory in its moving mesh version. Afterwards its extension to fixed mesh version is introduced, showing some details about the implementation. Findings: The authors have found that even though this method was originally designed to deal with heterogeneous or free-surface flows, it can be competitive with Eulerian alternatives, even in their range of optimal application in terms of accuracy, with an interesting robustness allowing to use large time steps in a stable way. Originality/value: With this objective in mind, the authors have chosen a number of benchmark examples and have proved that the proposed algorithm provides results which compare favourably, both in terms of solution time and accuracy achieved, with alternative approaches, implemented in in-house and commercial codes.