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

BEM for wave equation with boundary in arbitrary motion and applications to compressible potential aerodynamics of airplanes and helicopters

The wave equation for an object in arbitrary motion is investigated analytically using a BEM approach, and practical applications to potential flows of compressible fluids around aircraft wings and helicopter rotors are considered. The treatment accounts for arbitrary combined rotational and translational motion of the reference frame and for the wake motion. The numerical implementation as a computer algorithm is demonstrated on problems with prescribed and free wakes, the former in compressible flows and the latter for incompressible flows; results are presented graphically and briefly characterized.

Morino, Luigi↗
NASA NTRS1989

Two-time scale stabilization of a flexible arm with output feedback

An approach is presented to designing a control system with output feedback for a lightweight flexible arm. A two-time-scale dynamic model is obtained which allows the adoption of a composite control strategy. First a slow control can be designed for the slow (rigid) subsystem, and then a fast stabilizing control for the fast (flexible) subsystem. The problem of the lack of full state measurements connected with the fast control design is solved. An output-feedback, low-order dynamic compensator whose optimal gains are computed by a convergent numerical algorithm is designed. A more robust design can be achieved if a loop transfer recovery procedure is introduced. The design procedure is tested by means of nonlinear simulation, and the results are discussed.

Siciliano, Bruno↗
NASA NTRS1992

Volume 2: Explicit, multistage upwind schemes for Euler and Navier-Stokes equations

The objective of this study was to develop a high-resolution-explicit-multi-block numerical algorithm, suitable for efficient computation of the three-dimensional, time-dependent Euler and Navier-Stokes equations. The resulting algorithm has employed a finite volume approach, using monotonic upstream schemes for conservation laws (MUSCL)-type differencing to obtain state variables at cell interface. Variable interpolations were written in the k-scheme formulation. Inviscid fluxes were calculated via Roe's flux-difference splitting, and van Leer's flux-vector splitting techniques, which are considered state of the art. The viscous terms were discretized using a second-order, central-difference operator. Two classes of explicit time integration has been investigated for solving the compressible inviscid/viscous flow problems--two-state predictor-corrector schemes, and multistage time-stepping schemes. The coefficients of the multistage time-stepping schemes have been modified successfully to achieve better performance with upwind differencing. A technique was developed to optimize the coefficients for good high-frequency damping at relatively high CFL numbers. Local time-stepping, implicit residual smoothing, and multigrid procedure were added to the explicit time stepping scheme to accelerate convergence to steady-state. The developed algorithm was implemented successfully in a multi-block code, which provides complete topological and geometric flexibility. The only requirement is C degree continuity of the grid across the block interface. The algorithm has been validated on a diverse set of three-dimensional test cases of increasing complexity. The cases studied were: (1) supersonic corner flow; (2) supersonic plume flow; (3) laminar and turbulent flow over a flat plate; (4) transonic flow over an ONERA M6 wing; and (5) unsteady flow of a compressible jet impinging on a ground plane (with and without cross flow). The emphasis of the test cases was validation of code, and assessment of performance, as well as demonstration of flexibility.

Elmiligui, Alaa↗
NASA NTRS1999

The NOAA-9 Earth Radiation Budget Experiment Wide Field-of-View Data Set

The Earth Radiation Budget Experiment (ERBE) consisted of wide field-of-view (WFOV) radiometers and scanning radiometers for measuring outgoing longwave radiation and solar radiation reflected from the Earth. These instruments were carried by the dedicated Earth Radiation Budget Satellite (ERBS) and by the NOAA-9 and -10 operational spacecraft. The WFOV radiometers provided data from which instantaneous fluxes at the top of the atmosphere (TOA) are computed by use of a numerical filter algorithm. Monthly mean fluxes over a 5-degree equal angle grid are computed from the instantaneous TOA fluxes. The WFOV radiometers aboard the NOAA-9 spacecraft operated from February 1985 through December 1992, at which time a failure of the shortwave radiometer ended the usable data after nearly 8 years. This paper examines the monthly mean products from that data set.

Bush, Kathryn A.↗
NASA NTRS1992

A proposed study of multiple scattering through clouds up to 1 THz

A rigorous computation of the electromagnetic field scattered from an atmospheric liquid water cloud is proposed. The recent development of a fast recursive algorithm (Chew algorithm) for computing the fields scattered from numerous scatterers now makes a rigorous computation feasible. A method is presented for adapting this algorithm to a general case where there are an extremely large number of scatterers. It is also proposed to extend a new binary PAM channel coding technique (El-Khamy coding) to multiple levels with non-square pulse shapes. The Chew algorithm can be used to compute the transfer function of a cloud channel. Then the transfer function can be used to design an optimum El-Khamy code. In principle, these concepts can be applied directly to the realistic case of a time-varying cloud (adaptive channel coding and adaptive equalization). A brief review is included of some preliminary work on cloud dispersive effects on digital communication signals and on cloud liquid water spectra and correlations.

Gerace, G. C.↗
NASA NTRS1994

Design and implementation of a parallel unstructured Euler solver using software primitives

