Search NASA⌕ Search

SEARCH · Search NASA

Results for “dynamic programming 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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

Implementation of a fully-balanced periodic tridiagonal solver on a parallel distributed memory architecture

While parallel computers offer significant computational performance, it is generally necessary to evaluate several programming strategies. Two programming strategies for a fairly common problem - a periodic tridiagonal solver - are developed and evaluated. Simple model calculations as well as timing results are presented to evaluate the various strategies. The particular tridiagonal solver evaluated is used in many computational fluid dynamic simulation codes. The feature that makes this algorithm unique is that these simulation codes usually require simultaneous solutions for multiple right-hand-sides (RHS) of the system of equations. Each RHS solutions is independent and thus can be computed in parallel. Thus a Gaussian elimination type algorithm can be used in a parallel computation and the more complicated approaches such as cyclic reduction are not required. The two strategies are a transpose strategy and a distributed solver strategy. For the transpose strategy, the data is moved so that a subset of all the RHS problems is solved on each of the several processors. This usually requires significant data movement between processor memories across a network. The second strategy attempts to have the algorithm allow the data across processor boundaries in a chained manner. This usually requires significantly less data movement. An approach to accomplish this second strategy in a near-perfect load-balanced manner is developed. In addition, an algorithm will be shown to directly transform a sequential Gaussian elimination type algorithm into the parallel chained, load-balanced algorithm.

Eidson, T. M.↗
NASA NTRS1997

Efficient Parallel Kernel Solvers for Computational Fluid Dynamics Applications

Distributed-memory parallel computers dominate today's parallel computing arena. These machines, such as Intel Paragon, IBM SP2, and Cray Origin2OO, have successfully delivered high performance computing power for solving some of the so-called "grand-challenge" problems. Despite initial success, parallel machines have not been widely accepted in production engineering environments due to the complexity of parallel programming. On a parallel computing system, a task has to be partitioned and distributed appropriately among processors to reduce communication cost and to attain load balance. More importantly, even with careful partitioning and mapping, the performance of an algorithm may still be unsatisfactory, since conventional sequential algorithms may be serial in nature and may not be implemented efficiently on parallel machines. In many cases, new algorithms have to be introduced to increase parallel performance. In order to achieve optimal performance, in addition to partitioning and mapping, a careful performance study should be conducted for a given application to find a good algorithm-machine combination. This process, however, is usually painful and elusive. The goal of this project is to design and develop efficient parallel algorithms for highly accurate Computational Fluid Dynamics (CFD) simulations and other engineering applications. The work plan is 1) developing highly accurate parallel numerical algorithms, 2) conduct preliminary testing to verify the effectiveness and potential of these algorithms, 3) incorporate newly developed algorithms into actual simulation packages. The work plan has well achieved. Two highly accurate, efficient Poisson solvers have been developed and tested based on two different approaches: (1) Adopting a mathematical geometry which has a better capacity to describe the fluid, (2) Using compact scheme to gain high order accuracy in numerical discretization. The previously developed Parallel Diagonal Dominant (PDD) algorithm and Reduced Parallel Diagonal Dominant (RPDD) algorithm have been carefully studied on different parallel platforms for different applications, and a NASA simulation code developed by Man M. Rai and his colleagues has been parallelized and implemented based on data dependency analysis. These achievements are addressed in detail in the paper.

Sun, Xian-He↗
NASA NTRS1986

Multiple grid problems on concurrent-processing computers

Three computer codes were studied which make use of concurrent processing computer architectures in computational fluid dynamics (CFD). The three parallel codes were tested on a two processor multiple-instruction/multiple-data (MIMD) facility at NASA Ames Research Center, and are suggested for efficient parallel computations. The first code is a well-known program which makes use of the Beam and Warming, implicit, approximate factored algorithm. This study demonstrates the parallelism found in a well-known scheme and it achieved speedups exceeding 1.9 on the two processor MIMD test facility. The second code studied made use of an embedded grid scheme which is used to solve problems having complex geometries. The particular application for this study considered an airfoil/flap geometry in an incompressible flow. The scheme eliminates some of the inherent difficulties found in adapting approximate factorization techniques onto MIMD machines and allows the use of chaotic relaxation and asynchronous iteration techniques. The third code studied is an application of overset grids to a supersonic blunt body problem. The code addresses the difficulties encountered when using embedded grids on a compressible, and therefore nonlinear, problem. The complex numerical boundary system associated with overset grids is discussed and several boundary schemes are suggested. A boundary scheme based on the method of characteristics achieved the best results.

