A massively-parallel, unstructured overset method for mesh connectivity
From MaRDI portal
Publication:2311478
DOI10.1016/j.jcp.2018.09.053zbMath1416.65575OpenAlexW2895409982MaRDI QIDQ2311478
Krishnan Mahesh, Wyatt James Horne
Publication date: 10 July 2019
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2018.09.053
Parallel numerical computation (65Y05) Applications to the sciences (65Z05) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50)
Related Items
Effect of tabs on the shear layer dynamics of a jet in cross-flow ⋮ Immersed boundary and overset grid methods assessed for Stokes flow due to an oscillating sphere ⋮ Overset meshes for incompressible flows: on preserving accuracy of underlying discretizations ⋮ A hardware accelerated unstructured overset method to simulate turbulent fluid flow ⋮ A multiple instance solver framework based on dynamic overset grid method for flow field simulation of array configuration with moving components ⋮ A parallel dynamic overset grid framework for immersed boundary methods ⋮ A simple Chimera grid method with an implicit Dirichlet/Neumann coupling scheme for flows with moving boundaries ⋮ A new overset grid assembly strategy for dynamic grid systems ⋮ A massively-parallel, unstructured overset method to simulate moving bodies in turbulent flows ⋮ Large-eddy simulation and streamline coordinate analysis of flow over an axisymmetric hull ⋮ Resolution of deadlocks in a fine discrete floor field cellular automata model—modeling of turning and lateral movement at bottlenecks
Uses Software
Cites Work
- Unnamed Item
- Robust and efficient overset grid assembly for partitioned unstructured meshes
- A ghost-cell immersed boundary method for flow in complex geometry.
- IMMERSED BOUNDARY METHODS
- Direct numerical simulation of turbulent channel flow up to Reτ=590
- Interaction of two flapping filaments in a flowing soap film
- An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
- Multidimensional binary search trees used for associative searching