z-logo
Premium
Adaptive embedded unstructured grid methods
Author(s) -
Löhner Rainald,
Baum Joseph D.,
Mestreau Eric,
Sharov Dmitri,
Charman Charles,
Pelessone Daniele
Publication year - 2004
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.978
Subject(s) - inviscid flow , solver , grid , curvature , unstructured grid , boundary (topology) , compressibility , computer science , immersed boundary method , domain (mathematical analysis) , mesh generation , geometry , conformal map , computational science , compressible flow , adaptive mesh refinement , enhanced data rates for gsm evolution , surface (topology) , mechanics , mathematics , finite element method , mathematical analysis , physics , artificial intelligence , engineering , structural engineering , programming language
Abstract A simple embedded domain method for node‐based unstructured grid solvers is presented. The key modification of the original, edge‐based solver is to remove all geometry‐parameters (essentially the normals) belonging to edges cut by embedded surface faces. Several techniques to improve the treatment of boundary points close to the immersed surfaces are explored. Alternatively, higher‐order boundary conditions are achieved by duplicating crossed edges and their endpoints. Adaptive mesh refinement based on proximity to or the curvature of the embedded CSD surfaces is used to enhance the accuracy of the solution. User‐defined or automatic deactivation for the regions inside immersed solid bodies is employed to avoid unnecessary work. Several examples are included that show the viability of this approach for inviscid and viscous, compressible and incompressible, steady and unsteady flows, as well as coupled fluid–structure problems. Copyright © 2004 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here