Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Cartesian grids”

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.

At least 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
NASA NTRS1982

GRID3C: Computer program for generation of C type multilevel, three dimensional and boundary conforming periodic grids

A fast computer program, GRID3C, was developed for accurately generating periodic, boundary conforming, three dimensional, consecutively refined computational grids applicable to realistic axial turbomachinery geometries. The method is based on using two functions to generate two dimensional grids on a number of coaxial axisymmetric surfaces positioned between the centerbody and the outer radial boundary. These boundary fitted grids are of the C type and are characterized by quasi-orthogonality and geometric periodicity. The built in nonorthogonal coordinate stretchings and shearings cause the grid clustering in the regions of interest. The stretching parameters are part of the input to GRID3C. In its present version GRID3C can generate and store a maximum of four consecutively refined three dimensional grids. The output grid coordinates can be calculated either in the Cartesian or in the cylindrical coordinate system.

Dulikravich, D. S.↗
NASA NTRS1994

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells are created using polygon-clipping algorithms. The grid is stored in a binary-tree structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded: a gradient-limited, linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The more robust of a series of viscous flux functions is used to provide the viscous fluxes at the cell interfaces. Adaptively-refined solutions of the Navier-Stokes equations using the Cartesian, cell-based approach are obtained and compared to theory, experiment, and other accepted computational results for a series of low and moderate Reynolds number flows.

Coirier, William J.↗
NASA NTRS1995

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells are created using polygon-clipping algorithms. The grid is stored in a binary-tree data structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded: A gradient-limited, linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The more robust of a series of viscous flux functions is used to provide the viscous fluxes at the cell interfaces. Adaptively-refined solutions of the Navier-Stokes equations using the Cartesian, cell-based approach are obtained and compared to theory, experiment and other accepted computational results for a series of low and moderate Reynolds number flows.

Coirier, William J.↗
NASA NTRS1995

Adaptively Refined Euler and Navier-Stokes Solutions with a Cartesian-Cell Based Scheme

A Cartesian-cell based scheme with adaptive mesh refinement for solving the Euler and Navier-Stokes equations in two dimensions has been developed and tested. Grids about geometrically complicated bodies were generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells were created using polygon-clipping algorithms. The grid was stored in a binary-tree data structure which provided a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations were solved on the resulting grids using an upwind, finite-volume formulation. The inviscid fluxes were found in an upwinded manner using a linear reconstruction of the cell primitives, providing the input states to an approximate Riemann solver. The viscous fluxes were formed using a Green-Gauss type of reconstruction upon a co-volume surrounding the cell interface. Data at the vertices of this co-volume were found in a linearly K-exact manner, which ensured linear K-exactness of the gradients. Adaptively-refined solutions for the inviscid flow about a four-element airfoil (test case 3) were compared to theory. Laminar, adaptively-refined solutions were compared to accepted computational, experimental and theoretical results.

Coirier, William J.↗
NASA NTRS1990

Simulation of disk-disk encounters with co-moving polar grids

The two-grid simulation method combining advantages of both polar and Cartesian mesh-codes is described. In addition to the stellar component reacting solely to gravitational forces, the gas component is included with dissipatively colliding particles. This allows fairly realistic simulation of planar encounters where both systems contain star plus gas disks.

Salo, Heikki↗
NASA NTRS1997

Low-Dispersion Scheme for Nonlinear Acoustic Waves in Nonuniform Flow

The linear dispersion-relation-preserving scheme and its boundary conditions have been extended to the nonlinear Euler equations. This allowed computing, a nonuniform flowfield and a nonlinear acoustic wave propagation in such a medium, by the same scheme. By casting all the equations, boundary conditions, and the solution scheme in generalized curvilinear coordinates, the solutions were made possible for non-Cartesian domains and, for the better deployment of the grid points, nonuniform grid step sizes could be used. It has been tested for a number of simple initial-value and periodic-source problems. A simple demonstration of the difference between a linear and nonlinear propagation was conducted. The wall boundary condition, derived from the momentum equations and implemented through a pressure at a ghost point, and the radiation boundary condition, derived from the asymptotic solution to the Euler equations, have proven to be effective for the nonlinear equations and nonuniform flows. The nonreflective characteristic boundary conditions also have shown success but limited to the nonlinear waves in no mean flow, and failed for nonlinear waves in nonuniform flow.

