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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS2000

A Domain-Decomposed Multilevel Method for Adaptively Refined Cartesian Grids with Embedded Boundaries

Preliminary verification and validation of an efficient Euler solver for adaptively refined Cartesian meshes with embedded boundaries is presented. The parallel, multilevel method makes use of a new on-the-fly parallel domain decomposition strategy based upon the use of space-filling curves, and automatically generates a sequence of coarse meshes for processing by the multigrid smoother. The coarse mesh generation algorithm produces grids which completely cover the computational domain at every level in the mesh hierarchy. A series of examples on realistically complex three-dimensional configurations demonstrate that this new coarsening algorithm reliably achieves mesh coarsening ratios in excess of 7 on adaptively refined meshes. Numerical investigations of the scheme's local truncation error demonstrate an achieved order of accuracy between 1.82 and 1.88. Convergence results for the multigrid scheme are presented for both subsonic and transonic test cases and demonstrate W-cycle multigrid convergence rates between 0.84 and 0.94. Preliminary parallel scalability tests on both simple wing and complex complete aircraft geometries shows a computational speedup of 52 on 64 processors using the run-time mesh partitioner.

Aftosmis, M. J.↗
NASA NTRS1998

A Domain-Decomposed Multi-Level Method for Adaptively Refined Cartesian Grids with Embedded Boundaries

The work presents a new method for on-the-fly domain decomposition technique for mapping grids and solution algorithms to parallel machines, and is applicable to both shared-memory and message-passing architectures. It will be demonstrated on the Cray T3E, HP Exemplar, and SGI Origin 2000. Computing time has been secured on all these platforms. The decomposition technique is an outgrowth of techniques used in computational physics for simulations of N-body problems and the event horizons of black holes, and has not been previously used by the CFD community. Since the technique offers on-the-fly partitioning, it offers a substantial increase in flexibility for computing in heterogeneous environments, where the number of available processors may not be known at the time of job submission. In addition, since it is dynamic it permits the job to be repartitioned without global communication in cases where additional processors become available after the simulation has begun, or in cases where dynamic mesh adaptation changes the mesh size during the course of a simulation. The platform for this partitioning strategy is a completely new Cartesian Euler solver tarcreted at parallel machines which may be used in conjunction with Ames' "Cart3D" arbitrary geometry simulation package.

Aftosmis, M. J.↗
NASA NTRS2015

LAVA Applications to Open Rotors

Outline: LAVA (Launch Ascent Vehicle Aerodynamics); Introduction; Acoustics Related Applications; LAVA Applications to Open Rotor; Structured Overset Grids; Cartesian Grid with Immersed Boundary; High Speed Case; High Speed Case with Plate Low Speed Case.

Application↗
NASA NTRS1993

Fourier analysis of numerical algorithms for the Maxwell equations

The Fourier method is used to analyze the dispersive, dissipative, and isotropy errors of various spatial and time discretizations applied to the Maxwell equations on multi-dimensional grids. Both Cartesian grids and non-Cartesian grids based on hexagons and tetradecahedra are studied and compared. The numerical errors are quantitatively determined in terms of phase speed, wave number, propagation direction, gridspacings, and CFL number. The study shows that centered schemes are more efficient than upwind schemes. The non-Cartesian grids yield superior isotropy and higher accuracy than the Cartesian ones. For the centered schemes, the staggered grids produce less errors than the unstaggered ones. A new unstaggered scheme which has all the best properties is introduced. The study also demonstrates that a proper choice of time discretization can reduce the overall numerical errors due to the spatial discretization.

Liu, Yen↗
NASA NTRS1996

Euler Technology Assessment for Preliminary Aircraft Design: Compressibility Predictions by Employing the Cartesian Unstructured Grid SPLITFLOW Code

The objective of the second phase of the Euler Technology Assessment program was to evaluate the ability of Euler computational fluid dynamics codes to predict compressible flow effects over a generic fighter wind tunnel model. This portion of the study was conducted by Lockheed Martin Tactical Aircraft Systems, using an in-house Cartesian-grid code called SPLITFLOW. The Cartesian grid technique offers several advantages, including ease of volume grid generation and reduced number of cells compared to other grid schemes. SPLITFLOW also includes grid adaption of the volume grid during the solution to resolve high-gradient regions. The SPLITFLOW code predictions of configuration forces and moments are shown to be adequate for preliminary design, including predictions of sideslip effects and the effects of geometry variations at low and high angles-of-attack. The transonic pressure prediction capabilities of SPLITFLOW are shown to be improved over subsonic comparisons. The time required to generate the results from initial surface data is on the order of several hours, including grid generation, which is compatible with the needs of the design environment.

