SEARCH · Engineering Papers

Results for “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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 307 records · Page 17

All sources NASA NTRS DOE OSTI

NASA NTRS1981

Two-boundary grid generation for the solution of the three dimensional compressible Navier-Stokes equations

A grid generation technique called the two boundary technique is developed and applied for the solution of the three dimensional Navier-Stokes equations. The Navier-Stokes equations are transformed from a cartesian coordinate system to a computational coordinate system, and the grid generation technique provides the Jacobian matrix describing the transformation. The two boundary technique is based on algebraically defining two distinct boundaries of a flow domain and the distribution of the grid is achieved by applying functions to the uniform computational grid which redistribute the computational independent variables and consequently concentrate or disperse the grid points in the physical domain. The Navier-Stokes equations are solved using a MacCormack time-split technique. Grids and supersonic laminar flow solutions are obtained for a family of three dimensional corners and two spike-nosed bodies.

Smith, R. E.↗

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 NTRS1983

Evaluation of truncation error and adaptive grid generation for the transonic full potential flow calculations

The effects of truncation error on the numerical solution of transonic flows using the full potential equation are studied. The effects of adapting grid point distributions to various solution aspects including shock waves is also discussed. A conclusion is that a rapid change of grid spacing is damaging to the accuracy of the flow solution. Therefore, in a solution adaptive grid application an optimal grid is obtained as a tradeoff between the amount of grid refinement and the rate of grid stretching.

Nakamura, S.↗

NASA NTRS1983

Multiple-grid convergence acceleration of viscous and inviscid flow computations

A multiple-grid algorithm for use in efficiently obtaining steady solution to the Euler and Navier-Stokes equations is presented. The convergence of a simple, explicit fine-grid solution procedure is accelerated on a sequence of successively coarser grids by a coarse-grid information propagation method which rapidly eliminates transients from the computational domain. This use of multiple-gridding to increase the convergence rate results in substantially reduced work requirements for the numerical solution of a wide range of flow problems. Computational results are presented for subsonic and transonic inviscid flows and for laminar and turbulent, attached and separated, subsonic viscous flows. Work reduction factors as large as eight, in comparison to the basic fine-grid algorithm, were obtained. Possibilities for further performance improvement are discussed.

Johnson, G. M.↗

NASA NTRS1982

Idealized dynamic grid computation of physical systems

The construction and utility of an idealized computational space for finite-difference computation of physical systems are considered. All computations are performed in tau space, which at any instant represents the dynamic grid of a subject physical system appropriately stretched into a uniform, orthogonal grid. A strain field model of physical system is described, including the sample computation of strain density fields. Dynamic grid generation using invariant-mapping is addressed, and the tau computational space is considered, including a grid dynamism constraint, a grid orthogonality constraint, and a grid smoothness constraint. The detailed tau computational space method is presented and illustrated with two sample problems.

Anyiwo, J. C.↗

NASA NTRS1983

Efficient solution of the Euler and Navier-Stokes equations with a vectorized multiple-grid algorithm

A multiple-grid algorithm for use in efficiently obtaining steady solutions to the Euler and Navier-Stokes equations is presented. The convergence of the explicit MacCormack algorithm on a fine grid is accelerated by propagating transients from the domain using a sequence of successively coarser grids. Both the fine and coarse grid schemes are readily vectorizable. The combination of multiple-gridding and vectorization results in substantially reduced computational times for the numerical solution of a wide range of flow problems. Results are presented for subsonic, transonic, and supersonic inviscid flows and for subsonic attached and separated laminar viscous flows. Work reduction factors over a scalar, single-grid algorithm range as high as 76.8. Previously announced in STAR as N83-24467

Chima, R. V.↗

NASA NTRS1983

Automatic adaptive grid refinement for the Euler equations

A method of adaptive grid refinement for the solution of the steady Euler equations for transonic flow is presented. Algorithm automatically decides where the coarse grid accuracy is insufficient, and creates locally uniform refined grids in these regions. This typically occurs at the leading and trailing edges. The solution is then integrated to steady state using the same integrator (FLO52) in the interior of each grid. The boundary conditions needed on the fine grids are examined and the importance of treating the fine/coarse grid inerface conservatively is discussed. Numerical results are presented.

