Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “fast 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 595 records · Page 33

Multiresolution GPC-Structured Control of a Single-Loop Cold-Flow Chemical Looping Testbed

Chemical looping is a near-zero emission process for generating power from coal. It is based on a multi-phase gas-solid flow and has extremely challenging nonlinear, multi-scale dynamics with jumps, producing large dynamic model uncertainty, which renders traditional robust control techniques, such as linear parameter varying H ∞ design, largely inapplicable. This process complexity is addressed in the present work through the temporal and the spatiotemporal multiresolution modeling along with the corresponding model-based control laws. Namely, the nonlinear autoregressive with exogenous input model structure, nonlinear in the wavelet basis, but linear in parameters, is used to identify the dominant temporal chemical looping process dynamics. The control inputs and the wavelet model parameters are calculated by optimizing a quadratic cost function using a gradient descent method. The respective identification and tracking error convergence of the proposed self-tuning identification and control schemes, the latter using the unconstrained generalized predictive control structure, is separately ascertained through the Lyapunov stability theorem. The rate constraint on the control signal in the temporal control law is then imposed and the control topology is augmented by an additional control loop with self-tuning deadbeat controller which uses the spatiotemporal wavelet riser dynamics representation. The novelty of this work is three-fold: (1) developing the self-tuning controller design methodology that consists in embedding the real-time tunable temporal highly nonlinear, but linearly parametrizable, multiresolution system representations into the classical rate-constrained generalized predictive quadratic optimal control structure, (2) augmenting the temporal multiresolution loop by a more complex spatiotemporal multiresolution self-tuning deadbeat control loop, and (3) demonstrating the effectiveness of the proposed methodology in producing fast recursive real-time algorithms for controlling highly uncertain nonlinear multiscale processes. The latter is shown through the data from the implemented temporal and augmented spatiotemporal solutions of a difficult chemical looping cold flow tracking control problem.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Computer generation of symbolic network functions - A new theory and implementation.

A new method is presented for obtaining network functions in which some, none, or all of the network elements are represented by symbolic parameters (i.e., symbolic network functions). Unlike the topological tree enumeration or signal flow graph methods generally used to derive symbolic network functions, the proposed procedure employs fast, efficient, numerical-type algorithms to determine the contribution of those network branches that are not represented by symbolic parameters. A computer program called NAPPE (for Network Analysis Program using Parameter Extractions) and incorporating all of the concepts discussed has been written. Several examples illustrating the usefulness and efficiency of NAPPE are presented.

Alderson, G. E.↗

The 1981 NASA ASEE Summer Faculty Fellowship Program, volume 2

A collection of papers on miscellaneous subjects in aerospace research is presented. Topics discussed are: (1) Langmuir probe theory and the problem of anisotropic collection; (2) anthropometric program analysis of reach and body movement; (3) analysis of IV characteristics of negatively biased panels in a magnetoplasma; (4) analytic solution to classical two body drag problem; (5) fast variable step size integration algorithm for computer simulations of physiological systems; (6) spectroscopic experimental computer assisted empirical model for the production of energetics of excited oxygen molecules formed by atom recombination shuttle tile surfaces; and (7) capillary priming characteristics of dual passage heat pipe in zero-g.

Robertson, N. G.↗

The use of LANDSAT data to monitor the urban growth of Sao Paulo Metropolitan area

Urban growth from 1977 to 1979 of the region between Billings and the Guarapiranga reservoir was mapped and the problematic urban areas identified using several LANDSAT products. Visual and automatic interpretation techniques were applied to the data. Computer compatible tapes of LANDSAT multispectral scanner data were analyzed through the maximum likelihood Gaussian algorithm. The feasibility of monitoring fast urban growth by remote sensing techniques for efficient urban planning and control is demonstrated.

Dejesusparada, N.↗

Numerical solution of transonic wing flow fields

A fast, fully implicit, approximate factorization algorithm designed to solve the conservative full-potential equation is used to compute lifting-wing flow fields with embedded transonic flow. The computer program (TWING - transonic wing analysis) uses an elliptic-solver numerical grid-generation routine and is capable of analyzing arbitrary wing geometries with sweep, twist, taper, and section variation. Computed flowfield results for several wing geometries are presented; they demonstrate substantial improvement in convergence speed relative to the FL028 computer code.

Holst, T. L.↗

Geology and image processing

Digital image processing for geological applications will be integrated with geographic information systems and data base management systems. While multiband data sets from radar and multispectral scanners will make extreme demands on memory, bus and processor architectures, it is expected that array processors and VLSI/VHSIC dedicated function chips will allow the use of fast Fourier transform and classification algorithms. It is anticipted that, as processor power increases, the weakest link of a processing system will become the analyst who uses it. Human engineering of systems is therefore recommended for the most effective utilization of remotely sensed geologic data.

Daily, M.↗

