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 253 records · Page 14

Quantitative Approach for the Accurate CFD Simulation of Hover in Turbulent Flow

Time-dependent Navier-Stokes simulations have been carried out for a V22 rotor in hover using an improved, low-diffusion, HLLE++ upwind algorithm in the OVERFLOW code. Emphasis is placed on lessons learned over the past decade regarding the effects of high-order spatial accuracy, grid resolution, and the use of detached eddy simulation in predicting the rotor performance, i.e., figure-of-merit (FM). A quick-start procedure is described together with a statistical measure of FM convergence that reduces hover computations by 5 times, similar in computational work for forward flight. Furthermore, Cartesian adaptive mesh refinement in the rotor wake revealed a complex turbulent flow with worm-like structures of various scales. These turbulent worms, found computationally more than a decade ago, have recently been observed in a separate German Aerospace Center (DLR) experiment. Moreover, adaptive mesh refinement has been used to resolve the tip-vortex to its correct physical size.

Neal M. Chaderjian↗

Telerobotics - Display, control, and communication problems

An experimental telerobotics simulation is described suitable for studying human operator (HO) performance. Simple manipulator pick-and-place and tracking tasks allowed quantitative comparison of a number of calligraphic display viewing conditions. An enhanced perspective display was effective with a reference line from target to base, with or without a complex three-dimensional grid framing the view. This was true especially if geometrical display parameters such as azimuth and elevation were arranged to be near optimal. Quantitative comparisons were made possible, utilizing control performance measures such as root mean square error. There was a distinct preference for controlling the manipulator in end-effector Cartesian space for the primitive pick-and-place task, rather than controlling joint angles and then, via direct kinematis, the end-effector position. An introduced communication delay was found to produce decrease in performance. In considerable part, this difficulty could be compensated for by preview control information. The fact that neurological control of normal human movement contains a sampled data period of 0.2 s may relate to this robustness of HO control to delay.

Stark, Lawrence↗

Analysis of three-dimensional viscous flow in a supersonic throughflow fan

A 3-D Navier-Stokes code was developed for analysis of turbomachinery blade rows and other internal flows. The Navier-Stokes equations are written in a Cartesian coordinate system rotating about the x-axis, and then mapped to a general body-fitted coordinate system. Streamwise viscous terms are neglected using the thin layer assumption, and turbulence effects are modelled using the Baldwin-Lomax turbulence model. The equations are discretized using finite differences on stacked C-type grids and are solved using a multistage Runge-Kutta algorithm with a spatially varying time step and implicit residual smoothing. Calculations were made of the flow around a supersonic throughflow fan blade. The fan was designed as a key component in a supersonic cruise engine. The 3-D calculations were done on a 129x29x33 grid and took 50 minutes of cpu time. Comparisons with the quasi-3-D results show minor differences in loading due to 3-D effects. Particle traces show nearly 2-D flows near the pressure surface, but large secondary flows within the suction surface boundary layer. The horseshoe vortex ahead of the leading edge is clearly seen.

Chima, Rodrick V.↗

Numerical analysis of three-dimensional viscous internal flows

A 3-D Navier-Stokes code has been developed for analysis of turbomachinery blade rows and other internal flows. The Navier-Stokes equations are written in a Cartesian coordinate system rotating about the x-axis, and then mapped to a general body-fitted coordinate system. Streamwise viscous terms are neglected using the thin-layer assumption, and turbulence effects are modeled using the Baldwin-Lomax turbulence model. The equations are discretized using finite differences on stacked C-type grids and are solved using a multistage Runge-Kutta algorithm with a spatially-varying time step and implicit residual smoothing. Calculations have been made of a horseshoe vortex formed in front of a flat plate with a round leading edge standing in a turbulent endwall boundary layer. Comparisons are made with experimental data taken by Eckerle and Langston for a circular cylinder under similar conditions. Computer and measured results are compared in terms of endwall flow visualization pictures and total pressure loss contours and vector plots on the symmetry plane. Calculated details of the primary vortex show excellent agreement with the experimental data. The calculations also show a small secondary vortex not seen experimentally.

Chima, Rodrick V.↗

Numerical analysis of three-dimensional viscous internal flows

