Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic efficiency”

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 1,081 records · Page 60

A review of reduced Navier-Stokes computations for compressible viscous flows

A reduced form of the Navier-Stokes equations, defined by a single composite of the Euler, boundary layer, and triple deck approximations, is considered for the computation of viscous interacting flows. Global pressure or pseudopotential relaxation methods are integrated with coupled sparse matrix direct solvers or coupled strongly implicit ILU algorithms to efficiently capture sharp shocks and regions of recirculation. Solutions are obtained for a variety of 2D and 3D geometries and for Mach numbers (M) spanning the range from incompressible (M = 0) to supersonic (M = 6) flow.

Rubin, S. G.↗

Optimal processor assignment for pipeline computations

The availability of large scale multitasked parallel architectures introduces the following processor assignment problem for pipelined computations. Given a set of tasks and their precedence constraints, along with their experimentally determined individual responses times for different processor sizes, find an assignment of processor to tasks. Two objectives are of interest: minimal response given a throughput requirement, and maximal throughput given a response time requirement. These assignment problems differ considerably from the classical mapping problem in which several tasks share a processor; instead, it is assumed that a large number of processors are to be assigned to a relatively small number of tasks. Efficient assignment algorithms were developed for different classes of task structures. For a p processor system and a series parallel precedence graph with n constituent tasks, an O(np2) algorithm is provided that finds the optimal assignment for the response time optimization problem; it was found that the assignment optimizing the constrained throughput in O(np2log p) time. Special cases of linear, independent, and tree graphs are also considered.

Nicol, David M.↗

Future applications of artificial intelligence to Mission Control Centers

Future applications of artificial intelligence to Mission Control Centers are presented in the form of the viewgraphs. The following subject areas are covered: basic objectives of the NASA-wide AI program; inhouse research program; constraint-based scheduling; learning and performance improvement for scheduling; GEMPLAN multi-agent planner; planning, scheduling, and control; Bayesian learning; efficient learning algorithms; ICARUS (an integrated architecture for learning); design knowledge acquisition and retention; computer-integrated documentation; and some speculation on future applications.

Friedland, Peter↗

Discrete random media techniques for microwave modeling of vegetated terrain

Microwave remote sensing models of vegetated terrain are investigated. The problem is to determine canopy characteristics such as biomass, canopy height, and the moisture of the underlying soil. The report describes a discrete scatter model which has been employed to model backscatter in the active (radar) case and to model brightness temperature in the passive (radiometric) case. The acquisition of ground truth data is discussed, as well as the comparison of theory and experiment. The overall conclusion of the work has been that the discrete scatter model in conjunction with efficient scatter algorithms and the distorted Born approximation is a most appropriate methodology to use for modeling purposes in the microwave region.

Lang, Roger H.↗

A three-dimensional radiative transfer method for optical remote sensing of vegetated land surfaces

A numerical method for solving the radiative transfer equation in three spatial dimensions is briefly discussed focusing on an efficient acceleration algorithm. The reliability of coding and accuracy of the algorithm are evaluated by benchmarking. Parameterization of the method and results of a simulation are presented to document the utility of the method for remote sensing applications. Attention is also given to a simple model of the hot spot effect and sample calculations.

Myneni, R. B.↗

Flexible language constructs for large parallel programs

The goal of the research described is to develop flexible language constructs for writing large data parallel numerical programs for distributed memory (MIMD) multiprocessors. Previously, several models have been developed to support synchronization and communication. Models for global synchronization include SIMD (Single Instruction Multiple Data), SPMD (Single Program Multiple Data), and sequential programs annotated with data distribution statements. The two primary models for communication include implicit communication based on shared memory and explicit communication based on messages. None of these models by themselves seem sufficient to permit the natural and efficient expression of the variety of algorithms that occur in large scientific computations. An overview of a new language that combines many of these programming models in a clean manner is given. This is done in a modular fashion such that different models can be combined to support large programs. Within a module, the selection of a model depends on the algorithm and its efficiency requirements. An overview of the language and discussion of some of the critical implementation details is given.

Rosing, Matthew↗

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.↗

Efficient massively parallel simulation of dynamic channel assignment schemes for wireless cellular communications

