Cartesian Mesh Simulations for the 3rd AIAA Sonic Boom Prediction Workshop
No abstract available
Spurlock, Wade M.↗
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.
Cartesian Mesh Simulations for the Third AIAA Sonic Boom Prediction Workshop
Explore the source record for details and available documents.
ARMD↗
Implicit Preconditioning for Explicit Multigrid Solvers on Cut-Cell Cartesian Meshes
This work assesses the effectiveness of linearized implicit Euler preconditioning for multigrid solvers using an unpreconditioned, Jacobian-free Newton Krylov method to converge the linear system of equations. Multigrid convergence rates improve to approximately 0.75 across the cases tested including a Mach 2 supersonic wedge, transonic NACA 0012 airfoil, and ONERA M6 wing. While larger Krylov subspaces increase the convergence rate, they also increase the computational cost, such that 4-8 Krylov vectors often offers the fastest turnaround. Further reductions in computational cost are achieved with a sequential hybrid preconditioner that begins with the explicit multigrid solver before transitioning to the preconditioned algorithm later on. In addition, a novel implementation of dual time stepping is extended to include both common BDF methods as well as high-order implicit Runge-Kutta schemes. This particular formulation, which uses A −1 preconditioning, is amenable to matrix-free solvers, and the L-stable methods are especially suited for meshes with arbitrarily small cut-cells. Asymptotic order of convergence is demonstrated for BDF1, BDF2, SDIRK2, and 3rd-order Radau IIA time integration with unsteady 2D vortex simulations.
ARMD↗
Implicit Preconditioning for Explicit Multigrid Solvers on Cut-Cell Cartesian Meshes
Explore the source record for details and available documents.
ARMD↗
Implicit Preconditioning for Explicit Multigrid Solvers on Cut-Cell Cartesian Meshes
Explore the source record for details and available documents.
TTT↗
Optimal local truncation error method for 3-D elasticity interface problems
The paper deals with a new effective numerical technique on unfitted Cartesian meshes for simulations of heterogeneous elastic materials. Here, we develop the optimal local truncation error method (OLTEM) with 27- point stencils (similar to those for linear finite elements) for the 3-D time-independent elasticity equations with irregular interfaces. Only displacement unknowns at each internal Cartesian grid point are used. The interface conditions are added to the expression for the local truncation error and do not change the width of the stencils. The unknown stencil coefficients are calculated by the minimization of the local truncation error of the stencil equations and yield the optimal second order of accuracy for OLTEM with the 27-point stencils on unfitted Cartesian meshes. A new post-processing procedure for accurate stress calculations has been developed. Similar to basic computations it uses OLTEM with the 27-point stencils and the elasticity equations. The post-processing procedure can be easily extended to unstructured meshes and can be independently used with existing numerical techniques (e.g., with finite elements). Numerical experiments show that at an accuracy of 0.1% for stresses, OLTEM with the new post-processing procedure significantly (by 10 5 -10 9 times) reduces the number of degrees of freedom compared to linear finite elements. OLTEM with the 27-point stencils yields even more accurate results than high-order finite elements with wider stencils.
42 ENGINEERING↗
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.↗
A constrained-transport embedded boundary method for compressible resistive magnetohydrodynamics
Motivated by the increased interest in pulsed-power magneto-inertial fusion devices in recent years, we present a method for implementing an arbitrarily shaped embedded boundary on a Cartesian mesh while solving the equations of compressible resistive magnetohydrodynamics. The method is built around a finite volume formulation of the equations in which a Riemann solver is used to compute fluxes on the faces between grid cells, and a face-centered constrained transport formulation of the induction equation. The small time step problem associated with the cut cells is avoided by always computing fluxes on the faces and edges of the Cartesian mesh. We extend the method to model a moving interface between two materials with different properties using a ghost-fluid approach, and show some preliminary results including shock-wave-driven and magnetically-driven dynamical compressions of magnetohydrostatic equilibria. In conclusion, we present a thorough verification of the method and show that it converges at second order in the absence of discontinuities, and at first order with a discontinuity in material properties.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
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↗