Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithm computing”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

Overlapping grids for flow field calculations

Many problems in computational fluid dynamics (CFD) involve the calculation of flow fields within or around complex geometric configurations. The flow solution is computed on a computational grid. The construction of the grid is one of the major difficulties in the application of CFD to the analysis of flow about actual aircraft configurations. Due to geometric complexity, the grid has to be constructed in simple subregions and then all of these subgrids have to be pieced together to form a complete grid for the entire flow field. The entire grid, which is called a composite grid because it is formed from many parts, may have common regions. In either case, the computation of the flow field, using any numerical algorithm, will require the transfer of information between individual subgrids. The transfer of information is more difficult with overlapping grids. Algorithms have been developed and tested for automating the transfer of information between two overlapping grids.

Mastin, Charles Wayne↗
NASA NTRS1990

Two-dimensional Euler and Navier-Stokes Time accurate simulations of fan rotor flows

Two numerical methods are presented which describe the unsteady flow field in the blade-to-blade plane of an axial fan rotor. These methods solve the compressible, time-dependent, Euler and the compressible, turbulent, time-dependent, Navier-Stokes conservation equations for mass, momentum, and energy. The Navier-Stokes equations are written in Favre-averaged form and are closed with an approximate two-equation turbulence model with low Reynolds number and compressibility effects included. The unsteady aerodynamic component is obtained by superposing inflow or outflow unsteadiness to the steady conditions through time-dependent boundary conditions. The integration in space is performed by using a finite volume scheme, and the integration in time is performed by using k-stage Runge-Kutta schemes, k = 2,5. The numerical integration algorithm allows the reduction of the computational cost of an unsteady simulation involving high frequency disturbances in both CPU time and memory requirements. Less than 200 sec of CPU time are required to advance the Euler equations in a computational grid made up of about 2000 grid during 10,000 time steps on a CRAY Y-MP computer, with a required memory of less than 0.3 megawords.

Boretti, A. A.↗
NASA NTRS2001

Comparison of Implicit Collocation Methods for the Heat Equation

We combine a high-order compact finite difference scheme to approximate spatial derivatives arid collocation techniques for the time component to numerically solve the two dimensional heat equation. We use two approaches to implement the collocation methods. The first one is based on an explicit computation of the coefficients of polynomials and the second one relies on differential quadrature. We compare them by studying their merits and analyzing their numerical performance. All our computations, based on parallel algorithms, are carried out on the CRAY SV1.

Kouatchou, Jules↗
NASA NTRS1988

Implementation and analysis of a Navier-Stokes algorithm on parallel computers

The results of the implementation of a Navier-Stokes algorithm on three parallel/vector computers are presented. The object of this research is to determine how well, or poorly, a single numerical algorithm would map onto three different architectures. The algorithm is a compact difference scheme for the solution of the incompressible, two-dimensional, time-dependent Navier-Stokes equations. The computers were chosen so as to encompass a variety of architectures. They are the following: the MPP, an SIMD machine with 16K bit serial processors; Flex/32, an MIMD machine with 20 processors; and Cray/2. The implementation of the algorithm is discussed in relation to these architectures and measures of the performance on each machine are given. The basic comparison is among SIMD instruction parallelism on the MPP, MIMD process parallelism on the Flex/32, and vectorization of a serial code on the Cray/2. Simple performance models are used to describe the performance. These models highlight the bottlenecks and limiting factors for this algorithm on these architectures. Finally, conclusions are presented.

Fatoohi, Raad A.↗
NASA NTRS1986

Summary of research in applied mathematics, numerical analysis, and computer sciences

The major categories of current ICASE research programs addressed include: numerical methods, with particular emphasis on the development and analysis of basic numerical algorithms; control and parameter identification problems, with emphasis on effective numerical methods; computational problems in engineering and physical sciences, particularly fluid dynamics, acoustics, and structural analysis; and computer systems and software, especially vector and parallel computers.

Source record↗
NASA NTRS1988

The computation of pi to 29,360,000 decimal digits using Borweins' quartically convergent algorithm

The quartically convergent numerical algorithm developed by Borwein and Borwein (1987) for 1/pi is implemented via a prime-modulus-transform multiprecision technique on the NASA Ames Cray-2 supercomputer to compute the first 2.936 x 10 to the 7th digits of the decimal expansion of pi. The history of pi computations is briefly recalled; the most recent algorithms are characterized; the implementation procedures are described; and samples of the output listing are presented. Statistical analyses show that the present decimal expansion is completely random, with only acceptable numbers of long repeating strings and single-digit runs.

Bailey, David H.↗
NASA NTRS1998