Transonic Navier-Stokes wing solution using a zonal approach. Part 1: Solution methodology and code validation

A fast diagonalized Beam-Warming algorithm is coupled with a zonal approach to solve the three-dimensional Euler/Navier-Stokes equations. The computer code, called Transonic Navier-Stokes (TNS), uses a total of four zones for wing configurations (or can be extended to complete aircraft configurations by adding zones). In the inner blocks near the wing surface, the thin-layer Navier-Stokes equations are solved, while in the outer two blocks the Euler equations are solved. The diagonal algorithm yields a speedup of as much as a factor of 40 over the original algorithm/zonal method code. The TNS code, in addition, has the capability to model wind tunnel walls. Transonic viscous solutions are obtained on a 150,000-point mesh for a NACA 0012 wing. A three-order-of-magnitude drop in the L2-norm of the residual requires approximately 500 iterations, which takes about 45 min of CPU time on a Cray-XMP processor. Simulations are also conducted for a different geometrical wing called WING C. All cases show good agreement with experimental data.

Flores, J.↗

Transonic Navier-Stokes wing solution using a zonal approach. Part 1: Solution methodology and code validation

A fast diagonalized Beam-Warming algorithm is coupled with a zonal approach to solve the three dimensional Euler/Navier-Stokes equations. The computer code, called Transonic Navier-Stokes (TNS), uses a total of four zones for wing configurations (or can be extended to complete aircraft configurations by adding zones). In the inner blocks near the wing surface, the thin-layer Navier-Stokes equations are solved, while in the outer two blocks the Euler equations are solved. The diagonal algorithm yields a speedup of as much as a factor of 40 over the original algorithm/zonal method code. The TNS code, in addition, has the capability to model wind tunnel walls. Transonic viscous solutions are obtained on a 150,000-point mesh for a NACA 0012 wing. A three-order-of-magnitude drop in the L2-norm of the residual requires approximately 500 iterations, which takes about 45 min of CPU time on a Cray-XMP processor. Simulations are also conducted for a different geometrical wing called WING C. All cases show good agreement with experimental data.

Flores, J.↗

A static data flow simulation study at Ames Research Center

Demands in computational power, particularly in the area of computational fluid dynamics (CFD), led NASA Ames Research Center to study advanced computer architectures. One architecture being studied is the static data flow architecture based on research done by Jack B. Dennis at MIT. To improve understanding of this architecture, a static data flow simulator, written in Pascal, has been implemented for use on a Cray X-MP/48. A matrix multiply and a two-dimensional fast Fourier transform (FFT), two algorithms used in CFD work at Ames, have been run on the simulator. Execution times can vary by a factor of more than 2 depending on the partitioning method used to assign instructions to processing elements. Service time for matching tokens has proved to be a major bottleneck. Loop control and array address calculation overhead can double the execution time. The best sustained MFLOPS rates were less than 50% of the maximum capability of the machine.

Barszcz, Eric↗

Applications of the Navier-Stokes equations to wings and complex configurations using a zonal approach

The simulation of a transonic viscous flow over a series of 3-D configurations, ranging from isolated wings to relatively complete aircraft, is presented. A fast, diagonalized Beam-Warming algorithm is used in conjunction with a zonal approach to solve the Euler/Navier-Stokes equations for these applications. The computer code, called Transonic Navier-Stokes, uses four zones for wing configurations and up to 19 zones for more complete aircraft configurations. For the inner zones adjacent to no-slip surfaces, the thin-layer Navier-Stokes equations are solved, while in the outer zones the Euler equations are solved. Numerical results are presented and compared with experiment (when available) for wing calculations and a more complete configuration based on the F-16A aircraft.

Flores, Jolen↗

RenderMan design principles

The two worlds of interactive graphics and realistic graphics have remained separate. Fast graphics hardware runs simple algorithms and generates simple looking images. Photorealistic image synthesis software runs slowly on large expensive computers. The time has come for these two branches of computer graphics to merge. The speed and expense of graphics hardware is no longer the barrier to the wide acceptance of photorealism. There is every reason to believe that high quality image synthesis will become a standard capability of every graphics machine, from superworkstation to personal computer. The significant barrier has been the lack of a common language, an agreed-upon set of terms and conditions, for 3-D modeling systems to talk to 3-D rendering systems for computing an accurate rendition of that scene. Pixar has introduced RenderMan to serve as that common language. RenderMan, specifically the extensibility it offers in shading calculations, is discussed.

Apodaca, Tony↗

Automating security monitoring and analysis for Space Station Freedom's electric power system

Operating a large, space power system requires classifying the system's status and analyzing its security. Conventional algorithms are used by terrestrial electric utilities to provide such information to their dispatchers, but their application aboard Space Station Freedom will consume too much processing time. A new approach for monitoring and analysis using adaptive pattern techniques is presented. This approach yields an on-line security monitoring and analysis algorithm that is accurate and fast; and thus, it can free the Space Station Freedom's power control computers for other tasks.