A 3-D Navier-Stokes code has been developed for analysis of turbomachinery blade rows and other internal flows. The Navier-Stokes equations are written in a Cartesian coordinate system rotating about the x-axis, and then mapped to a general body-fitted coordinate system. Streamwise viscous terms are neglected using the thin-layer assumption, and turbulence effects are modeled using the Baldwin-Lomax turbulence model. The equations are discretized using finite differences on stacked C-type grids and are solved using a multistage Runge-Kutta algorithm with a spatially-varying time step and implicit residual smoothing. Calculations have been made of a horseshoe vortex formed in front of a flat plate with a round leading edge standing in a turbulent endwall boundary layer. Comparisons are made with experimental data taken by Eckerle and Langston for a circular cylinder under similar conditions. Computer and measured results are compared in terms of endwall flow visualization pictures and total pressure loss contours and vector plots on the symmetry plane. Calculated details of the primary vortex show excellent agreement with the experimental data. The calculations also show a small secondary vortex not seen experimentally.

Chima, Rodrick V.↗

Fully-coupled analysis of jet mixing problems. Three-dimensional PNS model, SCIP3D

Numerical procedures formulated for the analysis of 3D jet mixing problems, as incorporated in the computer model, SCIP3D, are described. The overall methodology closely parallels that developed in the earlier 2D axisymmetric jet mixing model, SCIPVIS. SCIP3D integrates the 3D parabolized Navier-Stokes (PNS) jet mixing equations, cast in mapped cartesian or cylindrical coordinates, employing the explicit MacCormack Algorithm. A pressure split variant of this algorithm is employed in subsonic regions with a sublayer approximation utilized for treating the streamwise pressure component. SCIP3D contains both the ks and kW turbulence models, and employs a two component mixture approach to treat jet exhausts of arbitrary composition. Specialized grid procedures are used to adjust the grid growth in accordance with the growth of the jet, including a hybrid cartesian/cylindrical grid procedure for rectangular jets which moves the hybrid coordinate origin towards the flow origin as the jet transitions from a rectangular to circular shape. Numerous calculations are presented for rectangular mixing problems, as well as for a variety of basic unit problems exhibiting overall capabilities of SCIP3D.

Wolf, D. E.↗

A compact solution to computational acoustics

This paper demonstrates that the linearized, dimensional Euler equations for acoustic computation can be accurately solved as a set of decoupled first-order wave equations, and that if ordered properly, this system of simple waves has unambiguous, easily implemented boundary conditions, allowing waves of same group speeds to pass through numerical boundaries or comply with wall conditions. Thus, the task of designing a complex multi-dimensional scheme with approximate far-field boundary conditions reduces to the design of higher order schemes for the one-dimensional simple wave equation. A compact finite-difference scheme and a characteristically exact but numerically n(th) order accurate boundary condition are introduced for solving the first order wave equation. Spanning a three-point two-level stencil, this low-dispersion implicit scheme has a third order spatial accuracy when used on nonuniform meshes, fourth order accurate on uniform meshes, and a temporal accuracy of second order due to the choice of trapezoidal integration for algorithmic simplicity. The robustness and accuracy of the scheme are demonstrated through a series of numerical experiments and comparisons with published results. When tested on the one-dimensional wave equation on a uniform grid, this scheme allows a Gaussian wave packet to pass through any finite domain with low numerical dispersion characteristic of a spatially fourth-order scheme and reflections at numerical boundaries maintained below truncation error. On highly stretched and irregular grids, only mild dispersions are found in the solution while solutions by other methods fail or are severely distorted. Yet, this scheme is no more sophisticated to solve or implement than the Crank-Nicolson scheme. This scheme has been tested on four categories of the ICASE/LaRC benchmark problems, which include propagation of acoustic and convective waves in Cartesian and cylindrical domains, reflection of acoustic wave at stationary/moving boundaries, and sound generation by gust-blade interaction.

Fung, K.-Y.↗

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 Numerical Method for Direct Simulation of Turbulence in Complex Geometries

The ultimate goal of this work is to study the flow inside a channel with riblets on one of the two walls. The method has been tested for two dimensional flows in the presence of bodies with a geometrical singularity and for three dimensional flows inside domains described by Cartesian coordinates. The results have been compared with previous numerical simulations and with experimental results. The cases considered are: (1) the growth of Orr-Sommerfield waves in plane Poiseulle flow; (2) the flow over a backward facing step; (3) the flow past a wedge; and (4) the flow inside a narrow channel. Finally, the case of a channel with two large riblets on a wall has been simulated. In this case a limited number of grid points is sufficient, and in spite of the slow convergence for the pressure solver, one is able to obtain solutions with a reasonable amount of computer time. At present solutions with very fine grids in all three directions can not be obtained, due to lack of a fast pressure solver for general curvilinear coordinates.

