SEARCH · Engineering Papers

Results for “vectorizability”

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 37 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS1985

Recent advances in computational transonic aerodynamics

The near-term prospects are discussed for calculation of viscous transonic flow fields about realistic configurations at full-scale Reynolds numbers. Three basic algorithms are considered: The central-difference, three-factor ADI method; the central-difference, explicit, multistep Runge-Kutta method with multigrid acceleration; and the relaxation method for the upwind-differenced, flux-split equations. Each method has distinct advantages and disadvantages regarding stability, convergence rate, and vectorizability. It appears that computation times can be 15 to 60 hours on the latest super computers unless 3D algorithms are improved to perform as well as current 2D algorithms.

South, J. C., Jr.↗

NASA NTRS1985

Implicit flux-split schemes for the Euler equations

Recent progress in the development of implicit algorithms for the Euler equations using the flux-vector splitting method is described. Comparisons of the relative efficiency of relaxation and spatially-split approximately factored methods on a vector processor for two-dimensional flows are made. For transonic flows, the higher convergence rate per iteration of the Gauss-Seidel relaxation algorithms, which are only partially vectorizable, is amply compensated for by the faster computational rate per iteration of the approximately factored algorithm. For supersonic flows, the fully-upwind line-relaxation method is more efficient since the numerical domain of dependence is more closely matched to the physical domain of dependence. A hybrid three-dimensional algorithm using relaxation in one coordinate direction and approximate factorization in the cross-flow plane is developed and applied to a forebody shape at supersonic speeds and a swept, tapered wing at transonic speeds.

Thomas, J. L.↗

NASA NTRS1985

The design and implementation of cost-effective algorithms for direct solution of banded linear systems on the vector processor system 32 supercomputer

The problem of solving banded linear systems by direct (non-iterative) techniques on the Vector Processor System (VPS) 32 supercomputer is considered. Two efficient direct methods for solving banded linear systems on the VPS 32 are described. The vector cyclic reduction (VCR) algorithm is discussed in detail. The performance of the VCR on a three parameter model problem is also illustrated. The VCR is an adaptation of the conventional point cyclic reduction algorithm. The second direct method is the Customized Reduction of Augmented Triangles' (CRAT). CRAT has the dominant characteristics of an efficient VPS 32 algorithm. CRAT is tailored to the pipeline architecture of the VPS 32 and as a consequence the algorithm is implicitly vectorizable.

Samba, A. S.↗

NASA NTRS1986

Implicit multigrid algorithms for the three-dimensional flux split Euler equations

The full approximation scheme multigrid method is applied to several implicit flux-split algorithms for solving the three-dimensional Euler equations in a body fitted coordinate system. Each uses a variation of approximate factorization and is implemented in a finite volume formulation. The algorithms are all vectorizable with little or no scalar computations required. The flux vectors are split into upwind components using both the splittings of Steger-Warming and Van Leer. Results comparing pressure distributions with experimental data using both splitting types are shown. The stability and smoothing rate of each of the schemes are examined using a Fourier analysis of the complete system of equations. Results are presented for three-dimensional subsonic, transonic, and supersonic flows which demonstrate substantially improved convergence rates with the multigrid algorithm. The influence of using both a V-cycle and a W-cycle on the convergence is examined. Using the multigrid method on both subsonic and transonic wing calculations, the final lift coefficient is obtained to within 0.1 percent of its final value in a few as 15 cycles for a mesh with over 210,000 points. A spectral radius of 0.89 is achieved for both subsonic and transonic flow over the ONERA M6 wing while a spectral radius of 0.83 is obtained for supersonic flow over an analytically defined forebody. Results compared with experiment for all cases show good agreement.

Anderson, W. K.↗

NASA NTRS1986

An implicit flux-difference splitting scheme for three-dimensional, incompressible Navier-Stokes solutions to leading edge vortex flows

A new, implicit finite-difference scheme designed to solve the conservative, flux-difference split Navier-Stokes equations is used to compute incompressible vortex flows around delta wings. The completely vectorizable hybrid algorithm is constructed in delta form for steady state solutions independent of the time-step sizes. The scheme combines approximate factorization in crossflow planes with a symmetric planar Gauss-Seidel relaxation in the remaining spatial direction. The governing equations are solved in curvilinear, body-fitted coordinates for treating complex geometries. The computed flow field results are compared with other theoretical and experimental data.

Hartwich, P.-M.↗

NASA NTRS1986

An LU-SSOR scheme for the Euler and Navier-Stokes equations