Dolce, James L.↗

Automating security monitoring and analysis for Space Station Freedom's electric power system

Operating a large, space power system requires classifying the system's status and analyzing its security. Conventional algorithms are used by terrestrial electric utilities to provide such information to their dispatchers, but their application aboard Space Station Freedom will consume too much processing time. A novel approach for monitoring and analysis using adaptive pattern techniques is presented. This approach yields an on-line security monitoring and analysis algorithm that is accurate and fast; and thus, it can free the Space Station Freedom's power control computers for other tasks.

Dolce, James L.↗

A Model-based Approach to Reactive Self-Configuring Systems

This paper describes Livingstone, an implemented kernel for a self-reconfiguring autonomous system, that is reactive and uses component-based declarative models. The paper presents a formal characterization of the representation formalism used in Livingstone, and reports on our experience with the implementation in a variety of domains. Livingstone's representation formalism achieves broad coverage of hybrid software/hardware systems by coupling the concurrent transition system models underlying concurrent reactive languages with the discrete qualitative representations developed in model-based reasoning. We achieve a reactive system that performs significant deductions in the sense/response loop by drawing on our past experience at building fast prepositional conflict-based algorithms for model-based diagnosis, and by framing a model-based configuration manager as a prepositional, conflict-based feedback controller that generates focused, optimal responses. Livingstone automates all these tasks using a single model and a single core deductive engine, thus making significant progress towards achieving a central goal of model-based reasoning. Livingstone, together with the HSTS planning and scheduling engine and the RAPS executive, has been selected as the core autonomy architecture for Deep Space One, the first spacecraft for NASA's New Millennium program.

Williams, Brian C.↗

Comparison of Fixed and Variable Time Step Trajectory Integration Methods for Cislunar Trajectories

Due to the nonlinear nature of the Earth-Moon-Sun three-body problem and non-spherical gravity, CEV cislunar targeting algorithms will require many propagations in their search for a desired trajectory. For on-board targeting especially, the algorithm must have a simple, fast, and accurate propagator to calculate a trajectory with reasonable computation time, and still be robust enough to remain stable in the various flight regimes that the CEV will experience. This paper compares Cowell s method with a fourth-order Runge- Kutta integrator (RK4), Encke s method with a fourth-order Runge-Kutta- Nystr m integrator (RKN4), and a method known as Multi-Conic. Additionally, the study includes the Bond-Gottlieb 14-element method (BG14) and extends the investigation of Encke-Nystrom methods to integrators of higher order and with variable step size.

Weeks, ichael W.↗

A Discussion of the Discrete Fourier Transform Execution on a Typical Desktop PC

This paper will discuss and compare the execution times of three examples of the Discrete Fourier Transform (DFT). The first two examples will demonstrate the direct implementation of the algorithm. In the first example, the Fourier coefficients are generated at the execution of the DFT. In the second example, the coefficients are generated prior to execution and the DFT coefficients are indexed at execution. The last example will demonstrate the Cooley- Tukey algorithm, better known as the Fast Fourier Transform. All examples were written in C executed on a PC using a Pentium 4 running at 1.7 Ghz. As a function of N, the total complex data size, the direct implementation DFT executes, as expected at order of N2 and the FFT executes at order of N log2 N. At N=16K, there is an increase in processing time beyond what is expected. This is not caused by implementation but is a consequence of the effect that machine architecture and memory hierarchy has on implementation. This paper will include a brief overview of digital signal processing, along with a discussion of contemporary work with discrete Fourier processing.

White, Michael J.↗

SOSS User Guide

This User Guide describes SOSS (Surface Operations Simulator and Scheduler) software build and graphic user interface. SOSS is a desktop application that simulates airport surface operations in fast time using traffic management algorithms. It moves aircraft on the airport surface based on information provided by scheduling algorithm prototypes, monitors separation violation and scheduling conformance, and produces scheduling algorithm performance data.

air traffic control↗

Optimized Route Capability (ORC) Intelligent Offloading of Congested Arrival Routes

The Optimized Route Capability (ORC) concept is designed to enable intelligent offloading of congested arrival routes. When ORC predicts arrival route congestion as projected excess arrival meter fix delay, automation offers decision support to traffic managers by identifying candidate flights to strategically reroute to alternate meter fixes and alleviate the congestion. This concept was applied to a model of arrival operations into Houston International Airport. An arrival rush from the Northeast was simulated in fast-time to analyze ORC algorithm behavior. The results demonstrate how strategically rerouting a few flights to alternate meter fixes not only has the potential to manage meter fix delay (and possibly the need for traffic management initiatives applied upstream), but may also increase airport capacity utilization and reduce total flight delay.

Zelinski, Shannon↗