Fast, efficient parallel algorithms are presented for discrete event simulations of dynamic channel assignment schemes for wireless cellular communication networks. The driving events are call arrivals and departures, in continuous time, to cells geographically distributed across the service area. A dynamic channel assignment scheme decides which call arrivals to accept, and which channels to allocate to the accepted calls, attempting to minimize call blocking while ensuring co-channel interference is tolerably low. Specifically, the scheme ensures that the same channel is used concurrently at different cells only if the pairwise distances between those cells are sufficiently large. Much of the complexity of the system comes from ensuring this separation. The network is modeled as a system of interacting continuous time automata, each corresponding to a cell. To simulate the model, conservative methods are used; i.e., methods in which no errors occur in the course of the simulation and so no rollback or relaxation is needed. Implemented on a 16K processor MasPar MP-1, an elegant and simple technique provides speedups of about 15 times over an optimized serial simulation running on a high speed workstation. A drawback of this technique, typical of conservative methods, is that processor utilization is rather low. To overcome this, new methods were developed that exploit slackness in event dependencies over short intervals of time, thereby raising the utilization to above 50 percent and the speedup over the optimized serial code to about 120 times.

Greenberg, Albert G.↗

Algorithm and code development for unsteady three-dimensional Navier-Stokes equations

Aeroelastic tests require extensive cost and risk. An aeroelastic wind-tunnel experiment is an order of magnitude more expensive than a parallel experiment involving only aerodynamics. By complementing the wind-tunnel experiments with numerical simulations, the overall cost of the development of aircraft can be considerably reduced. In order to accurately compute aeroelastic phenomenon it is necessary to solve the unsteady Euler/Navier-Stokes equations simultaneously with the structural equations of motion. These equations accurately describe the flow phenomena for aeroelastic applications. At ARC a code, ENSAERO, is being developed for computing the unsteady aerodynamics and aeroelasticity of aircraft, and it solves the Euler/Navier-Stokes equations. The purpose of this cooperative agreement was to enhance ENSAERO in both algorithm and geometric capabilities. During the last five years, the algorithms of the code have been enhanced extensively by using high-resolution upwind algorithms and efficient implicit solvers. The zonal capability of the code has been extended from a one-to-one grid interface to a mismatching unsteady zonal interface. The geometric capability of the code has been extended from a single oscillating wing case to a full-span wing-body configuration with oscillating control surfaces. Each time a new capability was added, a proper validation case was simulated, and the capability of the code was demonstrated.

Obayashi, Shigeru↗

Direct numerical simulation of transition: The spatial approach

The objective of this paper is to review the efforts in spatial direct numerical simulations for transition modeling. Much recent success has been realized in the development of more efficient numerical algorithms as well as a robust downstream boundary condition. Efforts at explaining complex physical phenomena through the use of simulations are reviewed.

Reed, Helen L.↗

A CFD study of complex missile and store configurations in relative motion

An investigation was conducted from May 16, 1990 to August 31, 1994 on the development of computational fluid dynamics (CFD) methodologies for complex missiles and the store separation problem. These flowfields involved multiple-component configurations, where at least one of the objects was engaged in relative motion. The two most important issues that had to be addressed were: (1) the unsteadiness of the flowfields (time-accurate and efficient CFD algorithms for the unsteady equations), and (2) the generation of grid systems which would permit multiple and moving bodies in the computational domain (dynamic domain decomposition). The study produced two competing and promising methodologies, and their proof-of-concept cases, which have been reported in the open literature: (1) Unsteady solutions on dynamic, overlapped grids, which may also be perceived as moving, locally-structured grids, and (2) Unsteady solutions on dynamic, unstructured grids.

Baysal, Oktay↗

CFD flowfield simulation of Delta Launch Vehicles in a power-on configuration

This paper summarizes recent work at McDonnell Douglas Aerospace (MDA) to develop and validate computational fluid dynamic (CFD) simulations of under expanded rocket plume external flowfields for multibody expendable launch vehicles (ELVs). Multi engine reacting gas flowfield predictions of ELV base pressures are needed to define vehicle base drag and base heating rates for sizing external nozzle and base region insulation thicknesses. Previous ELV design programs used expensive multibody power-on wind tunnel tests that employed chamber/nozzle injected high pressure cold or hot-air. Base heating and pressure measurements were belatedly made during the first flights of past ELV's to correct estimates from semi-empirical engineering models or scale model tests. Presently, CFD methods for use in ELV design are being jointly developed at the Space Transportation Division (MDA-STD) and New Aircraft Missiles Division (MDA-NAMD). An explicit three dimensional, zonal, finite-volume, full Navier-Stokes (FNS) solver with finite rate hydrocarbon/air and aluminum combustion kinetics was developed to accurately compute ELV power-on flowfields. Mississippi State University's GENIE++ general purpose interactive grid generation code was chosen to create zonal, finite volume viscous grids. Axisymmetric, time dependent, turbulent CFD simulations of a Delta DSV-2A vehicle with a MB-3 liquid main engine burning RJ-1/LOX were first completed. Hydrocarbon chemical kinetics and a k-epsilon turbulence model were employed and predictions were validated with flight measurements of base pressure and temperature. Zonal internal/external grids were created for a Delta DSV-2C vehicle with a MB-3 and three Castor-1 solid motors burning and a Delta-2 with an RS-27 main engine (LOX/RP-1) and 9 GEM's attached/6 burning. Cold air, time dependent FNS calculations were performed for DSV-2C during 1992. Single phase simulations that employ finite rate hydrocarbon and aluminum (solid fuel) combustion chemistry are currently in progress. Reliable and efficient Eulerian algorithms are needed to model two phase (solid-gas) momentum and energy transfer mechanisms for solid motor fuel combustion products.

