Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized algorithm”

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 613 records · Page 34

Transonic Navier-Stokes solutions about a complex high-speed accelerator configuration

Three-dimensional transonic viscous flow computations are presented for a generic high-speed accelerator model which includes wing, body, fillets, and a no-flow through engine nacelle. Solutions are obtained from an algorithm for the compressible Navier-Stokes equations which incorporates an upwind-biased, flux-vector-splitting approach along with longitudinally-patched grids. Results are presented for fully turbulent flow assumptions and include correlations with wind tunnel data. A good quantitative agreement for the forebody surface pressure distribution is achieved between computations and the available wind-tunnel measurements at freestream Mach number equal to 0.9. Furthermore, it is demonstrated that the flow is stagnating around the boattail region due to separation from the aft-engine cowl lip.

Ghaffari, Farhad↗

Development of iterative techniques for the solution of unsteady compressible viscous flows

During the past two decades, there has been significant progress in the field of numerical simulation of unsteady compressible viscous flows. At present, a variety of solution techniques exist such as the transonic small disturbance analyses (TSD), transonic full potential equation-based methods, unsteady Euler solvers, and unsteady Navier-Stokes solvers. These advances have been made possible by developments in three areas: (1) improved numerical algorithms; (2) automation of body-fitted grid generation schemes; and (3) advanced computer architectures with vector processing and massively parallel processing features. In this work, the GMRES scheme has been considered as a candidate for acceleration of a Newton iteration time marching scheme for unsteady 2-D and 3-D compressible viscous flow calculation; from preliminary calculations, this will provide up to a 65 percent reduction in the computer time requirements over the existing class of explicit and implicit time marching schemes. The proposed method has ben tested on structured grids, but is flexible enough for extension to unstructured grids. The described scheme has been tested only on the current generation of vector processor architecture of the Cray Y/MP class, but should be suitable for adaptation to massively parallel machines.

Hixon, Duane↗

The explicit computation of integration algorithms and first integrals for ordinary differential equations with polynomials coefficients using trees

This note is concerned with the explicit symbolic computation of expressions involving differential operators and their actions on functions. The derivation of specialized numerical algorithms, the explicit symbolic computation of integrals of motion, and the explicit computation of normal forms for nonlinear systems all require such computations. More precisely, if R = k(x(sub 1),...,x(sub N)), where k = R or C, F denotes a differential operator with coefficients from R, and g member of R, we describe data structures and algorithms for efficiently computing g. The basic idea is to impose a multiplicative structure on the vector space with basis the set of finite rooted trees and whose nodes are labeled with the coefficients of the differential operators. Cancellations of two trees with r + 1 nodes translates into cancellation of O(N(exp r)) expressions involving the coefficient functions and their derivatives.

Crouch, P. E.↗

Propulsion Flight Research at NASA Dryden From 1967 to 1997

From 1967 to 1997, pioneering propulsion flight research activities have been conceived and conducted at the NASA Dryden Flight Research Center. Many of these programs have been flown jointly with the United States Department of Defense, industry, or the Federal Aviation Administration. Propulsion research has been conducted on the XB-70, F-111 A, F-111E, YF-12, JetStar, B-720, MD-11, F-15, F- 104, Highly Maneuverable Aircraft Technology, F-14, F/A-18, SR-71, and the hypersonic X-15 airplanes. Research studies have included inlet dynamics and control, in-flight thrust computation, integrated propulsion controls, inlet and boattail drag, wind tunnel-to-flight comparisons, digital engine controls, advanced engine control optimization algorithms, acoustics, antimisting kerosene, in-flight lift and drag, throttle response criteria, and thrust-vectoring vanes. A computer-controlled thrust system has been developed to land the F-15 and MD-11 airplanes without using any of the normal flight controls. An F-15 airplane has flown tests of axisymmetric thrust-vectoring nozzles. A linear aerospike rocket experiment has been developed and tested on the SR-71 airplane. This paper discusses some of the more unique flight programs, the results, lessons learned, and their impact on current technology.

