A hybrid building-block and gridless method for compressible flows
From MaRDI portal
Publication:3596551
DOI10.1002/fld.1827zbMath1254.76113OpenAlexW2139477830MaRDI QIDQ3596551
Joseph D. Baum, Hong Luo, Rainald Löhner
Publication date: 28 January 2009
Published in: International Journal for Numerical Methods in Fluids (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/fld.1827
Euler equationsshock wavesCartesian grid methodsunsteady compressible flowsgridless methodsbuilding-block methods
Related Items
A numerical study on a Cartesian-based body-fitted adaptive grid method ⋮ A novel meshless method for incompressible flow calculations ⋮ Aeronautical CFD in the age of petaflops-scale computing: from unstructured to Cartesian meshes ⋮ Adaptive Cartesian grid with mesh-less zones for compressible flow calculations ⋮ Implicit fully mesh-less method for compressible viscous flow calculations ⋮ Cartesian grid method for the compressible Euler equations using simplified ghost point treatments at embedded boundaries ⋮ An efficient implicit mesh-less method for compressible flow calculations
Cites Work
- Unnamed Item
- A gridless boundary condition method for the solution of the Euler equations on embedded Cartesian meshes with multigrid
- The numerical simulation of two-dimensional fluid flow with strong shocks
- A fast, matrix-free implicit method for compressible flows on unstructured grids
- Restoration of the contact surface in the HLL-Riemann solver
- An accuracy assessment of Cartesian-mesh approaches for the Euler equations
- Average-state Jacobians and implicit methods for compressible viscous and turbulent flows
- Towards the ultimate conservative difference scheme. II: Monotonicity and conservation combined in a second-order scheme
- An upwind finite difference scheme for meshless solvers
- A hybrid Cartesian grid and gridless method for compressible flows
- Euler calculations for multielement airfoils using Cartesian grids
- Finite volume solution of the two-dimensional Euler equations on a regular triangular mesh
- An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