Finley, Dennis B.↗
NASA NTRS1995

Euler Technology Assessment program for preliminary aircraft design employing SPLITFLOW code with Cartesian unstructured grid method

This report documents results from the Euler Technology Assessment program. The objective was to evaluate the efficacy of Euler computational fluid dynamics (CFD) codes for use in preliminary aircraft design. Both the accuracy of the predictions and the rapidity of calculations were to be assessed. This portion of the study was conducted by Lockheed Fort Worth Company, using a recently developed in-house Cartesian-grid code called SPLITFLOW. The Cartesian grid technique offers several advantages for this study, including ease of volume grid generation and reduced number of cells compared to other grid schemes. SPLITFLOW also includes grid adaptation of the volume grid during the solution convergence to resolve high-gradient flow regions. This proved beneficial in resolving the large vortical structures in the flow for several configurations examined in the present study. The SPLITFLOW code predictions of the configuration forces and moments are shown to be adequate for preliminary design analysis, including predictions of sideslip effects and the effects of geometry variations at low and high angles of attack. The time required to generate the results from initial surface definition is on the order of several hours, including grid generation, which is compatible with the needs of the design environment.

Finley, Dennis B.↗
NASA NTRS1992

Two dimensional vernier

A two-dimensional vernier scale is disclosed utilizing a cartesian grid on one plate member with a polar grid on an overlying transparent plate member. The polar grid has multiple concentric circles at a fractional spacing of the spacing of the cartesian grid lines. By locating the center of the polar grid on a location on the cartesian grid, interpolation can be made of both the X and Y fractional relationship to the cartesian grid by noting which circles coincide with a cartesian grid line for the X and Y direction.

Juday, Richard D.↗
NASA NTRS1991

Kinematic domain decomposition for boundary-motion-induced flow simulations

A method is developed to solve the unsteady Navier-Stokes equations on a composite grid, which consists of subdomain grids moving with respect to each other. These subdomains are structured grids with different topologies. This method eliminates assuming the moving components to be instantaneously stationary, where deciding on the particular frozen instants is difficult and affects the solution adversely. Moreover, this method captures the boundary-motion-induced flow component. The method is demonstrated through a transonic flow past an airfoil, which experiences a combined motion of pitching and plunging. An O-grid around the airfoil is overlapped on a fine Cartesian grid, which is zonally embedded in a coarse Cartesian grid. The coarse grid is stationary but the other two grids are plunging. Only the O-grid is also sinusoidally pitching. The results are compared successfully with the experimental data.

Baysal, Oktay↗
DOE OSTI2022

Handing off the outcome of binary neutron star mergers for accurate and long-term postmerger simulations

In this work, we perform binary neutron star (BNS) merger simulations in full dynamical general relativity with IllinoisGRMHD, on a Cartesian grid with adaptive-mesh refinement. After the remnant black hole has become nearly stationary, the evolution of the surrounding accretion disk on Cartesian grids over long timescales (~1s) is suboptimal, as Cartesian coordinates over-resolve the angular coordinates at large distances, and the accreting plasma flows obliquely across coordinate lines dissipating angular momentum artificially from the disk. To address this, we present the HandOff, a set of computational tools that enables the transfer of general relativistic magnetohydrodynamic (GRMHD) and spacetime data from IllinoisGRMHD to harm3d, a GRMHD code that specializes in modeling black hole accretion disks in static spacetimes over long timescales, making use of general coordinate systems with spherical topology. We demonstrate that the handoff allows for a smooth and reliable transition of GRMHD fields and spacetime data, enabling us to efficiently and reliably evolve BNS dynamics well beyond merger. We also discuss future plans, which involve incorporating advanced equations of state and neutrino physics into BNS simulations using the HandOff approach.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1992

Cartesian based grid generation/adaptive mesh refinement