Burcham, Frank W., Jr.↗

An Operational Concept for Flying FMS Trajectories in Center and TRACON Airspace

Current Flight Management Systems (FMS) do a good job of constructing and flying an optimal trajectory for a single aircraft. Unfortunately, flight crews are often unable to fly these FMS routes during arrivals at busy airports. The Center TRACON Automation System (CTAS) has been designed to aid Center and TRACON (Terminal Radar Approach Control) controllers in assigning runways, sequencing and vectoring all classes of aircraft. CTAS bases its advisories on trajectory predictions for arriving aircraft using algorithms very similar to those in airborne FMS systems. This paper presents near and far term operational concepts for how a ground ATM (air traffic management) automation system like CTAS could work more effectively with the airborne automation in FMS equipped aircraft. The concepts for a more compatible air-ground system include: 1) a common route databases for both CTAS and FMS; 2) datalink to downlink information on aircraft weight, final approach speed and trajectory intent and to uplink wind information; 3) new FMS functions to allow flight crews to easily update their FMS trajectory to match the trajectory suggested by the ground automation with voice clearances, and 4) in the far term, datalink to downlink user preferred trajectories and to uplink trajectory clearances in the terminal area. The paper analyses some of the human factors issues that may result in allowing aircraft to fly FMS routes during enroute descent and in the terminal area. A series of linked human in the loop flight deck and air traffic control simulations and a field test with the NASA 757 are being conducted at NASA's Ames and Langley Research Centers to address these issues and to evaluate the operational feasibility of these approaches to more efficient flight and increased airport throughput.

Palmer, Everett↗

Transonic Navier-Stokes Solutions about a Complex High-Speed Accelerator Configuration

Three dimensional transonic viscous flow computations are presented for a generic high-speed accelerator model which includes wing, body, filets,and a no-flow through engine nacelle. solutions are obtained from an algorithm for the compressible Navier-Stokes equations which incorporated an upwind-biased, flux-vector-splitting approach along with longitudinally-patched grids. Results are presented for fully turbulent flow assumptions and include correlations with wind tunnel data. A good quantitative agreement for the forebody surface pressure distribution is achieved between computations and the available wind-tunnel measurements at M(sub infinity) = 0.9. Furthermore, it is demonstrated that the flow is stagnating around the boattail region due to separation from the aft-engine cowl lip.

Ghaffari, F.↗

Sensing a Changing Chemical Mixture Using an Electronic Nose

A method of using an electronic nose to detect an airborne mixture of known chemical compounds and measure the temporally varying concentrations of the individual compounds is undergoing development. In a typical intended application, the method would be used to monitor the air in an inhabited space (e.g., the interior of a building) for the release of solvents, toxic fumes, and other compounds that are regarded as contaminants. At the present state of development, the method affords a capability for identifying and quantitating one or two compounds that are members of a set of some number (typically of the order of a dozen) known compounds. In principle, the method could be extended to enable monitoring of more than two compounds. An electronic nose consists of an array of sensors, typically made from polymer carbon composites, the electrical resistances of which change upon exposure to a variety of chemicals. By design, each sensor is unique in its responses to these chemicals: some or all of the sensitivities of a given sensor to the various vapors differ from the corresponding sensitivities of other sensors. In general, the responses of the sensors are nonlinear functions of the concentrations of the chemicals. Hence, mathematically, the monitoring problem is to solve the set of time-dependent nonlinear equations for the sensor responses to obtain the time dependent concentrations of individual compounds. In the present developmental method, successive approximations of the solution are generated by a learning algorithm based on independent-component analysis (ICA) an established information theoretic approach for transforming a vector of observed interdependent signals into a set of signals that are as nearly statistically independent as possible.

Duong, Tuan↗

An Explicit Upwind Algorithm for Solving the Parabolized Navier-Stokes Equations