P Orlandi↗

Emerging CFD technologies and aerospace vehicle design

With the recent focus on the needs of design and applications CFD, research groups have begun to address the traditional bottlenecks of grid generation and surface modeling. Now, a host of emerging technologies promise to shortcut or dramatically simplify the simulation process. This paper discusses the current status of these emerging technologies. It will argue that some tools are already available which can have positive impact on portions of the design cycle. However, in most cases, these tools need to be integrated into specific engineering systems and process cycles to be used effectively. The rapidly maturing status of unstructured and Cartesian approaches for inviscid simulations makes suggests the possibility of highly automated Euler-boundary layer simulations with application to loads estimation and even preliminary design. Similarly, technology is available to link block structured mesh generation algorithms with topology libraries to avoid tedious re-meshing of topologically similar configurations. Work in algorithmic based auto-blocking suggests that domain decomposition and point placement operations in multi-block mesh generation may be properly posed as problems in Computational Geometry, and following this approach may lead to robust algorithmic processes for automatic mesh generation.

Aftosmis, Michael J.↗

Fluid-Structure Interaction Simulations of the ASPIRE SR01 Supersonic Parachute

High-fidelity computational fluid dynamics (CFD) simulations have so far only played exploratory and supporting roles in the study and qualification of parachutes for planetary entry. The last few years have seen the maturation of coupled computational methods that are capable of modeling the complex fluid-structure interactions between a parachute canopy and the supersonic flow in the wake of an entry vehicle in flight conditions. One of the primary goals of these methods is to predict the peak opening load experienced by the parachute during inflation. The Launch, Ascent, and Vehicle Aerodynamics (LAVA)team is developing efficient, high-fidelity numerical methods to perform such challenging fluid-structure interaction simulations. A loose coupling approach is used to advance the solutions of a Cartesian ghost cell immersed boundary method CFD solver and a finite element computational structural dynamics (CSD) solver in space and time. The coupled solver is employed to simulate the ASPIRE SR01 flight test, where a build-to-print version of the Mars Science Laboratory parachute was inflated in supersonic conditions in the upper terrestrial atmosphere. The simulations conducted in the current paper predict a peak opening load that is within 10% of that from the flight test. Grid convergence with respect to the volume and structural domains is demonstrated, and less than 1% variation in the peak opening load is predicted between all grid resolutions.

ARMD↗

An evaluation of three spatial differencing schemes for the discrete ordinates method in participating media

Three popular spatial differencing schemes for the discrete ordinates method are examined for two-dimensional Cartesian coordinates system. These are a positive, the step, and the diamond schemes. Contrary to the common belief that negative intensities will not occur when fine spatial discretization is used with the diamond scheme, under certain conditions, the diamond scheme will produce negative intensities irrespective of the number of control volums employed. The positive scheme can produce physically unrealistic trends. The diamond and positive schemes are also capable of producing physically unrealistic overshoots. In absorbing-emitting or absorbing-emitting-scattering media, grid refinement can result in negative intensities when the diamond or positive scheme is used.

Chai, John C.↗

Progress Towards a Cartesian Cut-Cell Method for Viscous Compressible Flow

The proposed paper reports advances in developing a method for high Reynolds number compressible viscous flow simulations using a Cartesian cut-cell method with embedded boundaries. This preliminary work focuses on accuracy of the discretization near solid wall boundaries. A model problem is used to investigate the accuracy of various difference stencils for second derivatives and to guide development of the discretization of the viscous terms in the Navier-Stokes equations. Near walls, quadratic reconstruction in the wall-normal direction is used to mitigate mesh irregularity and yields smooth skin friction distributions along the body. Multigrid performance is demonstrated using second-order coarse grid operators combined with second-order restriction and prolongation operators. Preliminary verification and validation for the method is demonstrated using flat-plate and airfoil examples at compressible Mach numbers. Simulations of flow on laminar and turbulent flat plates show skin friction and velocity profiles compared with those from boundary-layer theory. Airfoil simulations are performed at laminar and turbulent Reynolds numbers with results compared to both other simulations and experimental data

Berger, Marsha↗

NASA Tech Briefs, September 2006