Pavish, D. L.↗

An authoring system for creating a practice environment in the network service field

This paper describes an authoring system whose main purpose is to reduce the cost of developing and maintaining courseware which contains procedural knowledge used in the network service field. This aim can be achieved by considering the characteristics of this field. Material knowledge is divided into two parts, behavioral knowledge and procedural knowledge. We show that both of these parts are constructed by an easy authoring methods and efficient modification algorithms. This authoring system has been used to build several types of courseware, and the development costs have been reduced.

Kiyama, Minoru↗

Satellite Angular Rate Estimation From Vector Measurements

This paper presents an algorithm for estimating the angular rate vector of a satellite which is based on the time derivatives of vector measurements expressed in a reference and body coordinate. The computed derivatives are fed into a spacial Kalman filter which yields an estimate of the spacecraft angular velocity. The filter, named Extended Interlaced Kalman Filter (EIKF), is an extension of the Kalman filter which, although being linear, estimates the state of a nonlinear dynamic system. It consists of two or three parallel Kalman filters whose individual estimates are fed to one another and are considered as known inputs by the other parallel filter(s). The nonlinear dynamics stem from the nonlinear differential equation that describes the rotation of a three dimensional body. Initial results, using simulated data, and real Rossi X ray Timing Explorer (RXTE) data indicate that the algorithm is efficient and robust.

Azor, Ruth↗

Examination of a Practical Aerobraking Guidance Algorithm

A practical real time guidance algorithm has been developed for aerobraking vehicles that minimizes the post-aeropass Delta V requirements for orbit insertion while nearly minimizing the maximum heating rate and the maximum structural loads. The algorithm is general in the sense that a minimum of assumptions is made, thus greatly reducing the number of parameters that must be determined prior to a given mission. An interesting feature is that in-plane guidance performance is tuned by adjusting one mission-dependent parameter, the bank margin; similarly, the out-of-plane guidance performance is tuned by adjusting a plane controller time constant. Other features of the algorithm are simplicity, efficiency, and ease of use. The algorithm is designed for, but not restricted to, a trimmed vehicle with bank angle modulation as the method of trajectory control. Performance of this guidance algorithm during flight in Earth's atmosphere is examined by its use in an aerobraking testbed program. The performance inquiry extends to a wide range of entry speeds covering a number of potential mission applications. Favorable results have been obtained with a minimum of development effort, and directions for improvement of performance are indicated.

Evans, Steven W.↗

Managing Distributed Systems with Smart Subscriptions

We describe an event-based, publish-and-subscribe mechanism based on using 'smart subscriptions' to recognize weakly-structured events. We present a hierarchy of subscription languages (propositional, predicate, temporal and agent) and algorithms for efficiently recognizing event matches. This mechanism has been applied to the management of distributed applications.

Filman, Robert E.↗

A Non-Linear Approach to Spacecraft Formation Control in the Vicinity of a Collinear Libration Point

An expanding interest in mission design strategies that exploit libration point regions, demands the continued development of enhanced, efficient, control algorithms for station-keeping and formation maintenance. Linear control strategies have been developed for station-keeping. However, their region of stability is bounded by the assumptions required for linearizing the governing equations of motion. For example, reference [I] discusses the development of a linear control design for maintaining a halo orbit about the Earth-Moon L2 libration point. Trial runs indicated the trajectory was unstable for starting points exceeding 45,000 km from the L2 point. Also, there was significant growth in the control effort required to maintain the orbit as the nominal radius increased. This result is a consequence of the increased influence of the system non-linearities, as the trajectory deviated from the linearization point, L2. As an alternative, this paper presents the development of a non-linear control strategy, based on a Hamiltonian formulation of the equations of motion. The control strategy is applied to the problem of formation maintenance, rather than simple station

Luquette, Richard J.↗

Computation of Reacting Flows in Combustion Processes

The objective of this research is to develop an efficient numerical algorithm with unstructured grids for the computation of three-dimensional chemical reacting flows that are known to occur in combustion components of propulsion systems. During the grant period (1996 to 1999), two companion codes have been developed and various numerical and physical models were implemented into the two codes.

Keith, Theo G., Jr.↗