Baysal, Oktay↗
NASA NTRS2018

Application of Lattice Boltzmann and Navier-Stokes Methods to NASA's Wall Mounted Hump

Lattice Boltzmann (LB) based Large Eddy Simulation (LES), Reynolds-averaged Navier-Stokes (RANS) as well as hybrid RANS/LES methods within the Launch Ascent and Vehicle Aerodynamics (LAVA) solver framework are applied to NASA's wall-mounted hump. Computational results are compared with experiments performed by Greenblatt et al. A detailed comparison between the accuracy and resolution requirements of the two approaches for turbulence resolving simulations, as well as the suitability of different grid paradigms (body-fitted curvilinear and block structured Cartesian) are presented. This test case is part of NASA's Revolutionary Computational Aerosciences (RCA) sub-project which addresses the technical challenge of predicting flow separation and reattachment accurately. Improvements in predictive accuracy by as much as 90% are demonstrated using LB as well as hybrid RANS/LES approaches compared to state-of-the-art steady state RANS simulations.

Lattice Boltzmann↗
NASA NTRS1996

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.↗
DOE OSTI2021

Preliminary Implementation of Two-Dimensional Cartesian Solver in CTF-R

Sub-channel codes are one of the the modeling and simulation tools used for thermal-hydraulic analysis of nuclear reactors. A few examples of such sub-channel codes are the COolant Boiling in Rod Arrays (COBRA) family of codes. The approximations that are used to simplify the fluid conservation equations into sub-channel form, mainly that of axially-dominated flow, lead to noticeable limitations on sub-channels solvers for problems with significant flow in lateral directions. In this report, a two-dimensional Cartesian solver is developed and implemented within CTF-R, which is the residual solver in the North Carolina State University version of COBRA-TF (CTF). The new solver will enable CTF to simulate flow that is not axially-dominated. The appropriate Cartesian forms of the conservation equations are derived and implemented in the solver. Once the conservation equations are established, the process of constructing the matrix system was altered to solve a two-dimensional staggered grid system. A simple case was used to test that the two-dimensional Cartesian solver is accurate. The test problem does not include any source terms or flow in the lateral direction. The results show that the solver was able to run the simple case and converge to a steady-state solution. Future work will focus on testing existing capabilities by using test cases that include transients and equation cross-terms. Future work will also include adding additional capabilities such as enabling the solver to include cases with source terms and three dimensional cases.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
NASA NTRS1990

Galerkin finite difference Laplacian operators on isolated unstructured triangular meshes by linear combinations

The Galerkin weighted residual technique using linear triangular weight functions is employed to develop finite difference formulae in Cartesian coordinates for the Laplacian operator on isolated unstructured triangular grids. The weighted residual coefficients associated with the weak formulation of the Laplacian operator along with linear combinations of the residual equations are used to develop the algorithm. The algorithm was tested for a wide variety of unstructured meshes and found to give satisfactory results.

Baumeister, Kenneth J.↗
NASA NTRS1990

A three-dimensional dynamic solution-adaptive mesh algorithm

A solution-adaptive grid algorithm has been developed for use in two and three dimensions. The algorithm uses a transformation from the cartesian coordinate system to a general coordinate space, which will be defined as a parallelepiped. A weighting function for adaption of the grid is developed that will allow adaption to the gradients of any combination of dependent variables in the flow. The adaption is carried out in the parametric space and a simple inverse mapping to return the new parametric space to the physical space is derived. The concept used to relocate the grid-points in the parametric space is based on the center of mass of distributed weights. Solution-adaptive results are presented for various laminar flows in two dimensions and for mathematical weighting functions in three dimensions.

Benson, Rusty A.↗
NASA NTRS1995

An assessment of unstructured grid technology for timely CFD analysis