Grid adaptation has recently received attention in the computational fluid dynamics (CFD) community as a means to capture the salient features of a flowfield by either moving grid points of a structured or by adding cells in an unstructured manner. An approach based on a background cartesian mesh is investigated from which the geometry is 'cut' out of the mesh. Once the mesh is obtained, a solution on this coarse grid is found, that indicates which cells need to be refined. This process of refining/solving continues until the flow is grid refined in terms of a user specified global parameter (such as drag coefficient etc.). The advantages of this approach are twofold: the generation of the base grid is independent of the topology of the bodies or surfaces around/through which the flow is to be computed, and the resulting grid (in uncut regions) is highly isotropic, so that the truncation error is low. The flow solver (which, along with the grid generation is still under development) uses a completely unstructured data base, and is a finite volume, upwinding scheme. Current and future work will address generating Navier-Stokes suitable grids by using locally aligned and normal face/cell refining. The attached plot shows a simple grid about two turbine blades.

Coirier, William J.↗
NASA NTRS1996

A Multigrid Algorithm for Immersed Interface Problems

Many physical problems involve interior interfaces across which the coefficients in the problem, the solution, its derivatives, the flux, or the source term may have jumps. These interior interfaces may or may not align with a underlying Cartesian grid. Zhilin Li, in his dissertation, showed how to discretize such elliptic problems using only a Cartesian grid and the known jump conditions to second order accuracy. In this paper, we describe how to apply the full multigrid algorithm in this context. In particular, the restriction, interpolation, and coarse grid problem will be described. Numerical results for several model problems are given to demonstrate that good rates can be obtained even when jumps in the coefficients are large and do not align with the grid.

Adams, Loyce↗
NASA NTRS1996

An Efficient Means of Adaptive Refinement Within Systems of Overset Grids

An efficient means of adaptive refinement within systems of overset grids is presented. Problem domains are segregated into near-body and off-body fields. Near-body fields are discretized via overlapping body-fitted grids that extend only a short distance from body surfaces. Off-body fields are discretized via systems of overlapping uniform Cartesian grids of varying levels of refinement. a novel off-body grid generation and management scheme provides the mechanism for carrying out adaptive refinement of off-body flow dynamics and solid body motion. The scheme allows for very efficient use of memory resources, and flow solvers and domain connectivity routines that can exploit the structure inherent to uniform Cartesian grids.

Meakin, Robert L.↗
NASA NTRS1994

Thermocapillary motion of deformable drops

The thermocapillary motion of initially spherical drops/bubbles driven by a constant temperature gradient in an unbounded liquid medium is simulated numerically. Effects of convection of momentum and energy, as well as shape deformations, are addressed. The method used is based on interface tracking on a base cartesian grid, and uses a smeared color or indicator function for the determination of the surface topology. Quad-tree adaptive refinement of the cartesian grid is implemented to enhance the fidelity of the surface tracking. It is shown that convection of energy results in a slowing of the drop, as the isotherms get wrapped around the front of the drop. Shape deformation resulting from inertial effects affect the migration velocity. The physical results obtained are in agreement with the existing literature. Furthermore, remarks are made on the sensitivity of the calculated solutions to the smearing of the fluid properties. Analysis and simulations show that the migration velocity depends very strongly on the smearing of the interfacial force whereas it is rather insensitive to the smearing of other properties, hence the adaptive grid.

Haj-Hariri, Hossein↗
NASA NTRS1996

The Multigrid-Mask Numerical Method for Solution of Incompressible Navier-Stokes Equations

A multigrid-mask method for solution of incompressible Navier-Stokes equations in primitive variable form has been developed. The main objective is to apply this method in conjunction with the pseudospectral element method solving flow past multiple objects. There are two key steps involved in calculating flow past multiple objects. The first step utilizes only Cartesian grid points. This homogeneous or mask method step permits flow into the interior rectangular elements contained in objects, but with the restriction that the velocity for those Cartesian elements within and on the surface of an object should be small or zero. This step easily produces an approximate flow field on Cartesian grid points covering the entire flow field. The second or heterogeneous step corrects the approximate flow field to account for the actual shape of the objects by solving the flow field based on the local coordinates surrounding each object and adapted to it. The noise occurring in data communication between the global (low frequency) coordinates and the local (high frequency) coordinates is eliminated by the multigrid method when the Schwarz Alternating Procedure (SAP) is implemented. Two dimensional flow past circular and elliptic cylinders will be presented to demonstrate the versatility of the proposed method. An interesting phenomenon is found that when the second elliptic cylinder is placed in the wake of the first elliptic cylinder a traction force results in a negative drag coefficient.

Ku, Hwar-Ching↗