Implicit Preconditioning for Explicit Multigrid Solvers on Cut-Cell Cartesian Meshes
Explore the source record for details and available documents.
TTT↗
SEARCH · Engineering Papers
Results for “Cartesian mesh”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Applications of Space-Filling-Curves to Cartesian Methods for CFD
The proposed paper presents a variety novel uses of Space-Filling-Curves (SFCs) for Cartesian mesh methods in 0. While these techniques will be demonstrated using non-body-fitted Cartesian meshes, most are applicable on general body-fitted meshes -both structured and unstructured. We demonstrate the use of single O(N log N) SFC-based reordering to produce single-pass (O(N)) algorithms for mesh partitioning, multigrid coarsening, and inter-mesh interpolation. The intermesh interpolation operator has many practical applications including warm starts on modified geometry, or as an inter-grid transfer operator on remeshed regions in moving-body simulations. Exploiting the compact construction of these operators, we further show that these algorithms are highly amenable to parallelization. Examples using the SFC-based mesh partitioner show nearly linear speedup to 512 CPUs even when using multigrid as a smoother. Partition statistics are presented showing that the SFC partitions are, on-average, within 10% of ideal even with only around 50,000 cells in each subdomain. The inter-mesh interpolation operator also has linear asymptotic complexity and can be used to map a solution with N unknowns to another mesh with M unknowns with O(max(M,N)) operations. This capability is demonstrated both on moving-body simulations and in mapping solutions to perturbed meshes for finite-difference-based gradient design methods.
Aftosmis, Michael J.↗
Applications of Space-Filling-Curves to Cartesian Methods for CFD
This paper presents a variety of novel uses of space-filling-curves (SFCs) for Cartesian mesh methods in CFD. While these techniques will be demonstrated using non-body-fitted Cartesian meshes, many are applicable on general body-fitted meshes-both structured and unstructured. We demonstrate the use of single theta(N log N) SFC-based reordering to produce single-pass (theta(N)) algorithms for mesh partitioning, multigrid coarsening, and inter-mesh interpolation. The intermesh interpolation operator has many practical applications including warm starts on modified geometry, or as an inter-grid transfer operator on remeshed regions in moving-body simulations Exploiting the compact construction of these operators, we further show that these algorithms are highly amenable to parallelization. Examples using the SFC-based mesh partitioner show nearly linear speedup to 640 CPUs even when using multigrid as a smoother. Partition statistics are presented showing that the SFC partitions are, on-average, within 15% of ideal even with only around 50,000 cells in each sub-domain. The inter-mesh interpolation operator also has linear asymptotic complexity and can be used to map a solution with N unknowns to another mesh with M unknowns with theta(M + N) operations. This capability is demonstrated both on moving-body simulations and in mapping solutions to perturbed meshes for control surface deflection or finite-difference-based gradient design methods.
Aftosmis, M. J.↗
A mixed volume grid approach for the Euler and Navier-Stokes equations
An approach for solving the compressible Euler and Navier-Stokes equations upon meshes composed of nearly arbitrary polyhedra is described. Each polyhedron is constructed from an arbitrary number of triangular and quadrilateral face elements, allowing the unified treatment of tetrahedral, prismatic, pyramidal, and hexahedral cells, as well the general cut cells produced by Cartesian mesh approaches. The basics behind the numerical approach and the resulting data structures are described. The accuracy of the mixed volume grid approach is assessed by performing a grid refinement study upon a series of hexahedral, tetrahedral, prismatic, and Cartesian meshes for an analytic inviscid problem. A series of laminar validation cases are made, comparing the results upon differing grid topologies to each other, to theory, and experimental data. A computation upon a prismatic/tetrahedral mesh is made simulating the laminar flow over a wall/cylinder combination.
Coirier, William J.↗
Efficient Fluid Dynamic Design Optimization Using Cartesian Grids
This report is subdivided in three parts. The first one reviews a new approach to the computation of inviscid flows using Cartesian grid methods. The crux of the method is the curvature-corrected symmetry technique (CCST) developed by the present authors for body-fitted grids. The method introduces ghost cells near the boundaries whose values are developed from an assumed flow-field model in vicinity of the wall consisting of a vortex flow, which satisfies the normal momentum equation and the non-penetration condition. The CCST boundary condition was shown to be substantially more accurate than traditional boundary condition approaches. This improved boundary condition is adapted to a Cartesian mesh formulation, which we call the Ghost Body-Cell Method (GBCM). In this approach, all cell centers exterior to the body are computed with fluxes at the four surrounding cell edges. There is no need for special treatment corresponding to cut cells which complicate other Cartesian mesh methods.
Dadone, A.↗
A multi-dimensional kinetic-based upwind solver for the Euler equations
A multidimensional kinetic fluctuation-splitting scheme has been developed for the Euler equations. The scheme is based on an N-scheme discretization of the Boltzmann equation at the kinetic level for triangulated Cartesian meshes with a diagonal-adaptive strategy. The resulting Euler scheme is a cell-vertex fluctuation-splitting scheme where fluctuations in the conserved-variable vector Q are obtained as moments of the fluctuation in the Maxwellian velocity distribution function at the kinetic level. Encouraging preliminary results have been obtained for perfect gases on Cartesian meshes with first-order spatial accuracy. The present approach represents an improvement to the well-established dimensionally-split upwind schemes.
Eppard, W. M.↗
PARAMESH: A Parallel Adaptive Mesh Refinement Community Toolkit
In this paper, we describe a community toolkit which is designed to provide parallel support with adaptive mesh capability for a large and important class of computational models, those using structured, logically cartesian meshes. The package of Fortran 90 subroutines, called PARAMESH, is designed to provide an application developer with an easy route to extend an existing serial code which uses a logically cartesian structured mesh into a parallel code with adaptive mesh refinement. Alternatively, in its simplest use, and with minimal effort, it can operate as a domain decomposition tool for users who want to parallelize their serial codes, but who do not wish to use adaptivity. The package can provide them with an incremental evolutionary path for their code, converting it first to uniformly refined parallel code, and then later if they so desire, adding adaptivity.
MacNeice, Peter↗
Computation of External Aerodynamics for a Canard Rotor/Wing Aircraft
The aerodynamic loads on a Canard Rotor/Wing vehicle are investigated using inviscid numerical simulations in order to understand the flight characteristics of the vehicle during conversion from rotor craft to fixed-wing flight. A series of numerical simulations at seven azimuthal rotor indices are presented covering a quarter turn of the rotor With symmetry arguments, these simulations produce 25 data points for a complete rotation. A Cartesian mesh approach is used to compute the flow field about a configuration with faired-over engine inlet and exhaust that matches the wind tunnel geometry. These simulations were performed using meshes with approximately nine Million Cartesian cells. To better understand the aerodynamic effects of the rotor hub on the configuration, the same set of simulations were repeated for a hub-less geometry. Overall loads for both configurations are similar but are due to somewhat different aerodynamic mechanisms.
Pandya, S. A.↗
Advances in Automation of Overset Structured Volume Mesh Generation and Domain Connectivity
Automation of overset structured surface mesh generation has recently been accomplished by the creation of face, edge, and node meshes based on Boundary Representation solids as the geometry input. The current work continues the automation effort in overset volume mesh generation and domain connectivity based on the auto-generated surface meshes. All near-body curvilinear volume meshes are automatically generated using hyperbolic methods. Automation of this step is enabled by appropriate surface grid point distribution, and selection of boundary-splay and smoothing parameters based on concave and convex surface features. The off-body domain is covered by two automatically generated grid systems. The first contains a single Cartesian mesh with a uniform core enclosing all near-body volume meshes and stretched layers that extend to the far field, while the second consists of a set of small stretched Cartesian grids covering pockets of off-body orphan points. With high quality mesh overlap mostly guaranteed by the surface meshing scheme, orphan points that need to be covered by the second Cartesian mesh system are located away from the fine grid spacing region near the wall. Using line-segment and ray-pierce tests against the surface grids, hole-cutting is accomplished on both near and off-body volume grids resulting in appropriate clearances from the wall. The complete mesh generation automation process is demonstrated on five test cases where flow solutions are also computed and compared with solutions obtained using other methods.
TTT↗
Toward Immersed Boundary Simulation of High Reynolds Number Flows
In the immersed boundary (IB) method, the surface of an object is reconstructed with forcing terms in the underlying flow field equations. The surface may split a computational cell removing the constraint of the near wall gridlines to be aligned with the surface. This feature greatly simplifies the grid generation process which is cumbersome and expensive in particular for structured grids and complex geometries. The IB method is ideally suited for Cartesian flow solvers. The flow equations written in Cartesian coordinates appear in a very simple form and several numerical algorithms can be used for an efficient solution of the equations. In addition, the accuracy of numerical algorithms is dependent on the underlying grid and it usually deteriorates when the grid deviates from a Cartesian mesh. The challenge for the IB method lies in the representation of the wall boundaries and in providing an adequate near wall flow field resolution. The issue of enforcing no-slip boundary conditions at the immersed surface has been addressed by several authors by imposing a local reconstruction of the solution. Initial work by Verzicco et al. was based on a simple linear, one-dimensional operator and this approach proved to be accurate for boundaries largely aligned with the grid lines. Majumdar et al. used various multidimensional and high order polynomial interpolations schemes. These high order schemes, however, are keen to introduce wiggles and spurious extrema. Iaccarino & Verzicco and Kalitzin & Iaccarino proposed a tri-linear reconstruction for the velocity components and the turbulent scalars. A modified implementation that has proven to be more robust is reported in this paper. The issue of adequate near wall resolution in a Cartesian framework can initially be addressed by using a non-uniform mesh which is stretched near the surface. In this paper, we investigate an unstructured approach for local grid refinement that utilizes Cartesian mesh features. The computation of high Reynolds number wall bounded flows is particularly challenging as it requires the consideration of thin turbulent boundary layers, i.e. near wall regions with large gradients of the flow field variables. For such flows, the representation of the wall boundary has a large impact on the accuracy of the computation. It is also critical for the robustness and convergence of the flow solver.
Kalitzin, Georgi↗
The Influence of Adaptive Mesh Refinement on the Prediction of Vortex Interactions about a Generic Missile Airframe
The complex interaction of forebody and wing vortices significantly impacts missile aerodynamics. The formation of these vortices involves smooth regions of the geometry or geometric discontinuities like leading edges, trailing edges, tips, and corners. Regions of supersonic flow and complex shock topologies interact with boundary layers and vortices. Smooth-body separation and 3D viscous effects strain current Reynolds-averaged Navier-Stokes (RANS) techniques. The quantification and control of discretization error is critical to obtaining reliable simulation results and often turbulence model assessments are made in the presence of unquantified (and potentially large) discretization errors. Two mesh adaptation schemes are applied to steady RANS simulations. Multiscale unstructured mesh adaptation is applied to control interpolation error estimates of the Mach field, which resolves boundary layers, vortices, and shocks. A dual-mesh approach with overset communication is applied between an expert-crafted near-body unstructured mesh and an adaptive off-body Cartesian mesh refined with Q-criterion scaled by the strain tensor magnitude. A generic missile configuration is examined in a supersonic flow field to show the interaction of mesh adaptation and turbulence model. Turbulence model modifications for rotational correction and a quadratic constitutive relationship show a strong influence on adaptive mesh refinement and predicted rolling moment.
slender body aerodynamics↗
An alternative to unstructured grids for computing gas dynamic flows around arbitrarily complex two-dimensional bodies
In this paper we describe an approach for dealing with arbitrary complex, two dimensional geometries, the so-called cartesian boundary method. Conceptually, the cartesian boundary method is quite simple. Solid bodies blank out areas of a background, cartesian mesh, and the resultant cut cells are singled out for special attention. However, there are several obstacles that must be overcome in order to achieve a practical scheme. We present a general strategy that overcomes these obstacles, together with some details of our successful conversion of an adaptive mesh algorithm from a body-fitted code to a cartesian boundary code.
Quirk, James J.↗
A Parallel Cartesian Approach for External Aerodynamics of Vehicles with Complex Geometry
This workshop paper presents the current status in the development of a new approach for the solution of the Euler equations on Cartesian meshes with embedded boundaries in three dimensions on distributed and shared memory architectures. The approach uses adaptively refined Cartesian hexahedra to fill the computational domain. Where these cells intersect the geometry, they are cut by the boundary into arbitrarily shaped polyhedra which receive special treatment by the solver. The presentation documents a newly developed multilevel upwind solver based on a flexible domain-decomposition strategy. One novel aspect of the work is its use of space-filling curves (SFC) for memory efficient on-the-fly parallelization, dynamic re-partitioning and automatic coarse mesh generation. Within each subdomain the approach employs a variety reordering techniques so that relevant data are on the same page in memory permitting high-performance on cache-based processors. Details of the on-the-fly SFC based partitioning are presented as are construction rules for the automatic coarse mesh generation. After describing the approach, the paper uses model problems and 3- D configurations to both verify and validate the solver. The model problems demonstrate that second-order accuracy is maintained despite the presence of the irregular cut-cells in the mesh. In addition, it examines both parallel efficiency and convergence behavior. These investigations demonstrate a parallel speed-up in excess of 28 on 32 processors of an SGI Origin 2000 system and confirm that mesh partitioning has no effect on convergence behavior.
Aftosmis, M. J.↗
Research in unsteady aerodynamics and computational aeroelasticity at the NASA Langley Research Center
This paper presents recent results in the unsteady aerodynamics and computational aeroelasticity research programs at the NASA Langley Research Center. These programs include development of two types of computational methods: methods that use structured computational meshes and those that use unstructured meshes. Results show that an aeroelastic analysis method that uses unsteady transonic small disturbance (TSD) potential aerodynamics and structured, Cartesian meshes is capable of accurate analysis of complex aircraft configurations. The paper describes recent enhancements to the TSD method that allow analysis of vehicles with swept, flexible vertical surfaces and flexible fuselages and presents selected results that verify the accuracy of the new capabilities. Modifications to a structured-mesh Euler/Navier-Stokes method to allow aeroelastic analysis are described, and a wing flutter analysis using the resulting method is presented. Advantages of using unstructured meshes for the analysis of complex configurations are discussed. The paper presents development of unstructured-mesh Euler/Navier-Stokes methods for unsteady aerodynamics and aeroelastic analysis. Spatial and temporal adaption methods on unstructured meshes are described, and selected results are presented.
Whitlow, Woodrow, Jr.↗
A Cartesian grid approach with hierarchical refinement for compressible flows
Many numerical studies of flows that involve complex geometries are limited by the difficulties in generating suitable grids. We present a Cartesian boundary scheme for two-dimensional, compressible flows that is unfettered by the need to generate a computational grid and so it may be used, routinely, even for the most awkward of geometries. In essence, an arbitrary-shaped body is allowed to blank out some region of a background Cartesian mesh and the resultant cut-cells are singled out for special treatment. This is done within a finite-volume framework and so, in principle, any explicit flux-based integration scheme can take advantage of this method for enforcing solid boundary conditions. For best effect, the present Cartesian boundary scheme has been combined with a sophisticated, local mesh refinement scheme, and a number of examples are shown in order to demonstrate the efficacy of the combined algorithm for simulations of shock interaction phenomena.
Quirk, James J.↗
Toward Automatic Verification of Goal-Oriented Flow Simulations
We demonstrate the power of adaptive mesh refinement with adjoint-based error estimates in verification of simulations governed by the steady Euler equations. The flow equations are discretized using a finite volume scheme on a Cartesian mesh with cut cells at the wall boundaries. The discretization error in selected simulation outputs is estimated using the method of adjoint-weighted residuals. Practical aspects of the implementation are emphasized, particularly in the formulation of the refinement criterion and the mesh adaptation strategy. Following a thorough code verification example, we demonstrate simulation verification of two- and three-dimensional problems. These involve an airfoil performance database, a pressure signature of a body in supersonic flow and a launch abort with strong jet interactions. The results show reliable estimates and automatic control of discretization error in all simulations at an affordable computational cost. Moreover, the approach remains effective even when theoretical assumptions, e.g., steady-state and solution smoothness, are relaxed.
Simulations↗
Structured background grids for generation of unstructured grids by advancing front method
A new method of background grid construction is introduced for generation of unstructured tetrahedral grids using the advancing-front technique. Unlike the conventional triangular/tetrahedral background grids which are difficult to construct and usually inadequate in performance, the new method exploits the simplicity of uniform Cartesian meshes and provides grids of better quality. The approach is analogous to solving a steady-state heat conduction problem with discrete heat sources. The spacing parameters of grid points are distributed over the nodes of a Cartesian background grid by interpolating from a few prescribed sources and solving a Poisson equation. To increase the control over the grid point distribution, a directional clustering approach is used. The new method is convenient to use and provides better grid quality and flexibility. Sample results are presented to demonstrate the power of the method.
Pirzadeh, Shahyar↗
Towards a Viscous Wall Model for Immersed Boundary Methods
Immersed boundary methods are frequently employed for simulating flows at low Reynolds numbers or for applications where viscous boundary layer effects can be neglected. The primary shortcoming of Cartesian mesh immersed boundary methods is the inability of efficiently resolving thin turbulent boundary layers in high-Reynolds number flow application. The inefficiency of resolving the thin boundary is associated with the use of constant aspect ratio Cartesian grid cells. Conventional CFD approaches can efficiently resolve the large wall normal gradients by utilizing large aspect ratio cells near the wall. This paper presents different approaches for immersed boundary methods to account for the viscous boundary layer interaction with the flow-field away from the walls. Different wall modeling approaches proposed in previous research studies are addressed and compared to a new integral boundary layer based approach. In contrast to common wall-modeling approaches that usually only utilize local flow information, the integral boundary layer based approach keeps the streamwise history of the boundary layer. This allows the method to remain effective at much larger y+ values than local wall modeling approaches. After a theoretical discussion of the different approaches, the method is applied to increasingly more challenging flow fields including fully attached, separated, and shock-induced separated (laminar and turbulent) flows.
Immersed↗