Eberhardt, D. S.↗
NASA NTRS1987

Symbolic modeling of flexible manipulators

An algorithm is presented to symbolically derive the full nonlinear dynamic equations of motion of multilink flexible manipulators. Lagrange's assumed modes method is the basis of new algorithm and adapted in a way suitable for symbolic manipulation by digital computers. It is applied to model a two-link flexible arm by means of a commercially available symbolic manipulation program. The advantages of the algorithm and simulation results are discussed.

Cetinkunt, Sabri↗
NASA NTRS2009

X-48B Flight Research Progress Overview

Program Objectives; I. Assess stability & control characteristics of a BWB class vehicle in free-flight conditions: a) Assess dynamic interaction of control surfaces; b) Assess control requirements to accommodate asymmetric thrust; c) Assess stability and controllability about each axis at a range of flight conditions II. Assess flight control algorithms designed to provide desired flight characteristics: a) Assess control surface allocation and blending; b) Assess edge of envelope protection schemes; c) Assess takeoff and landing characteristics; d) Test experimental control laws and control design methods. III. Evaluate prediction and test methods for BWB class vehicles: a) Correlate flight measurements with ground-based predictions and measurements.

Risch, Tim↗
NASA NTRS2002

Reducing False Positives in Runtime Analysis of Deadlocks

This paper presents an improvement of a standard algorithm for detecting dead-lock potentials in multi-threaded programs, in that it reduces the number of false positives. The standard algorithm works as follows. The multi-threaded program under observation is executed, while lock and unlock events are observed. A graph of locks is built, with edges between locks symbolizing locking orders. Any cycle in the graph signifies a potential for a deadlock. The typical standard example is the group of dining philosophers sharing forks. The algorithm is interesting because it can catch deadlock potentials even though no deadlocks occur in the examined trace, and at the same time it scales very well in contrast t o more formal approaches to deadlock detection. The algorithm, however, can yield false positives (as well as false negatives). The extension of the algorithm described in this paper reduces the amount of false positives for three particular cases: when a gate lock protects a cycle, when a single thread introduces a cycle, and when the code segments in different threads that cause the cycle can actually not execute in parallel. The paper formalizes a theory for dynamic deadlock detection and compares it to model checking and static analysis techniques. It furthermore describes an implementation for analyzing Java programs and its application to two case studies: a planetary rover and a space craft altitude control system.

Bensalem, Saddek↗
NASA NTRS1982

Experiences with explicit finite-difference schemes for complex fluid dynamics problems on STAR-100 and CYBER-203 computers

Several two- and three-dimensional external and internal flow problems solved on the STAR-100 and CYBER-203 vector processing computers are described. The flow field was described by the full Navier-Stokes equations which were then solved by explicit finite-difference algorithms. Problem results and computer system requirements are presented. Program organization and data base structure for three-dimensional computer codes which will eliminate or improve on page faulting, are discussed. Storage requirements for three-dimensional codes are reduced by calculating transformation metric data in each step. As a result, in-core grid points were increased in number by 50% to 150,000, with a 10% execution time increase. An assessment of current and future machine requirements shows that even on the CYBER-205 computer only a few problems can be solved realistically. Estimates reveal that the present situation is more storage limited than compute rate limited, but advancements in both storage and speed are essential to realistically calculate three-dimensional flow.

Kumar, A.↗
NASA NTRS1983

An application of nonlinear programming to the design of regulators of a linear-quadratic formulation

A design technique is proposed for linear regulators in which a feedback controller of fixed structure is chosen to minimize an integral quadratic objective function subject to the satisfaction of integral quadratic constraint functions. Application of a nonlinear programming algorithm to this mathematically tractable formulation results in an efficient and useful computer aided design tool. Particular attention is paid to computational efficiency and various recommendations are made. Two design examples illustrate the flexibility of the approach and highlight the special insight afforded to the designer. One concerns helicopter longitudinal dynamics and the other the flight dynamics of an aerodynamically unstable aircraft.