An assessment of two unstructured methods is presented in this paper. A tetrahedral unstructured method USM3D, developed at NASA Langley Research Center is compared to a Cartesian unstructured method, SPLITFLOW, developed at Lockheed Fort Worth Company. USM3D is an upwind finite volume solver that accepts grids generated primarily from the Vgrid grid generator. SPLITFLOW combines an unstructured grid generator with an implicit flow solver in one package. Both methods are exercised on three test cases, a wing, and a wing body, and a fully expanded nozzle. The results for the first two runs are included here and compared to the structured grid method TEAM and to available test data. On each test case, the set up procedure are described, including any difficulties that were encountered. Detailed descriptions of the solvers are not included in this paper.

Kinard, Tom A.↗
NASA NTRS2012

Wargaming in Both Rectilinear and Hexagonal Spaces

There are two main approaches to managing wargame entity interactions (movement, line of sight, area of effect, etc) freespace and gridded In the freespace approach, the units exist as entities in a continuous volume of (usually) Cartesian 3D space. They move in any direction (based on interaction with "terrain" that occupies the same space) and interact with each other based on references and displacements from their position in that space. In the gridded approach, space is broken up into (usually regular) shaped pieces. Units are considered to occupy the entire volume of one of these pieces, movement, line of sight, and other interactions are based on the relationships among the spaces rather than the absolute positions of the units themselves. Both approaches have advantages and drawbacks. The general issue that this discussion has addressed is that there is no "perfect" approach to implementing a wargaming battlespace. Each of them (and this extends to others not discussed) has different sets of advantages and disadvantages. Nothing will change that basic nature of the various approaches, nor would it be desirable to do so. Along with the advantages, the challenges define the feel of the game and focus the thinking of the players on certain aspects and away from others. The proposed approach to combining square and hexagonal approaches, which we will call the rhombus interface, leverages rhombuses constructed from equilateral triangles into which the hexagon can be decomposed to bridge the gap between the approaches, maintain relative consistency between the two as much as possible, and provide most of the feel of the hexagonal approach.

Hoover, Alex↗
NASA NTRS1993

Development and analysis of prognostic equations for mesoscale kinetic energy and mesoscale (subgrid scale) fluxes for large-scale atmospheric models

