{"title":"Semi‐implicit Lagrangian Voronoi approximation for the incompressible Navier–Stokes equations","authors":"Ondřej Kincl, Ilya Peshkov, Walter Boscheri","doi":"10.1002/fld.5339","DOIUrl":null,"url":null,"abstract":"We introduce semi‐implicit Lagrangian Voronoi approximation (SILVA), a novel numerical method for the solution of the incompressible Euler and Navier–Stokes equations, which combines the efficiency of semi‐implicit time marching schemes with the robustness of time‐dependent Voronoi tessellations. In SILVA, the numerical solution is stored at particles, which move with the fluid velocity and also play the role of the generators of the computational mesh. The Voronoi mesh is rapidly regenerated at each time step, allowing large deformations with topology changes. As opposed to the reconnection‐based Arbitrary‐Lagrangian‐Eulerian schemes, we need no remapping stage. A semi‐implicit scheme is devised in the context of moving Voronoi meshes to project the velocity field onto a divergence‐free manifold. We validate SILVA by illustrative benchmarks, including viscous, inviscid, and multi‐phase flows. Compared to its closest competitor, the Incompressible Smoothed Particle Hydrodynamics method, SILVA offers a sparser stiffness matrix and facilitates the implementation of no‐slip and free‐slip boundary conditions.","PeriodicalId":50348,"journal":{"name":"International Journal for Numerical Methods in Fluids","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal for Numerical Methods in Fluids","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1002/fld.5339","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
We introduce semi‐implicit Lagrangian Voronoi approximation (SILVA), a novel numerical method for the solution of the incompressible Euler and Navier–Stokes equations, which combines the efficiency of semi‐implicit time marching schemes with the robustness of time‐dependent Voronoi tessellations. In SILVA, the numerical solution is stored at particles, which move with the fluid velocity and also play the role of the generators of the computational mesh. The Voronoi mesh is rapidly regenerated at each time step, allowing large deformations with topology changes. As opposed to the reconnection‐based Arbitrary‐Lagrangian‐Eulerian schemes, we need no remapping stage. A semi‐implicit scheme is devised in the context of moving Voronoi meshes to project the velocity field onto a divergence‐free manifold. We validate SILVA by illustrative benchmarks, including viscous, inviscid, and multi‐phase flows. Compared to its closest competitor, the Incompressible Smoothed Particle Hydrodynamics method, SILVA offers a sparser stiffness matrix and facilitates the implementation of no‐slip and free‐slip boundary conditions.
期刊介绍:
The International Journal for Numerical Methods in Fluids publishes refereed papers describing significant developments in computational methods that are applicable to scientific and engineering problems in fluid mechanics, fluid dynamics, micro and bio fluidics, and fluid-structure interaction. Numerical methods for solving ancillary equations, such as transport and advection and diffusion, are also relevant. The Editors encourage contributions in the areas of multi-physics, multi-disciplinary and multi-scale problems involving fluid subsystems, verification and validation, uncertainty quantification, and model reduction.
Numerical examples that illustrate the described methods or their accuracy are in general expected. Discussions of papers already in print are also considered. However, papers dealing strictly with applications of existing methods or dealing with areas of research that are not deemed to be cutting edge by the Editors will not be considered for review.
The journal publishes full-length papers, which should normally be less than 25 journal pages in length. Two-part papers are discouraged unless considered necessary by the Editors.