Developing Information Power Grid Based Algorithms and Software

This exploratory study initiated our effort to understand performance modeling on parallel systems. The basic goal of performance modeling is to understand and predict the performance of a computer program or set of programs on a computer system. Performance modeling has numerous applications, including evaluation of algorithms, optimization of code implementations, parallel library development, comparison of system architectures, parallel system design, and procurement of new systems. Our work lays the basis for the construction of parallel libraries that allow for the reconstruction of application codes on several distinct architectures so as to assure performance portability. Following our strategy, once the requirements of applications are well understood, one can then construct a library in a layered fashion. The top level of this library will consist of architecture-independent geometric, numerical, and symbolic algorithms that are needed by the sample of applications. These routines should be written in a language that is portable across the targeted architectures.

Dongarra, Jack↗
NASA NTRS1977

An ILLIAC program for the numerical simulation of homogeneous incompressible turbulence

An algorithm and ILLIAC computer program, developed for the simulation of homogeneous incompressible turbulence in the presence of an applied mean strain, are described. The turbulence field is represented spatially by a truncated triple Fourier series (spectral method) and followed in time using a fourth-order Runge-Kutta algorithm. These include: (1) transformation of variables suggested by Taylor's sudden-distortion theory; (2) implicit viscous diffusion by use of an integrating factor; (3) implicit pressure calculation suggested by Taylor's sudden-distortion theory, and (4) inexpensive control of aliasing by random and phased coordinate shifts.

Rogallo, R. S.↗
NASA NTRS2013

Comparative Study on High-Order Positivity-preserving WENO Schemes

In gas dynamics and magnetohydrodynamics flows, physically, the density and the pressure p should both be positive. In a standard conservative numerical scheme, however, the computed internal energy is obtained by subtracting the kinetic energy from the total energy, resulting in a computed p that may be negative. Examples are problems in which the dominant energy is kinetic. Negative may often emerge in computing blast waves. In such situations the computed eigenvalues of the Jacobian will become imaginary. Consequently, the initial value problem for the linearized system will be ill posed. This explains why failure of preserving positivity of density or pressure may cause blow-ups of the numerical algorithm. The adhoc methods in numerical strategy which modify the computed negative density and/or the computed negative pressure to be positive are neither a conservative cure nor a stable solution. Conservative positivity-preserving schemes are more appropriate for such flow problems. The ideas of Zhang & Shu (2012) and Hu et al. (2012) precisely address the aforementioned issue. Zhang & Shu constructed a new conservative positivity-preserving procedure to preserve positive density and pressure for high-order WENO schemes by the Lax-Friedrichs flux (WENO/LLF). In general, WENO/LLF is too dissipative for flows such as turbulence with strong shocks computed in direct numerical simulations (DNS) and large eddy simulations (LES). The new conservative positivity-preserving procedure proposed in Hu et al. (2012) can be used with any high-order shock-capturing scheme, including high-order WENO schemes using the Roe's flux (WENO/Roe). The goal of this study is to compare the results obtained by non-positivity-preserving methods with the recently developed positivity-preserving schemes for representative test cases. In particular the more difficult 3D Noh and Sedov problems are considered. These test cases are chosen because of the negative pressure/density most often exhibited by standard high-order shock-capturing schemes. The simulation of a hypersonic nonequilibrium viscous shock tube that is related to the NASA Electric Arc Shock Tube (EAST) is also included. EAST is a high-temperature and high Mach number viscous nonequilibrium flow consisting of 13 species. In addition, as most common shock-capturing schemes have been developed for problems without source terms, when applied to problems with nonlinear and/or sti source terms these methods can result in spurious solutions, even when solving a conservative system of equations with a conservative scheme. This kind of behavior can be observed even for a scalar case (LeVeque & Yee 1990) as well as for the case consisting of two species and one reaction (Wang et al. 2012). For further information concerning this issue see (LeVeque & Yee 1990; Griffiths et al. 1992; Lafon & Yee 1996; Yee et al. 2012). This EAST example indicated that standard high-order shock-capturing methods exhibit instability of density/pressure in addition to grid-dependent discontinuity locations with insufficient grid points. The evaluation of these test cases is based on the stability of the numerical schemes together with the accuracy of the obtained solutions.

WENO↗
NASA NTRS2014

Comparitive Study of High-Order Positivity-Preserving WENO Schemes