Topics covered include: Improving Thermomechanical Properties of SiC/SiC Composites; Aerogel/Particle Composites for Thermoelectric Devices; Patches for Repairing Ceramics and Ceramic- Matrix Composites; Lower-Conductivity Ceramic Materials for Thermal-Barrier Coatings; An Alternative for Emergency Preemption of Traffic Lights; Vehicle Transponder for Preemption of Traffic Lights; Automated Announcements of Approaching Emergency Vehicles; Intersection Monitor for Traffic-Light-Preemption System; Full-Duplex Digital Communication on a Single Laser Beam; Stabilizing Microwave Frequency of a Photonic Oscillator; Microwave Oscillators Based on Nonlinear WGM Resonators; Pointing Reference Scheme for Free-Space Optical Communications Systems; High-Level Performance Modeling of SAR Systems; Spectral Analysis Tool 6.2 for Windows; Multi-Platform Avionics Simulator; Silicon-Based Optical Modulator with Ferroelectric Layer; Multiplexing Transducers Based on Tunnel-Diode Oscillators; Scheduling with Automated Resolution of Conflicts; Symbolic Constraint Maintenance Grid; Discerning Trends in Performance Across Multiple Events; Magnetic Field Solver; Computing for Aiming a Spaceborne Bistatic- Radar Transmitter; 4-Vinyl-1,3-Dioxolane-2-One as an Additive for Li-Ion Cells; Probabilistic Prediction of Lifetimes of Ceramic Parts; STRANAL-PMC Version 2.0; Micromechanics and Piezo Enhancements of HyperSizer; Single-Phase Rare-Earth Oxide/Aluminum Oxide Glasses; Tilt/Tip/Piston Manipulator with Base-Mounted Actuators; Measurement of Model Noise in a Hard-Wall Wind Tunnel; Loci-STREAM Version 0.9; The Synergistic Engineering Environment; Reconfigurable Software for Controlling Formation Flying; More About the Tetrahedral Unstructured Software System; Computing Flows Using Chimera and Unstructured Grids; Avoiding Obstructions in Aiming a High-Gain Antenna; Analyzing Aeroelastic Stability of a Tilt-Rotor Aircraft; Tracking Positions and Attitudes of Mars Rovers; Stochastic Evolutionary Algorithms for Planning Robot Paths; Compressible Flow Toolbox; Rapid Aeroelastic Analysis of Blade Flutter in Turbomachines; General Flow-Solver Code for Turbomachinery Applications; Code for Multiblock CFD and Heat-Transfer Computations; Rotating-Pump Design Code; Covering a Crucible with Metal Containing Channels; Repairing Fractured Bones by Use of Bioabsorbable Composites; Kalman Filter for Calibrating a Telescope Focal Plane; Electronic Absolute Cartesian Autocollimator; Fiber-Optic Gratings for Lidar Measurements of Water Vapor; Simulating Responses of Gravitational-Wave Instrumentation; SOFTC: A Software Correlator for VLBI; Progress in Computational Simulation of Earthquakes; Database of Properties of Meteors; Computing Spacecraft Solar-Cell Damage by Charged Particles; Thermal Model of a Current-Carrying Wire in a Vacuum; Program for Analyzing Flows in a Complex Network; Program Predicts Performance of Optical Parametric Oscillators; Processing TES Level-1B Data; Automated Camera Calibration; Tracking the Martian CO2 Polar Ice Caps in Infrared Images; Processing TES Level-2 Data; SmaggIce Version 1.8; Solving the Swath Segment Selection Problem; The Spatial Standard Observer; Less-Complex Method of Classifying MPSK; Improvement in Recursive Hierarchical Segmentation of Data; Using Heaps in Recursive Hierarchical Segmentation of Data; Tool for Statistical Analysis and Display of Landing Sites; Automated Assignment of Proposals to Reviewers; Array-Pattern-Match Compiler for Opportunistic Data Analysis; Pre-Processor for Compression of Multispectral Image Data; Compressing Image Data While Limiting the Effects of Data Losses; Flight Operations Analysis Tool; Improvement in Visual Target Tracking for a Mobile Robot; Software for Simulating Air Traffic; Automated Vectorization of Decision-Based Algorithms; Grayscale Optical Correlator Workbench; "One-Stop Shopping" for Ocean Remote-Sensing and Model Data; State Analysis Database Tool; Generating CAHV and CAHVOmages with Shadows in ROAMS; Improving UDP/IP Transmission Without Increasing Congestion; FORTRAN Versions of Reformulated HFGMC Codes; Program for Editing Spacecraft Command Sequences; Flight-Tested Prototype of BEAM Software; Mission Scenario Development Workbench; Marsviewer; Tool for Analysis and Reduction of Scientific Data; ASPEN Version 3.0; Secure Display of Space-Exploration Images; Digital Front End for Wide-Band VLBI Science Receiver; Multifunctional Tanks for Spacecraft; Lightweight, Segmented, Mostly Silicon Telescope Mirror; Assistant for Analyzing Tropical-Rain-Mapping Radar Data; and Anion-Intercalating Cathodes for High-Energy- Density Cells.