This paper is concerned with the implementation of a three-dimensional unstructured-grid Euler solver on massively parallel distributed-memory computer architectures. The goal is to minimize solution time by achieving high computational rates with a numerically efficient algorithm. An unstructured multigrid algorithm with an edge-based data structure has been adopted, and a number of optimizations have been devised and implemented to accelerate the parallel computational rates. The implementation is carried out by creating a set of software tools, which provide an interface between the parallelization issues and the sequential code, while providing a basis for future automatic run-time compilation support. Large practical unstructured grid problems are solved on the Intel iPSC/860 hypercube and Intel Touchstone Delta machine. The quantitative effects of the various optimizations are demonstrated, and we show that the combined effect of these optimizations leads to roughly a factor of 3 performance improvement. The overall solution efficiency is compared with that obtained on the Cray Y-MP vector supercomputer.

Das, R.↗
NASA NTRS1985

On the numerical computation of nonlinear force-free magnetic fields

An algorithm has been developed to extrapolate nonlinear force-free magnetic fields from a source surface, given the proper boundary conditions. The results of this work; describing the mathematical formalism that was developed, the numerical techniques employed, and the stability criteria developed for these numerical schemes are presented. An analytical solution is used for a test case; the results show that the computational accuracy for the case of a nonlinear force-free magnetic field was on the order of a few percent ( 5%).

Wu, S. T.↗
NASA NTRS1992

The design and implementation of a parallel unstructured Euler solver using software primitives

This paper is concerned with the implementation of a 3D unstructured-grid Euler-solver on massively parallel distributed-memory computer architectures. The goal is to minimize solution time by achieving high computational rates with a numerically efficient algorithm. An unstructured multigrid algorithm with an edge-based data-structure has been adopted, and a number of optimizations have been devised and implemented in order to accelerate the parallel computational rates. The implementation is carried out by creating a set of software tools, which ease the implementation of computational problems on parallel architecture machines by relieving the user of the low-level machine specific issues. The quantitative effect of the various optimizations are demonstrated, and we show that the combined effect of these optimizations leads to roughly a factor of three performance improvement. The overall solution efficiency is compared with that obtained on the CRAY-YMP vector supercomputer.

Das, R.↗
NASA NTRS1989

Parallel language constructs for tensor product computations on loosely coupled architectures

A set of language primitives designed to allow the specification of parallel numerical algorithms at a higher level is described. The authors focus on tensor product array computations, a simple but important class of numerical algorithms. They consider first the problem of programming one-dimensional kernel routines, such as parallel tridiagonal solvers, and then look at how such parallel kernels can be combined to form parallel tensor product algorithms.

Mehrotra, Piyush↗
NASA NTRS1990

On the numerical computation of nonlinear force-free magnetic fields

An algorithm has been developed to extrapolate nonlinear force-free magnetic fields from the photosphere, given the proper boundary conditions. This paper presents the results of this work, describing the mathematical formalism that was developed, the numerical techniques employed, and comments on the stability criteria and accuracy developed for these numerical schemes. An analytical solution is used for a benchmark test; the results show that the computational accuracy for the case of a nonlinear force-free magnetic field was on the order of a few percent (less than 5 percent). This newly developed scheme was applied to analyze a solar vector magnetogram, and the results were compared with the results deduced from the classical potential field method. The comparison shows that additional physical features of the vector magnetogram were revealed in the nonlinear force-free case.

Wu, S. T.↗
NASA NTRS1992

Global transformation of rotation matrices to Euler parameters

A global algorithm for transforming rotation matrices to Euler parameters is presented. Although it has no apparent computational or numerical advantage over the known algorithms, it elucidates the relationship between the rotation matrix form and the Euler parameter form. It employs the singular-value decomposition, a numerically ideal algorithm involving orthogonal transformations. Attitude parameterization is reviewed and an analytical framework is provided.

Paielli, Russell A.↗
NASA NTRS1998

A Polynomial Time, Numerically Stable Integer Relation Algorithm