A new multigrid relaxation scheme, lower-upper symmetric successive overrelaxation (LU-SSOR) is developed for the steady-state solution of the Euler and Navier-Stokes equations. The scheme, which is based on central differences, does not require flux splitting for approximate Newton iteration. Application to transonic flow shows that the new method is efficient and robust. The vectorizable LU-SSOR scheme needs only scalar diagonal inversions.

Yoon, Seokkwan↗

NASA NTRS1986

A second-order accurate kinetic-theory-based method for inviscid compressible flows

An upwind method for the numerical solution of the Euler equations is presented. This method, called the kinetic numerical method (KNM), is based on the fact that the Euler equations are moments of the Boltzmann equation of the kinetic theory of gases when the distribution function is Maxwellian. The KNM consists of two phases, the convection phase and the collision phase. The method is unconditionally stable and explicit. It is highly vectorizable and can be easily made total variation diminishing for the distribution function by a suitable choice of the interpolation strategy. The method is applied to a one-dimensional shock-propagation problem and to a two-dimensional shock-reflection problem.

Deshpande, Suresh M.↗

NASA NTRS1987

An LU-SSOR scheme for the Euler and Navier-Stokes equations

Yoon, Seokkwan↗

NASA NTRS1987

High resolution upwind schemes for the three-dimensional incompressible Navier-Stokes equations

Based on flux-difference splitting, implicit high resolution schemes are constructed for efficient computations of steady-state solutions to the three-dimensional, incompressible Navier-Stokes equations in curvilinear coordinates. These schemes use first-order accurate Euler backward-time differencing and second-order central differencing for the viscous shear fluxes. Up to third-order accurate upwind differencing is achieved through a reconstruction of the solution from its cell averages. The reconstruction is accomplished by linear interpolation, where the node stencils are selected such that in regions of smooth solution the flow is highly resolved while spurious oscillations in regions of rapid changes in gradient are still suppressed. Fairly rapid convergence to steady-state solutions is attained with a completely vectorizable hybrid time-marching method. Flows around a sharp-edged delta wing are computed with the maximum accuracy of the upwind-differencing restricted to first-, second-, and third-order, to illustrate the effect of accuracy on the global and on the local vortical flow fields. The results are validated with experimental data.

Hartwich, PETER-M.↗

NASA NTRS1989

Algorithm For Solution Of Navier-Stokes Equations

Advantages of two previous algorithms combined. Steady-state Navier-Stokes equations put in implicit finite-difference form solved by approximate Newton iteration. LU-SSOR scheme is new relaxation method combining advantages of LU factorization with Gauss-Seidel relaxation. Vectorizable LU-SSOR scheme, based on central differences, requires scalar diagonal inversions. Application of scheme to approximate Newton iteration of Navier-Stokes equations yields set of equations requiring no implicit smoothing on left side. Only adaptive, total-variation-diminishing, flux-limited dissipation terms added to right side. Algorithm used to predict laminar, turbulent, and hypersonic flows.

Yoon, Seokkwan↗

NASA NTRS1988

Three-dimensional multigrid algorithms for the flux-split Euler equations

The Full Approximation Scheme (FAS) multigrid method is applied to several implicit flux-split algorithms for solving the three-dimensional Euler equations in a body fitted coordinate system. Each of the splitting algorithms uses a variation of approximate factorization and is implemented in a finite volume formulation. The algorithms are all vectorizable with little or no scalar computation required. The flux vectors are split into upwind components using both the splittings of Steger-Warming and Van Leer. The stability and smoothing rate of each of the schemes are examined using a Fourier analysis of the complete system of equations. Results are presented for three-dimensional subsonic, transonic, and supersonic flows which demonstrate substantially improved convergence rates with the multigrid algorithm. The influence of using both a V-cycle and a W-cycle on the convergence is examined.

Anderson, W. Kyle↗

NASA NTRS1989

LU-SGS implicit algorithm for three-dimensional incompressible Navier-Stokes equations with source term

A numerical method is developed for solving the incompressible Navier-Stokes equations using the concept of pseudocompressibility. A lower-upper symmetric-Gauss-Seidel implicit scheme is developed for three-dimensional incompressible viscous flow computations. The present algorithm offers additional advantages when solving the flow equations with source terms. Complete vectorizability of the algorithm on oblique planes of sweep in three-dimensions is accomplished in a new flow solver, INS3D-LU code. Spatial differencing is a second-order accurate semi-discrete finite-volume method augmented by a third-order accurate numerical dissipation model which is based on spectral-radii. Comparison of numerical solutions for a curved duct with experimental data shows good agreement. The method is applied to calculate the inducer flow of the Space Shuttle Main Engine turbopump.

Yoon, Seokkwan↗

NASA NTRS1989

Equilibrium gas flow computations. I - Accurate and efficient calculation of equilibrium gas properties