Source record↗

Software for Automated Generation of Cartesian Meshes

Cart3D is a collection of computer programs for generating Cartesian meshes [for computational fluid dynamics (CFD) and other applications] in volumes bounded by solid objects. Aspects of Cart3D at earlier stages of development were reported in "Robust and Efficient Generation of Cartesian Meshes for CFD" (ARC-14275), NASA Tech Briefs, Vol. 23, No. 8 (August 1999), page 30. The geometric input to Cart3D comprises surface triangulations like those commonly generated by computer-aided-design programs. Complexly shaped objects can be represented as assemblies of simpler ones. Cart3D deletes all portions of such an assembled object that are not on the exterior surface. Intersections between components are preserved in the resulting triangulation. A tie-breaking routine unambiguously resolves geometric degeneracies. Then taking the intersected surface triangulation as input, the volume mesh is generated through division of cells of an initially coarse hexahedral grid. Cells are subdivided to refine the grid in regions of increased surface curvature and/or increased flow gradients. Cells that become split into multiple unconnected regions by thin pieces of surface are identified.

Aftosmis, Michael J.↗

Cart3D Simulations for the First AIAA Sonic Boom Prediction Workshop

Simulation results for the First AIAA Sonic Boom Prediction Workshop (LBW1) are presented using an inviscid, embedded-boundary Cartesian mesh method. The method employs adjoint-based error estimation and adaptive meshing to automatically determine resolution requirements of the computational domain. Results are presented for both mandatory and optional test cases. These include an axisymmetric body of revolution, a 69deg delta wing model and a complete model of the Lockheed N+2 supersonic tri-jet with V-tail and flow through nacelles. In addition to formal mesh refinement studies and examination of the adjoint-based error estimates, mesh convergence is assessed by presenting simulation results for meshes at several resolutions which are comparable in size to the unstructured grids distributed by the workshop organizers. Data provided includes both the pressure signals required by the workshop and information on code performance in both memory and processing time. Various enhanced techniques offering improved simulation efficiency will be demonstrated and discussed.

Predictions↗

The method of lines in analyzing solids containing cracks

A semi-numerical method is reviewed for solving a set of coupled partial differential equations subject to mixed and possibly coupled boundary conditions. The line method of analysis is applied to the Navier-Cauchy equations of elastic and elastoplastic equilibrium to calculate the displacement distributions in various, simple geometry bodies containing cracks. The application of this method to the appropriate field equations leads to coupled sets of simultaneous ordinary differential equations whose solutions are obtained along sets of lines in a discretized region. When decoupling of the equations and their boundary conditions is not possible, the use of a successive approximation procedure permits the analytical solution of the resulting ordinary differential equations. The use of this method is illustrated by reviewing and presenting selected solutions of mixed boundary value problems in three dimensional fracture mechanics. These solutions are of great importance in fracture toughness testing, where accurate stress and displacement distributions are required for the calculation of certain fracture parameters. Computations obtained for typical flawed specimens include that for elastic as well as elastoplastic response. Problems in both Cartesian and cylindrical coordinate systems are included. Results are summarized for a finite geometry rectangular bar with a central through-the-thickness or rectangular surface crack under remote uniaxial tension. In addition, stress and displacement distributions are reviewed for finite circular bars with embedded penny-shaped cracks, and rods with external annular or ring cracks under opening mode tension. The results obtained show that the method of lines presents a systematic approach to the solution of some three-dimensional mechanics problems with arbitrary boundary conditions. The advantage of this method over other numerical solutions is that good results are obtained even from the use of a relatively coarse grid.

Gyekenyesi, John P.↗