Fleming, P.↗
NASA NTRS2001

Do nonlinearities play a significant role in short term, beat-to-beat variability?

Numerous studies of short-term beat-to-beat variability in cardiovascular signals have not resolved the debate about the completeness of linear analysis techniques. This aim of this paper is to evaluate further the role of nonlinearities in short-term, beat-to-beat variability. We compared linear autoregressive moving average (ARMA) and nonlinear neural network (NN) models for predicting instantaneous heart rate (HR) and mean arterial blood pressure (BP) from past HR and BP. To evaluate these models, we used HR and BP time series from the MIMIC database. Experimental results indicate that NN-based nonlinearities do not play a significant role and suggest that ARMA linear analysis techniques provide adequate characterization of the system dynamics responsible for generating short-term, beat-to-beat variability.

NASA Discipline Cardiopulmonary↗
NASA NTRS2004

Optimizing Mars Airplane Trajectory with the Application Navigation System

Planning complex missions requires a number of programs to be executed in concert. The Application Navigation System (ANS), developed in the NAS Division, can execute many interdependent programs in a distributed environment. We show that the ANS simplifies user effort and reduces time in optimization of the trajectory of a martian airplane. We use a software package, Cart3D, to evaluate trajectories and a shortest path algorithm to determine the optimal trajectory. ANS employs the GridScape to represent the dynamic state of the available computer resources. Then, ANS uses a scheduler to dynamically assign ready task to machine resources and the GridScape for tracking available resources and forecasting completion time of running tasks. We demonstrate system capability to schedule and run the trajectory optimization application with efficiency exceeding 60% on 64 processors.

Frumkin, Michael↗
NASA NTRS2009

X-48B Flight Research - Test Progress and Instrumentation Needs for the Future

Program Objectives: I. Assess stability & control characteristics of a BWB class vehicle in free-flight conditions: a) Assess dynamic interaction of control surfaces; b) Assess control requirements to accommodate asymmetric thrust; and c) Assess stability and controllability about each axis at a range of flight conditions. II. Assess flight control algorithms designed to provide desired flight characteristics: a) Assess control surface allocation and blending; b) Assess edge of envelope protection schemes; c) Assess takeoff and landing characteristics; and d) Test experimental control laws and control design methods III. Evaluate prediction and test methods for BWB class vehicles: a) Correlate flight measurements with ground-based predictions and measurements.

Risch, Tim↗
NASA NTRSDate not supplied

GPU Implementation of the OVERFLOW CFD Code

The high-performance computing (HPC) landscape is quickly changing to systems where most of the performance comes from specialized chips, specifically graphics processing units (GPUs). Such GPU systems are throughput machines, where efficient use of the GPU often requires code refactoring to expose a few orders of magnitude more fine grain parallelism than was previously used on the CPU. Recent modifications to OVERFLOW, an overset, structured grid, computational fluid dynamics flow solver, written in Fortran will be presented. These modifications include both code modernization efforts and algorithmic changes to enable OVERFLOW to efficiently utilize GPUs. Many of these algorithmic changes would likely also be applicable for other structured grid, stencil-based codes wanting to utilize GPUs. The capabilities that have been ported to run on the GPUs are presented, along with the performance gains of the GPU version relative the CPU version of OVERFLOW.

GPU Programming↗
NASA NTRS1989

A spatial operator algebra for manipulator modeling and control

A recently developed spatial operator algebra, useful for modeling, control, and trajectory design of manipulators is discussed. The elements of this algebra are linear operators whose domain and range spaces consist of forces, moments, velocities, and accelerations. The effect of these operators is equivalent to a spatial recursion along the span of a manipulator. Inversion of operators can be efficiently obtained via techniques of recursive filtering and smoothing. The operator algebra provides a high level framework for describing the dynamic and kinematic behavior of a manipulator and control and trajectory design algorithms. The interpretation of expressions within the algebraic framework leads to enhanced conceptual and physical understanding of manipulator dynamics and kinematics. Furthermore, implementable recursive algorithms can be immediately derived from the abstract operator expressions by inspection. Thus, the transition from an abstract problem formulation and solution to the detailed mechanizaton of specific algorithms is greatly simplified. The analytical formulation of the operator algebra, as well as its implementation in the Ada programming language are discussed.