An explicit, upwind algorithm was developed for the direct (noniterative) integration of the 3-D Parabolized Navier-Stokes (PNS) equations in a generalized coordinate system. The new algorithm uses upwind approximations of the numerical fluxes for the pressure and convection terms obtained by combining flux difference splittings (FDS) formed from the solution of an approximate Riemann (RP). The approximate RP is solved using an extension of the method developed by Roe for steady supersonic flow of an ideal gas. Roe's method is extended for use with the 3-D PNS equations expressed in generalized coordinates and to include Vigneron's technique of splitting the streamwise pressure gradient. The difficulty associated with applying Roe's scheme in the subsonic region is overcome. The second-order upwind differencing of the flux derivatives are obtained by adding FDS to either an original forward or backward differencing of the flux derivative. This approach is used to modify an explicit MacCormack differencing scheme into an upwind differencing scheme. The second order upwind flux approximations, applied with flux limiters, provide a method for numerically capturing shocks without the need for additional artificial damping terms which require adjustment by the user. In addition, a cubic equation is derived for determining Vegneron's pressure splitting coefficient using the updated streamwise flux vector. Decoding the streamwise flux vector with the updated value of Vigneron's pressure splitting improves the stability of the scheme. The new algorithm is applied to 2-D and 3-D supersonic and hypersonic laminar flow test cases. Results are presented for the experimental studies of Holden and of Tracy. In addition, a flow field solution is presented for a generic hypersonic aircraft at a Mach number of 24.5 and angle of attack of 1 degree. The computed results compare well to both experimental data and numerical results from other algorithms. Computational times required for the upwind PNS code are approximately equal to an explicit PNS MacCormack's code and existing implicit PNS solvers.

Korte, John J.↗

Choice of velocity variables for complex flow computation

The issue of adopting the velocity components as dependent velocity variables for the Navier-Stokes flow computations is investigated. The viewpoint advocated is that a numerical algorithm should preferably honor both the physical conservation law in differential form and the geometric conservation law in discrete form. With the use of Cartesian velocity vector, the momentum equations in curvilinear coordinates can retain the full conservation-law form and satisfy the physical conservation laws. With the curvilinear velocity components, source terms appear in differential equations and hence the full conservation law form can not be retained. In discrete expressions, algorithms based on the Cartesian components can satisfy the geometric conservation-law form for convection terms but not for viscous terms; those based on the curvilinear components, on the other hand, cannot satisfy the geometric conservation-law form for either convection or viscous terms. Several flow solutions for domain with 90 and 360 degree turnings are presented to illustrate the issues of using the Cartesian velocity components and the staggered grid arrangement.

Shyy, W.↗

New developments in astrodynamics algorithms for autonomous rendezvous

A the core of any autonomous rendezvous guidance system must be two algorithms for solving Lambert's and Kepler's problems, the two fundamental problems in classical astrodynamics. Lambert's problem is to determine the trajectory connecting specified initial and terminal position vectors in a specified transfer time. The solution is the initial and terminal velocity vectors. Kepler's problem is to determine the trajectory that stems from a given initial state (position and velocity). The solution is the state of an earlier or later specified time. To be suitable for flight software, astrodynamics algorithms must be totally reliable, compact, and fast. Although solving Lambert's and Kepler's problems has challenged some of the world's finest minds for over two centuries, only in the last year have algorithms appeared that satisfy all three requirements just stated. This paper presents an evaluation of the most highly regarded Lambert and Kepler algorithms.

Klumpp, Allan R.↗

An alternating direction implicit method for the Control Data STAR-100 vector computer

An implementation of the alternating direction implicit (ADI) method for the Control Data STAR-100 computer is presented and analyzed. Two parallel algorithms, both of which are most efficient when used to solve many independent tridiagonal systems of equations, are discussed relative to their usefulness in an ADI implementation on the STAR-100 computer. It is shown that it may be desirable to alternate between the parallel algorithms as the direction of implicitness is alternated in order to eliminate the data rearrangement which would otherwise be required. The applicability of the two parallel tridiagonal solvers to several other numerical algorithms is also discussed.

Lambiotte, J. J., Jr.↗

The real-time acquisition and tracking program for the USNS Vanguard