Let x = (x1, x2...,xn be a vector of real numbers. X is said to possess an integer relation if there exist integers a(sub i) not all zero such that a1x1 + a2x2 + ... a(sub n)Xn = 0. Beginning in 1977 several algorithms (with proofs) have been discovered to recover the a(sub i) given x. The most efficient of these existing integer relation algorithms (in terms of run time and the precision required of the input) has the drawback of being very unstable numerically. It often requires a numeric precision level in the thousands of digits to reliably recover relations in modest-sized test problems. We present here a new algorithm for finding integer relations, which we have named the "PSLQ" algorithm. It is proved in this paper that the PSLQ algorithm terminates with a relation in a number of iterations that is bounded by a polynomial in it. Because this algorithm employs a numerically stable matrix reduction procedure, it is free from the numerical difficulties, that plague other integer relation algorithms. Furthermore, its stability admits an efficient implementation with lower run times oil average than other algorithms currently in Use. Finally, this stability can be used to prove that relation bounds obtained from computer runs using this algorithm are numerically accurate.

Ferguson, Helaman R. P.↗
NASA NTRS1978

Transonic lifting line theory - Numerical procedure for shock-free flows

An algorithm for computing transonic lifting-line theory without shocks is presented; the numerical procedure relies on two-dimensional analyses developed to solve inviscid flow equations for slender airfoils. From a series of solutions to two-dimensional problems in which span effects appear parametrically, the three-dimensional potential field characterization is obtained. Numerical results are given for a lifting wing with an elliptic (spanwise) distribution of chord and a NACA-0012 cross section (a freestream Mach number of 0.63 and an angle of attack of 2 deg are assumed).

Small, R. D.↗
NASA NTRS1985

An Eigensystem Realization Algorithm for Application to Modal Testing

Important features of the Eigensystem Realization Algorithm (ERA) are summarized as follows: (1) from the computational standpoint, the algorithm is attractive, since only simple numerical operations are needed; (2) the computational procedure is numerically stable; (3) the structural dynamics requirements for modal parameter identification and the control design requirements for a reduced-state space model are satisfied; (4) data from more than one test can be used simultaneously to efficiently identify the closely spaced eigenvalues; and (5) no restrictions on number of measurements are imposed.

Juang, J. N.↗
NASA NTRS1995

Evaluation of numerical schemes for the analysis of sound generation by blade-gust interaction

In this investigation three different numerical algorithms have been utilized to compute the flow about a flat plate in the presence of a transverse gust described by a sinusoidal disturbance. The three schemes include the MacCormack explicit finite difference scheme which is second order accurate in both time and space, the Gottlieb and Turkel modification of MacCormack's scheme which is fourth order accurate in space and second order accurate in time, (referred to as the 2-4 scheme), and a two step scheme developed by Bayliss et al. which has second order temporal accuracy and sixth order spatial accuracy (a 2-6 scheme). The flow field results are obtained with these schemes by using the same code with the only difference being the implementation of the respective solution algorithms. The problem is set up so that the sinusoidal disturbance is imposed at the surface of the flat plate as a surface boundary condition. Thus the problem is treated as scattering problem. The computed results include the time average of the acoustic pressure squared along grid lines five points away from the boundaries; distribution throughout the computational domain is monitored at various times. The numerical results are compared with an exact solution obtained by Atassi, Dusey, and Davis.

Scott, J. N.↗
NASA NTRS1977

Halo orbit station keeping for International Sun-Earth Explorer-C /ISEE-C/

The ISEE-C spacecraft must be kept close to an unstable 'halo' orbit with a series of discrete orbital maneuvers set at intervals at least one month apart. A numerical algorithm has been developed to compute a velocity correction at any point on the trajectory which will minimize the distance between the satellite orbit and the nominal halo path. This algorithm is used to generate a number of station keeping histories with fixed time intervals between maneuvers to ascertain bounds on fuel cost, tightness of fit to nominal path and expected duration between thrust applications. The difference between a third order analytic representation of the halo orbit and a numerically improved nominal path as a reference orbit in the station keeping scheme is investigated as well as the distinction between a tight control and a loose control. A simulation of an operational approach to station keeping is also presented which shows that intermittant propulsive maneuvers can be used to control the spacecraft with very modest fuel expenditure.

Heuberger, H.↗
NASA NTRS1981

Computation of separated flows by a vortex-tracing algorithm

Numerical solutions for two-dimensional, time-dependent, separated flows around bodies are obtained, using a new version of the vortex method. This method provides an efficient representation of flows involving large regions of separation. The modifications incorporated in the new version, which improve its accuracy, versatility, and computing speed, are described. The computer cost is only of the order of the 3/2 power on N, instead of N-squared, for each step with N vortices. Arbitrary shapes can be treated; a conformal mapping is not required. Special attention is paid to the viscous character of the solution and to the accurate computation of the pressure distribution at the body surface. The vortex solution for the outer flow is coupled to an inner solution for the attached part of the boundary layer. Numerical results are presented for several bluff bodies exhibiting dependence on Reynolds number, for stationary airfoils under steady or transient conditions and for oscillating airfoils, including dynamic stalls. These results are compared with other available results, analytical or experimental, and demonstrate the enhanced reliability and accuracy of the improved method.

Spalart, P. R.↗
NASA NTRS1992

Computational methods in the prediction of advanced subsonic and supersonic propeller induced noise: ASSPIN users' manual

This document describes the computational aspects of propeller noise prediction in the time domain and the use of high speed propeller noise prediction program ASSPIN (Advanced Subsonic and Supersonic Propeller Induced Noise). These formulations are valid in both the near and far fields. Two formulations are utilized by ASSPIN: (1) one is used for subsonic portions of the propeller blade; and (2) the second is used for transonic and supersonic regions on the blade. Switching between the two formulations is done automatically. ASSPIN incorporates advanced blade geometry and surface pressure modelling, adaptive observer time grid strategies, and contains enhanced numerical algorithms that result in reduced computational time. In addition, the ability to treat the nonaxial inflow case has been included.

Dunn, M. H.↗