Rodriguez, G.↗
NASA NTRS1991

The NAS parallel benchmarks

A new set of benchmarks has been developed for the performance evaluation of highly parallel supercomputers in the framework of the NASA Ames Numerical Aerodynamic Simulation (NAS) Program. These consist of five 'parallel kernel' benchmarks and three 'simulated application' benchmarks. Together they mimic the computation and data movement characteristics of large-scale computational fluid dynamics applications. The principal distinguishing feature of these benchmarks is their 'pencil and paper' specification-all details of these benchmarks are specified only algorithmically. In this way many of the difficulties associated with conventional benchmarking approaches on highly parallel systems are avoided.

Bailey, D. H.↗
NASA NTRS1994

Dynamics of the McDonnell-Douglas Large Scale Dynamic Rig and dynamic calibration of the rotor balance

A shake test was performed on the Large Scale Dynamic Rig in the 40- by 80-Foot Wind Tunnel in support of the McDonnell Douglas Advanced Rotor Technology (MDART) Test Program. The shake test identifies the hub modes and the dynamic calibration matrix of the rotor balance. For hub mode identification, three configurations were tested: wind tunnel scale unlocked with dampers engaged and disengaged, and wind tunnel scale locked. Test data were analyzed with a multi-degree-of-freedom time domain algorithm to identify the modal properties of the hub modes. The damping of the low frequency hub modes (ground resonance modes) increases significantly with the wind tunnel dampers engaged. For dynamic calibration of the rotor balance, the shake test was performed only with the wind tunnel dampers engaged. The dynamic calibration matrix, computed from the shake test data using a least squares error method, is used to correct the five-per-rev vibratory balance readings. The corrections are large for the side force, moderate for the axial force and inplane hub moments, and small for the normal force.

Nguyen, Khanh↗
NASA NTRS2009

Parametric Optimization of Ares I Propellant Slosh Characteristics Using Frequency Response Criteria

A novel technique for developing propellant slosh damping requirements with respect to the stability characteristics of large flexible launch vehicles is presented. A numerical algorithm is devised which allows an automated software program to rapidly converge to pseudo-optimal solutions that minimize required propellant slosh damping for multiple tanks while maintaining constraints on the frequency response characteristics of a particular open-loop plant transfer function. An implementation of the algorithm using a high-order linear model of the Ares I plant dynamics considers all relevant dynamic interactions of flexible body modes, propellant slosh, and nozzle inertia effects. A high-resolution propellant damping requirements table is produced that can be used for baffle design. The method is demonstrated to provide exceptional speed and accuracy when compared with the alternative human-in-the-loop approach.

Orr, Jeb S.↗
NASA NTRS1995

Analysis of shadowing effects on spacecraft power systems

This paper describes the Orbiting Spacecraft Shadowing Analysis (OSSA) computer program that was developed at NASA Lewis Research Center in order to assess the shadowing effects on various power systems. The algorithms, inputs and outputs are discussed. Examples of typical shadowing analyses that have been performed for the International Space Station Freedom, International Space Station Alpha and the joint United States/Russian Mir Solar Dynamic Flight Experiment Project are covered. Effects of shadowing on power systems are demonstrated.

Fincannon, H. J.↗
NASA NTRS2007

Translator for Optimizing Fluid-Handling Components

A software interface has been devised to facilitate optimization of the shapes of valves, elbows, fittings, and other components used to handle fluids under extreme conditions. This software interface translates data files generated by PLOT3D (a NASA grid-based plotting-and- data-display program) and by computational fluid dynamics (CFD) software into a format in which the files can be read by Sculptor, which is a shape-deformation- and-optimization program. Sculptor enables the user to interactively, smoothly, and arbitrarily deform the surfaces and volumes in two- and three-dimensional CFD models. Sculptor also includes design-optimization algorithms that can be used in conjunction with the arbitrary-shape-deformation components to perform automatic shape optimization. In the optimization process, the output of the CFD software is used as feedback while the optimizer strives to satisfy design criteria that could include, for example, improved values of pressure loss, velocity, flow quality, mass flow, etc.

Landon, Mark↗