Generated by landscape discontinuities (e.g., sea breezes) mesoscale circulation processes are not represented in large-scale atmospheric models (e.g., general circulation models), which have an inappropiate grid-scale resolution. With the assumption that atmospheric variables can be separated into large scale, mesoscale, and turbulent scale, a set of prognostic equations applicable in large-scale atmospheric models for momentum, temperature, moisture, and any other gaseous or aerosol material, which includes both mesoscale and turbulent fluxes is developed. Prognostic equations are also developed for these mesoscale fluxes, which indicate a closure problem and, therefore, require a parameterization. For this purpose, the mean mesoscale kinetic energy (MKE) per unit of mass is used, defined as E-tilde = 0.5 (the mean value of u'(sub i exp 2), where u'(sub i) represents the three Cartesian components of a mesoscale circulation (the angle bracket symbol is the grid-scale, horizontal averaging operator in the large-scale model, and a tilde indicates a corresponding large-scale mean value). A prognostic equation is developed for E-tilde, and an analysis of the different terms of this equation indicates that the mesoscale vertical heat flux, the mesoscale pressure correlation, and the interaction between turbulence and mesoscale perturbations are the major terms that affect the time tendency of E-tilde. A-state-of-the-art mesoscale atmospheric model is used to investigate the relationship between MKE, landscape discontinuities (as characterized by the spatial distribution of heat fluxes at the earth's surface), and mesoscale sensible and latent heat fluxes in the atmosphere. MKE is compared with turbulence kinetic energy to illustrate the importance of mesoscale processes as compared to turbulent processes. This analysis emphasizes the potential use of MKE to bridge between landscape discontinuities and mesoscale fluxes and, therefore, to parameterize mesoscale fluxes generated by such subgrid-scale landscape discontinuities in large-scale atmospheric models.

Avissar, Roni↗
DOE OSTI2022

Time-explicit Darwin PIC algorithm

A new approach to Darwin particle-in-cell plasma simulation is described. Using a finite-element approach, the vector potential is assured to be exactly solenoidal. This allows writing the system of multi-species particles as an action-at-a-distance Hamiltonian system. Applying recently-developed explicit symplectic methods to this gives a time-explicit algorithm with all desired properties. Elliptic systems for the electrostatic and magneto-static portions of the problem are inverted efficiently by an algebraic multi-grid algorithm. The algorithm is implemented in a two-dimensional Cartesian-geometry code and tested by application to Weibel instability and to Alfvén wave dynamics. Results show the effectiveness of this approach. Extensions to arbitrary meshes and to a partially time-implicit scheme are briefly discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS2014

Parallel Adaptive High-Order CFD Simulations Characterizing Cavity Acoustics for the Complete SOFIA Aircraft

This paper presents one-of-a-kind MPI-parallel computational fluid dynamics simulations for the Stratospheric Observatory for Infrared Astronomy (SOFIA). SOFIA is an airborne, 2.5-meter infrared telescope mounted in an open cavity in the aft of a Boeing 747SP. These simulations focus on how the unsteady flow field inside and over the cavity interferes with the optical path and mounting of the telescope. A temporally fourth-order Runge-Kutta, and spatially fifth-order WENO-5Z scheme was used to perform implicit large eddy simulations. An immersed boundary method provides automated gridding for complex geometries and natural coupling to a block-structured Cartesian adaptive mesh refinement framework. Strong scaling studies using NASA's Pleiades supercomputer with up to 32,000 cores and 4 billion cells shows excellent scaling. Dynamic load balancing based on execution time on individual AMR blocks addresses irregularities caused by the highly complex geometry. Limits to scaling beyond 32K cores are identified, and targeted code optimizations are discussed.

Acoustics↗
NASA NTRS2016

Parallel Adjective High-Order CFD Simulations Characterizing SOFIA Cavity Acoustics

This paper presents large-scale MPI-parallel computational uid dynamics simulations for the Stratospheric Observatory for Infrared Astronomy (SOFIA). SOFIA is an airborne, 2.5-meter infrared telescope mounted in an open cavity in the aft fuselage of a Boeing 747SP. These simulations focus on how the unsteady ow eld inside and over the cavity interferes with the optical path and mounting structure of the telescope. A temporally fourth-order accurate Runge-Kutta, and spatially fth-order accurate WENO- 5Z scheme was used to perform implicit large eddy simulations. An immersed boundary method provides automated gridding for complex geometries and natural coupling to a block-structured Cartesian adaptive mesh re nement framework. Strong scaling studies using NASA's Pleiades supercomputer with up to 32k CPU cores and 4 billion compu- tational cells shows excellent scaling. Dynamic load balancing based on execution time on individual AMR blocks addresses irregular numerical cost associated with blocks con- taining boundaries. Limits to scaling beyond 32k cores are identi ed, and targeted code optimizations are discussed.

CFD↗
NASA NTRS2015

Parallel Adaptive High-Order CFD Simulations Characterizing SOFIA Cavitiy Acoustics

This paper presents large-scale MPI-parallel computational uid dynamics simulations for the Stratospheric Observatory for Infrared Astronomy (SOFIA). SOFIA is an airborne, 2.5-meter infrared telescope mounted in an open cavity in the aft fuselage of a Boeing 747SP. These simulations focus on how the unsteady ow eld inside and over the cavity interferes with the optical path and mounting structure of the telescope. A tempo- rally fourth-order accurate Runge-Kutta, and a spatially fth-order accurate WENO-5Z scheme were used to perform implicit large eddy simulations. An immersed boundary method provides automated gridding for complex geometries and natural coupling to a block-structured Cartesian adaptive mesh re nement framework. Strong scaling studies using NASA's Pleiades supercomputer with up to 32k CPU cores and 4 billion compu- tational cells shows excellent scaling. Dynamic load balancing based on execution time on individual AMR blocks addresses irregular numerical cost associated with blocks con- taining boundaries. Limits to scaling beyond 32k cores are identi ed, and targeted code optimizations are discussed.

Parallell↗