Berger, M. J.↗

NASA NTRS1984

A practical adaptive-grid method for complex fluid-flow problems

A practical solution, adaptive-grid method utilizing a tension and torsion spring analogy is proposed for multidimensional fluid flow problems. The tension spring, which connects adjacent grid points to each other, controls grid spacings. The torsion spring, which is attached to each grid node, controls inclinations of coordinate lines and grid skewness. A marching procedure was used that results in a simple tridiagonal system of equations at each coordinate line to determine grid-point distribution. Multidirectional adaptation is achieved by successive applications of one-dimensional adaptation. Examples of applications for axisymmetric afterbody flow fields and two dimensional transonic airfoil flow fields are shown.

Nakahashi, K.↗

NASA NTRS1983

Adaptive grid relocation algorithms for transonic full potential calculations using one-dimensional or two-dimensional diffusion equation

The effect of solution-adaptive grids using an interpolative grid relocation algorithm on two-dimensional transonic full potential flow calculations is studied with extensions to three dimensions in mind. One-dimensional or two-dimensional diffusion equation is solved to obtain the grid density control function for generating adaptive grids. The results of flow solution for NACA-0012 and Gates-Leajet airfoils show a significant improvement of accuracy in the CP distributions. However, further studies are recommended on the questions (1) what information from the initial flow solution should be passed on to the solution-adaptive grid generation scheme, and (2) how to optimize the accuracy of the solution through the use of adaptive grids.

Nakamura, S.↗

NASA NTRS1983

A chimera grid scheme

A mesh system composed of multiple overset body-conforming grids is described for adapting finite-difference procedures to complex aircraft configurations. In this so-called 'chimera mesh,' a major grid is generated about a main component of the configuration and overset minor grids are used to resolve all other features. Methods for connecting overset multiple grids and modifications of flow-simulation algorithms are discussed. Computational tests in two dimensions indicate that the use of multiple overset grids can simplify the task of grid generation without an adverse effect on flow-field algorithms and computer code complexity.

Steger, J. L.↗

NASA NTRS1983

Multiple-grid convergence acceleration of viscous and inviscid flow computations

A multiple-grid algorithm for use in efficiently obtaining steady solution to the Euler and Navier-Stokes equations is presented. The convergence of a simple, explicit fine-grid solution procedure is accelerated on a sequence of successively coarser grids by a coarse-grid information propagation method which rapidly eliminates transients from the computational domain. This use of multiple-gridding to increase the convergence rate results is substantially reduced work requirements for the numerical solution of a wide range of flow problems. Computational results are presented for subsonic and transonic inviscid flows and for laminar and turbulent, attached and separated, subsonic viscous flows. Work reduction factors as large as eight, in comparison to the basic fine-grid algorithm, were obtained. Possibilities for further performance improvement are discussed. Previously announced in STAR as N83-21847

Johnson, G. M.↗

NASA NTRS1984

Development of a dynamically adaptive grid method for multidimensional problems

An approach to solution adaptive grid generation for use with finite difference techniques, previously demonstrated on model problems in one space dimension, has been extended to multidimensional problems. The method is based on the popular elliptic steady grid generators, but is 'dynamically' adaptive in the sense that a grid is maintained at all times satisfying the steady grid law driven by a solution-dependent source term. Testing has been carried out on Burgers' equation in one and two space dimensions. Results appear encouraging both for inviscid wave propagation cases and viscous boundary layer cases, suggesting that application to practical flow problems is now possible. In the course of the work, obstacles relating to grid correction, smoothing of the solution, and elliptic equation solvers have been largely overcome. Concern remains, however, about grid skewness, boundary layer resolution and the need for implicit integration methods. Also, the method in 3-D is expected to be very demanding of computer resources.

Holcomb, J. E.↗

NASA NTRS1985

Noniterative three-dimensional grid generation using parabolic partial differential equations