In gas dynamics and magnetohydrodynamics flows, physically, the density ρ and the pressure p should both be positive. In a standard conservative numerical scheme, however, the computed internal energy is The ideas of Zhang & Shu (2012) and Hu et al. (2012) precisely address the aforementioned issue. Zhang & Shu constructed a new conservative positivity-preserving procedure to preserve positive density and pressure for high-order Weighted Essentially Non-Oscillatory (WENO) schemes by the Lax-Friedrichs flux (WENO/LLF). In general, WENO/LLF is obtained by subtracting the kinetic energy from the total energy, resulting in a computed p that may be negative. Examples are problems in which the dominant energy is kinetic. Negative ρ may often emerge in computing blast waves. In such situations the computed eigenvalues of the Jacobian will become imaginary. Consequently, the initial value problem for the linearized system will be ill posed. This explains why failure of preserving positivity of density or pressure may cause blow-ups of the numerical algorithm. The adhoc methods in numerical strategy which modify the computed negative density and/or the computed negative pressure to be positive are neither a conservative cure nor a stable solution. Conservative positivity-preserving schemes are more appropriate for such flow problems. too dissipative for flows such as turbulence with strong shocks computed in direct numerical simulations (DNS) and large eddy simulations (LES). The new conservative positivity-preserving procedure proposed in Hu et al. (2012) can be used with any high-order shock-capturing scheme, including high-order WENO schemes using the Roe's flux (WENO/Roe). The goal of this study is to compare the results obtained by non-positivity-preserving methods with the recently developed positivity-preserving schemes for representative test cases. In particular the more di cult 3D Noh and Sedov problems are considered. These test cases are chosen because of the negative pressure/density most often exhibited by standard high-order shock-capturing schemes. The simulation of a hypersonic nonequilibrium viscous shock tube that is related to the NASA Electric Arc Shock Tube (EAST) is also included. EAST is a high-temperature and high Mach number viscous nonequilibrium ow consisting of 13 species. In addition, as most common shock-capturing schemes have been developed for problems without source terms, when applied to problems with nonlinear and/or sti source terms these methods can result in spurious solutions, even when solving a conservative system of equations with a conservative scheme. This kind of behavior can be observed even for a scalar case as well as for the case consisting of two species and one reaction.. This EAST example indicated that standard high-order shock-capturing methods exhibit instability of density/pressure in addition to grid-dependent discontinuity locations with insufficient grid points. The evaluation of these test cases is based on the stability of the numerical schemes together with the accuracy of the obtained solutions.

Schemes↗
NASA NTRS1983

Calculation of a simulated 3-D high speed inlet using the Navier-Stokes equations

A hybrid numerical algorithm, developed to solve the full three-dimensional Navier-Stokes equations, is applied to the computation of the flowfield in a simulated three-dimensional high speed aircraft inlet at a Mach number of 2.5 and Reynolds number of 1.4 x 10 to the 7th based on inlet length. The numerical algorithm incorporates a coordinate transformation in order to handle general flow geometries, and utilizes the algebraic turbulent eddy viscosity model of Baldwin and Lomax. The hybrid algorithm has been vectorized on the CDC CYBER 203 computer using the SL/1 vector programming language developed at NASA Langley. The computed results are compared with experimental measurements of the ramp and cowl static pressures, and boundary layer pitot profiles. The results are also compared with a previous two-dimensional Navier-Stokes computation of the same configuration. The agreement with the experimental data is generally good; however, additional improvements in turbulence modeling are needed.

Knight, D. D.↗
NASA NTRS1984

Bayesian design of decision rules for failure detection

The formulation of the decision making process of a failure detection algorithm as a Bayes sequential decision problem provides a simple conceptualization of the decision rule design problem. As the optimal Bayes rule is not computable, a methodology that is based on the Bayesian approach and aimed at a reduced computational requirement is developed for designing suboptimal rules. A numerical algorithm is constructed to facilitate the design and performance evaluation of these suboptimal rules. The result of applying this design methodology to an example shows that this approach is potentially a useful one.

Chow, E. Y.↗
NASA NTRS1986

Description of the Mast Flight System

The Mast Flight System is composed of several subsystems. Primary among these is the Deployable Mast Subsystem (DMS) which consists of a beam assembly and an associated mechanism for deploying and retracting the beam. The beam assembly is a joint dominated graphite epoxy and titanium truss as is expected of future large space structures. Integral to the beam assembly are actuators, sensors and associated electronics which are available for excitation and damping as desired by the experimenter. The beam structural characteristics can also be modified as desired by the experimenter using the Parameter Modification Device installed at the end of the beam. Data measured on the beam by the sensors and commands to the actuators are transmitted along the beam digitally at 150 Hz using a standard 1553 type bus. The Modular Distributed Information Sybsystem (MDIS) computer functions as bus master and ensures that all experimental data is saved for future analysis. The MDIS computer also performs a safing function to prevent inadvertent overexcitation of the beam. Finally, the Excitation and Damping Subsystem (EDS) computer is available to the experimenter for implementation of control algorithms or any other numerical operations as desired. Data from all system sensors can be accessed by the EDS computer.