This paper treats the accurate and efficient calculation of thermodynamic properties of arbitrary gas mixtures for equilibrium flow computations. New improvements in the Stupochenko-Jaffe model for the calculation of thermodynamic properties of diatomic molecules are presented. A unified formulation of equilibrium calculations for gas mixtures in terms of irreversible entropy is given. Using a highly accurate thermo-chemical data base, a new, efficient and vectorizable search algorithm is used to construct piecewise interpolation procedures with generate accurate thermodynamic variable and their derivatives required by modern computational algorithms. Results are presented for equilibrium air, and compared with those given by the Srinivasan program.

Liu, Yen↗

NASA NTRS1991

Three-dimensional incompressible Navier-Stokes solver using lower-upper symmetric-Gauss-Seidel algorithm

A numerical method based on the pseudocompressibility concept is developed for solving the three-dimensional incompressible Navier-Stokes equations using the lower-upper symmetric-Gauss-Seidel implicit scheme. Very high efficiency is achieved in a new flow solver, INS3D-LU code, by accomplishing the complete vectorizability of the algorithm on oblique planes of sweep in three dimensions.

Yoon, Seokkwan↗

NASA NTRS1990

Implicit methods for the Navier-Stokes equations

Numerical solutions of the Navier-Stokes equations using explicit schemes can be obtained at the expense of efficiency. Conventional implicit methods which often achieve fast convergence rates suffer high cost per iteration. A new implicit scheme based on lower-upper factorization and symmetric Gauss-Seidel relaxation offers very low cost per iteration as well as fast convergence. High efficiency is achieved by accomplishing the complete vectorizability of the algorithm on oblique planes of sweep in three dimensions.

Yoon, S.↗

NASA NTRS1991

Particle simulation in a multiprocessor environment

A parallel implementation of a particle simulation method that is portable between a wide class of multiprocessor computers is presented. A fine grain spatial decomposition is utilized where several subdomains having a regular structure are computed at each processing node. This leads directly to an efficient and straightforward load balancing scheme if the number of subdomains at each processor is permitted to vary in an appropriate manner. Three dimensional simulations incorporating full thermochemical nonequilibrium are possible using the resulting code. Vectorizable algorithms are retained from earlier work allowing efficient use of deeply pipelined node processors where available. Performance results are presented from three different machine architectures demonstrating the portability of the code. On a 128-node Intel iPSC/860, performance is twice that of a single Cray-Y/MP CPU running a highly vectorized simulation code. Speedup is linear over the full range of number of processors on all target machines, indicating scalability of the method to higher degrees of parallelism.

Mcdonald, Jeffrey D.↗

NASA NTRS1992

Grid generation and flow solution method for Euler equations on unstructured grids

A grid generation and flow solution algorithm for the Euler equations on unstructured grids is presented. The grid generation scheme, which uses Delaunay triangulation, generates the field points for the mesh based on cell aspect ratios and allows clustering of grid points near solid surfaces. The flow solution method is an implicit algorithm in which the linear set of equations arising at each time step is solved using a Gauss-Seidel procedure that is completely vectorizable. Also, a study is conducted to examine the number of subiterations required for good convergence of the overall algorithm. Grid generation results are shown in two dimensions for an NACA 0012 airfoil as well as a two element configuration. Flow solution results are shown for a two dimensional flow over the NACA 0012 airfoil and for a two element configuration in which the solution was obtained through an adaptation procedure and compared with an exact solution. Preliminary three dimensional results also are shown in which the subsonic flow over a business jet is computed.

Anderson, W. Kyle↗

NASA NTRS1992

Overview of the relevant CFD work at Thiokol Corporation

An in-house developed proprietary advanced computational fluid dynamics code called SHARP (Trademark) is a primary tool for many flow simulations and design analyses. The SHARP code is a time dependent, two dimensional (2-D) axisymmetric numerical solution technique for the compressible Navier-Stokes equations. The solution technique in SHARP uses a vectorizable implicit, second order accurate in time and space, finite volume scheme based on an upwind flux-difference splitting of a Roe-type approximated Riemann solver, Van Leer's flux vector splitting, and a fourth order artificial dissipation scheme with a preconditioning to accelerate the flow solution. Turbulence is simulated by an algebraic model, and ultimately the kappa-epsilon model. Some other capabilities of the code are 2-D two-phase Lagrangian particle tracking and cell blockages. Extensive development and testing has been conducted on the 3-D version of the code with flow, combustion, and turbulence interactions. The emphasis here is on the specific applications of SHARP in Solid Rocket Motor design. Information is given in viewgraph form.

Chwalowski, Pawel↗