A new algorithm for generating three-dimensional grids has been developed and implemented which numerically solves a parabolic partial differential equation (PDE). The solution procedure marches outward in two coordinate directions, and requires inversion of a scalar tridiagonal system in the third. Source terms have been introduced to control the spacing and angle of grid lines near the grid boundaries, and to control the outer boundary point distribution. The method has been found to generate grids about 100 times faster than comparable grids generated via solution of elliptic PDEs, and produces smooth grids for finite-difference flow calculations.

Edwards, T. A.↗

NASA NTRS1985

Automatic adaptive grid refinement for the Euler equations

A method of adaptive grid refinement for the solution of the steady Euler equations for transonic flow is presented. Algorithm automatically decides where the coarse grid accuracy is insufficient, and creates locally uniform refined grids in these regions. This typically occurs at the leading and trailing edges. The solution is then integrated to steady state using the same integrator (FL052) in the interior of each grid. The boundary conditions needed on the fine grids are examined and the importance of treating the fine/coarse grid interface conservatively is discussed. Numerical results are presented.

Berger, M. J.↗

NASA NTRS1986

Elliptic generation of composite three-dimensional grids about realistic aircraft

An elliptic method for generating composite grids about realistic aircraft is presented. A body-conforming grid is first generated about the entire aircraft by the solution of Poisson's differential equation. This grid has relatively coarse spacing, and it covers the entire physical domain. At boundary surfaces, cell size is controlled and cell skewness is nearly eliminated by inhomogeneous terms, which are found automatically by the program. Certain regions of the grid in which high gradients are expected, and which map into rectangular solids in the computational domain, are then designated for zonal refinement. Spacing in the zonal grids is reduced by adding points with a simple, algebraic scheme. Details of the grid generation method are presented along with results of the present application, a wing-body configuration based on the F-16 fighter aircraft.

Sorenson, R. L.↗

NASA NTRS1987

An overview of controls research on the NASA Langley Research Center grid

The NASA Langley Research Center has assembled a flexible grid on which control systems research can be accomplished on a two-dimensional structure that has many physically distributed sensors and actuators. The grid is a rectangular planar structure that is suspended by two cables attached to one edge so that out of plane vibrations are normal to gravity. There are six torque wheel actuators mounted to it so that torque is produced in the grid plane. Also, there are six rate gyros mounted to sense angular motion in the grid plane and eight accelerometers that measure linear acceleration normal to the grid plane. All components can be relocated to meet specific control system test requirements. Digital, analog, and hybrid control systems capability is provided in the apparatus. To date, research on this grid has been conducted in the areas of system and parameter identification, model estimation, distributed modal control, hierarchical adaptive control, and advanced redundancy management algorithms. The presentation overviews each technique and presents the most significant results generated for each area.

Montgomery, Raymond C.↗

NASA NTRS1987

Grid generation and inviscid flow computation about cranked-winged airplane geometries

An algebraic grid generation procedure that defines a patched multiple-block grid system suitable for fighter-type aircraft geometries with fuselage and engine inlet, canard or horizontal tail, cranked delta wing and vertical fin has been developed. The grid generation is based on transfinite interpolation and requires little computational power. A finite-volume Euler solver using explicit Runge-Kutta time-stepping has been adapted to this grid system and implemented on the VPS-32 vector processor with a high degree of vectorization. Grids are presented for an experimental aircraft with fuselage, canard, 70-20-cranked wing, and vertical fin. Computed inviscid compressible flow solutions are presented for Mach 2 at 3.79, 7 and 10 deg angles of attack. Conmparisons of the 3.79 deg computed solutions are made with available full-potential flow and Euler flow solutions on the same configuration but with another grid system. The occurrence of an unsteady solution in the 10 deg angle of attack case is discussed.

Eriksson, L.-E.↗

NASA NTRS1987

On the use of composite grid schemes in computational aerodynamics

Some of the composite grid approaches used in aerodynamic applications and the associated advantages and difficulties are reviewed. In particular, attention is given to patched grid schemes, overset grid schemes, and the computational aspects of composite grid schemes. As an example of a computational procedure, an algorithm is presented for constructing a hole in a grid caused by a body overset onto another grid.

Steger, Joseph L.↗