The computer program for the real-time acquisition and tracking program uses a variety of filtering algorithms including an extended Kalman filter to derive real-time orbit determination (position-velocity state vectors) from shipboard tracking and navigation data. Results from Apollo missions are given to show that orbital parameters can be estimated quickly and accurately using these methods.

Brammer, R. F.↗

Real-time shipboard orbit determination using Kalman filtering techniques

The real-time tracking and orbit determination program used on board the NASA tracking ship, the USNS Vanguard, is described in this paper. The computer program uses a variety of filtering algorithms, including an extended Kalman filter, to derive real-time orbit determinations (position-velocity state vectors) from shipboard tracking and navigation data. Results from Apollo missions are given to show that orbital parameters can be estimated quickly and accurately using these methods.

Brammer, R. F.↗

Gram-Schmidt algorithms for covariance propagation

This paper addresses the time propagation of triangular covariance factors. Attention is focused on the square-root free factorization, P = UDU/T/, where U is unit upper triangular and D is diagonal. An efficient and reliable algorithm for U-D propagation is derived which employs Gram-Schmidt orthogonalization. Partitioning the state vector to distinguish bias and colored process noise parameters increases mapping efficiency. Cost comparisons of the U-D, Schmidt square-root covariance and conventional covariance propagation methods are made using weighted arithmetic operation counts. The U-D time update is shown to be less costly than the Schmidt method; and, except in unusual circumstances, it is within 20% of the cost of conventional propagation.

Thornton, C. L.↗

Gram-Schmidt algorithms for covariance propagation

This paper addresses the time propagation of triangular covariance factors. Attention is focused on the square-root free factorization, P = UD(transpose of U), where U is unit upper triangular and D is diagonal. An efficient and reliable algorithm for U-D propagation is derived which employs Gram-Schmidt orthogonalization. Partitioning the state vector to distinguish bias and coloured process noise parameters increase mapping efficiency. Cost comparisons of the U-D, Schmidt square-root covariance and conventional covariance propagation methods are made using weighted arithmetic operation counts. The U-D time update is shown to be less costly than the Schmidt method; and, except in unusual circumstances, it is within 20% of the cost of conventional propagation.

Thornton, C. L.↗

A multigrid method for the Euler equations

A multigrid algorithm has been developed for the numerical solution of the steady two-dimensional Euler equations. Flux vector splitting and one-sided differencing are employed to define the spatial discretization. Newton's method is used to solve the nonlinear equations, and a multigrid solver is used on each linear problem. The relaxation scheme for the linear problems is symmetric Gauss-Seidel. Standard restriction and interpolation operators are employed. Local mode analysis is used to predict the convergence rate of the multigrid process on the linear problems. Computed results for transonic flows over airfoils are presented.

Jespersen, D. C.↗

VLSI circuit simulation using a vector computer

Simulation of circuits having more than 2000 active devices requires the largest, fastest computers available. A vector computer, such as the CYBER 205, can yield great speed and cost advantages if efforts are made to adapt the simulation program to the strengths of the computer. ASPEC and SPICE (1), two widely used circuit simulation programs, are discussed. ASPECV and VAMOS (5) are respectively vector adaptations of these two simulators. They demonstrate the substantial performance enhancements possible for this class of algorithm on the CYBER 205.

Mcgrogan, S. K.↗

Calibration of neural networks using genetic algorithms, with application to optimal path planning

Genetic algorithms (GA) are used to search the synaptic weight space of artificial neural systems (ANS) for weight vectors that optimize some network performance function. GAs do not suffer from some of the architectural constraints involved with other techniques and it is straightforward to incorporate terms into the performance function concerning the metastructure of the ANS. Hence GAs offer a remarkably general approach to calibrating ANS. GAs are applied to the problem of calibrating an ANS that finds optimal paths over a given surface. This problem involves training an ANS on a relatively small set of paths and then examining whether the calibrated ANS is able to find good paths between arbitrary start and end points on the surface.

Smith, Terence R.↗