Talcott, Ronald C.↗
NASA NTRS1990

Resolution of the 1D regularized Burgers equation using a spatial wavelet approximation

The Burgers equation with a small viscosity term, initial and periodic boundary conditions is resolved using a spatial approximation constructed from an orthonormal basis of wavelets. The algorithm is directly derived from the notions of multiresolution analysis and tree algorithms. Before the numerical algorithm is described these notions are first recalled. The method uses extensively the localization properties of the wavelets in the physical and Fourier spaces. Moreover, the authors take advantage of the fact that the involved linear operators have constant coefficients. Finally, the algorithm can be considered as a time marching version of the tree algorithm. The most important point is that an adaptive version of the algorithm exists: it allows one to reduce in a significant way the number of degrees of freedom required for a good computation of the solution. Numerical results and description of the different elements of the algorithm are provided in combination with different mathematical comments on the method and some comparison with more classical numerical algorithms.

Liandrat, J.↗
NASA NTRS1987

Parallel computations and their impact on mechanics; Proceedings of the Symposium, ASME Winter Annual Meeting, Boston, MA, Dec. 13-18, 1987

The conference presents papers on parallel architectures and the programming environment, parallel numerical algorithms, structural mechanics applications, and fluid dynamics applications. Topics include concurrent computer architecture, the state-of-the-art in highly parallel computer systems, supercomputer programming environments, uniquely parallel algorithms, the parallel solution of nonlinear elliptic equations, highly parallel banded systems solvers, and optimal mapping of irregular finite element domains to parallel processors. Consideration is also given to parallel processing in finite element structural analysis, heirarchical parallelism in a finite element CFD algorithm, and a parallelized elliptic solver for reacting flows.

Noor, Ahmed K.↗
NASA NTRS1994

Computationally efficient multibody simulations

Computationally efficient approaches to the solution of the dynamics of multibody systems are presented in this work. The computational efficiency is derived from both the algorithmic and implementational standpoint. Order(n) approaches provide a new formulation of the equations of motion eliminating the assembly and numerical inversion of a system mass matrix as required by conventional algorithms. Computational efficiency is also gained in the implementation phase by the symbolic processing and parallel implementation of these equations. Comparison of this algorithm with existing multibody simulation programs illustrates the increased computational efficiency.

Ramakrishnan, Jayant↗
NASA NTRS1982

Singular perturbation techniques for real time aircraft trajectory optimization and control

The usefulness of singular perturbation methods for developing real time computer algorithms to control and optimize aircraft flight trajectories is examined. A minimum time intercept problem using F-8 aerodynamic and propulsion data is used as a baseline. This provides a framework within which issues relating to problem formulation, solution methodology and real time implementation are examined. Theoretical questions relating to separability of dynamics are addressed. With respect to implementation, situations leading to numerical singularities are identified, and procedures for dealing with them are outlined. Also, particular attention is given to identifying quantities that can be precomputed and stored, thus greatly reducing the on-board computational load. Numerical results are given to illustrate the minimum time algorithm, and the resulting flight paths. An estimate is given for execution time and storage requirements.

Calise, A. J.↗
NASA NTRS1987

Vectorizable implicit algorithms for the flux-difference split, three-dimensional Navier-Stokes equations

The computational efficiency of four vectorizable implicit algorithms is assessed when applied to calculate steady-state solutions to the three-dimensional, incompressible Navier-Stokes equations in general coordinates. Two of these algorithms are characterized as hybrid schemes; that is, they combine some approximate factorization in two coordinate directions with relaxation in the remaining spatial direction. The other two algorithms utilize an approximate factorization approach which yields two-factor algorithms for three-dimensional systems. All four algorithms are implemented in identical high-resolution upwind schemes for the flux-difference split Navier-Stokes equations. These highly nonlinear schemes are obtained by extending an implicit Total Variation Diminishing (TVD) scheme recently developed for linear one-dimensional systems of hyperbolic conservation laws to the three-dimensional Navier-Stokes equations. The computation of vortical flow over a sharp-edged, thin delta wing has been chosen as a common numerical test case. The convergence of the algorithms is discussed and the accuracy of the computed flow-field results is assessed. The validity of the present results are demonstrated by a comparison with experimental data.

Hartwich, P. M.↗