Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer algorithms”

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

Using Approximations to Accelerate Engineering Design Optimization

Optimization problems that arise in engineering design are often characterized by several features that hinder the use of standard nonlinear optimization techniques. Foremost among these features is that the functions used to define the engineering optimization problem often are computationally intensive. Within a standard nonlinear optimization algorithm, the computational expense of evaluating the functions that define the problem would necessarily be incurred for each iteration of the optimization algorithm. Faced with such prohibitive computational costs, an attractive alternative is to make use of surrogates within an optimization context since surrogates can be chosen or constructed so that they are typically much less expensive to compute. For the purposes of this paper, we will focus on the use of algebraic approximations as surrogates for the objective. In this paper we introduce the use of so-called merit functions that explicitly recognize the desirability of improving the current approximation to the objective during the course of the optimization. We define and experiment with the use of merit functions chosen to simultaneously improve both the solution to the optimization problem (the objective) and the quality of the approximation. Our goal is to further improve the effectiveness of our general approach without sacrificing any of its rigor.

Torczon, Virginia↗

Program Solves Euler Equations Of Supersonic Flow

EMTAC (Euler Marching Technique For Accurate Computation) computer program employs Euler marching algorithm for computing supersonic flows. Enables accurate nonlinear analysis of nonlinear dynamics of supersonic flow over wide range of supersonic mach numbers and angles of attack. Based on exact equations of dynamics of inviscid gas and valid for computations of flows at low and high supersonic mach numbers exhibiting strong shocks and rotational effects. Program also used for inviscid three-dimensional flows fully subsonic or transonic (subsonic with supersonic pockets). Written in FORTRAN V.

Szema, Kuo-Yen↗

Improving Brightness Temperature Measurements near Coastal Areas for SMAP

The Soil Moisture Active Passive (SMAP) mission is designed to acquire L-band radiometer measurements for the estimation of soil moisture with 0.04 m3/m3 volumetric accuracy in the top 5 cm for vegetation with water content of less than 5 kg/m2. In regions near the coast or near inland bodies of water, the signal measured by the SMAP radiometer contains emissions from land and water, resulting in errors in the soil moisture estimation. In this paper, the effort to extract the brightness temperature (TB) according to the land fraction or water fraction (depending on the center of the footprint location) from the affected SMAP measurements was addressed. A single pixel correction algorithm was applied and its performance was evaluated over simulated data. A data-driven approach for the estimation of land and water TB for data correction was developed. The correction algorithm was then applied to real data and its performance was assessed over the SMAP soil moisture retrievals. We showed that the single pixel algorithm is an effective and computationally efficient algorithm for removing land or water TB contamination from the SMAP data.

Julian Chaubell↗

Computationally-Efficient Minimum-Time Aircraft Routes in the Presence of Winds

A computationally efficient algorithm for minimizing the flight time of an aircraft in a variable wind field has been invented. The algorithm, referred to as Neighboring Optimal Wind Routing (NOWR), is based upon neighboring-optimal-control (NOC) concepts and achieves minimum-time paths by adjusting aircraft heading according to wind conditions at an arbitrary number of wind measurement points along the flight route. The NOWR algorithm may either be used in a fast-time mode to compute minimum- time routes prior to flight, or may be used in a feedback mode to adjust aircraft heading in real-time. By traveling minimum-time routes instead of direct great-circle (direct) routes, flights across the United States can save an average of about 7 minutes, and as much as one hour of flight time during periods of strong jet-stream winds. The neighboring optimal routes computed via the NOWR technique have been shown to be within 1.5 percent of the absolute minimum-time routes for flights across the continental United States. On a typical 450-MHz Sun Ultra workstation, the NOWR algorithm produces complete minimum-time routes in less than 40 milliseconds. This corresponds to a rate of 25 optimal routes per second. The closest comparable optimization technique runs approximately 10 times slower. Airlines currently use various trial-and-error search techniques to determine which of a set of commonly traveled routes will minimize flight time. These algorithms are too computationally expensive for use in real-time systems, or in systems where many optimal routes need to be computed in a short amount of time. Instead of operating in real-time, airlines will typically plan a trajectory several hours in advance using wind forecasts. If winds change significantly from forecasts, the resulting flights will no longer be minimum-time. The need for a computationally efficient wind-optimal routing algorithm is even greater in the case of new air-traffic-control automation concepts. For air-traffic-control automation, thousands of wind-optimal routes may need to be computed and checked for conflicts in just a few minutes. These factors motivated the need for a more efficient wind-optimal routing algorithm.

Jardin, Matthew R.↗

Investigation of television transmission using adaptive delta modulation principles

The results are presented of a study on the use of the delta modulator as a digital encoder of television signals. The computer simulation of different delta modulators was studied in order to find a satisfactory delta modulator. After finding a suitable delta modulator algorithm via computer simulation, the results were analyzed and then implemented in hardware to study its ability to encode real time motion pictures from an NTSC format television camera. The effects of channel errors on the delta modulated video signal were tested along with several error correction algorithms via computer simulation. A very high speed delta modulator was built (out of ECL logic), incorporating the most promising of the correction schemes, so that it could be tested on real time motion pictures. Delta modulators were investigated which could achieve significant bandwidth reduction without regard to complexity or speed. The first scheme investigated was a real time frame to frame encoding scheme which required the assembly of fourteen, 131,000 bit long shift registers as well as a high speed delta modulator. The other schemes involved the computer simulation of two dimensional delta modulator algorithms.

Schilling, D. L.↗

Efficient algorithms for single-axis attitude estimation

The computationally efficient algorithms determine attitude from the measurement of art lengths and dihedral angles. The dependence of these algorithms on the solution of trigonometric equations was reduced. Both single time and batch estimators are presented along with the covariance analysis of each algorithm.

Shuster, M. D.↗

Mapped Landmark Algorithm for Precision Landing

A report discusses a computer vision algorithm for position estimation to enable precision landing during planetary descent. The Descent Image Motion Estimation System for the Mars Exploration Rovers has been used as a starting point for creating code for precision, terrain-relative navigation during planetary landing. The algorithm is designed to be general because it handles images taken at different scales and resolutions relative to the map, and can produce mapped landmark matches for any planetary terrain of sufficient texture. These matches provide a measurement of horizontal position relative to a known landing site specified on the surface map. Multiple mapped landmarks generated per image allow for automatic detection and elimination of bad matches. Attitude and position can be generated from each image; this image-based attitude measurement can be used by the onboard navigation filter to improve the attitude estimate, which will improve the position estimates. The algorithm uses normalized correlation of grayscale images, producing precise, sub-pixel images. The algorithm has been broken into two sub-algorithms: (1) FFT Map Matching (see figure), which matches a single large template by correlation in the frequency domain, and (2) Mapped Landmark Refinement, which matches many small templates by correlation in the spatial domain. Each relies on feature selection, the homography transform, and 3D image correlation. The algorithm is implemented in C++ and is rated at Technology Readiness Level (TRL) 4.

Johnson, Andrew↗

Doppler lidar sampling strategies and accuracies: Regional scale

It has been proposed that a Doppler lidar be placed in a polar orbit and scanned to provide estimates of lower tropospheric winds twice per day and with a spatial resolution of 300 km. Initial feasibility studies conducted primarily by NOAA and NASA presented an optimistic outlook for a space based lidar. The technology appeared within reach and initial computer simulations suggested that acceptable accuracies could be obtained. Those early studies exposed, however, several potential problem areas which included: (1) the algorithms for computing the wind vectors did not perform well when there were coherent gradients in the wind fields; and (2) the lifetime and power requirements of the lidar put severe restrictions on the pulse repetition frequency (PRF). These two basic problems are currently being addressed by a Doppler lidar simulation study focussed upon three primary objectives: (1) to develop optimum scan parameters and shot patterns for a satellite-based Doppler lidar; (2) to develop robust algorithms for computing wind vectors from lidar returns; and (3) to evaluate the impact of coherent mesoscale structures (wind gradients, clouds, aerosols) on up-scale wind estimates. An overview is provided of the simulation efforts with particular emphasis upon rationale and methodology. Since this research is currently underway, any results shown are meant only as evidence of progress.

Emmitt, G. D.↗

Uncrewed Aerial Systems for Emergency Medical First Response: A Market Research Report

This report presents the findings from market research conducted for NASA’s Aerial Aid Convergent Aeronautics Solutions (CAS) exploration project, which aims to assess the current state of the market and technological readiness for Uncrewed Aerial Systems (UAS) for medical emergency first response. The research reveals a robust and rapidly growing market for UAS, with a notable emerging sector for Drones as First Responders (DFR). Despite this growth, DFR applications are currently limited by regulatory, technical, and other challenges, which restrict their use primarily to manned remote video surveillance, and therefore are primarily employed by police units. To our knowledge, there is no evidence of UAS being utilized by medical first responders for scene assessment. Limited evidence exists for closely related applications; however, these are mostly confined to pilot programs for the delivery of medical supplies or equipment. Although there has been discussion around fully autonomous DFR applications for medical purposes such as UAS ambulances or patient transport drones, these applications are generally not yet operational in practice. The technology for full autonomy, especially in guidance and control, has seen significant advancements, and recent Federal Aviation Administration (FAA)regulations are likely to accelerate adoption. Computer vision algorithms for fully autonomous medical emergency response scene surveillance are primed for advancement and deployment. A notable gap likely exists between advancements in computer vision research and what is being integrated in the commercial DFR sector. This gap is primarily due to challenges such as quality assurance for autonomous systems, the availability of application-specific training datasets for computer vision algorithms, regulatory constraints, and public perception and privacy concerns.

Joshua M Fody↗

An efficient sparse matrix multiplication scheme for the CYBER 205 computer

This paper describes the development of an efficient algorithm for computing the product of a matrix and vector on a CYBER 205 vector computer. The desire to provide software which allows the user to choose between the often conflicting goals of minimizing central processing unit (CPU) time or storage requirements has led to a diagonal-based algorithm in which one of four types of storage is selected for each diagonal. The candidate storage types employed were chosen to be efficient on the CYBER 205 for diagonals which have nonzero structure which is dense, moderately sparse, very sparse and short, or very sparse and long; however, for many densities, no diagonal type is most efficient with respect to both resource requirements, and a trade-off must be made. For each diagonal, an initialization subroutine estimates the CPU time and storage required for each storage type based on results from previously performed numerical experimentation. These requirements are adjusted by weights provided by the user which reflect the relative importance the user places on the two resources. The adjusted resource requirements are then compared to select the most efficient storage and computational scheme.

Lambiotte, Jules J., Jr.↗

Using adaptive grid in modeling rocket nozzle flow

The mechanical behavior of a rocket motor internal flow field results in a system of nonlinear partial differential equations which cannot be solved analytically. However, this system of equations called the Navier-Stokes equations can be solved numerically. The accuracy and the convergence of the solution of the system of equations will depend largely on how precisely the sharp gradients in the domain of interest can be resolved. With the advances in computer technology, more sophisticated algorithms are available to improve the accuracy and convergence of the solutions. An adaptive grid generation is one of the schemes which can be incorporated into the algorithm to enhance the capability of numerical modeling. It is equivalent to putting intelligence into the algorithm to optimize the use of computer memory. With this scheme, the finite difference domain of the flow field called the grid does neither have to be very fine nor strategically placed at the location of sharp gradients. The grid is self adapting as the solution evolves. This scheme significantly improves the methodology of solving flow problems in rocket nozzles by taking the refinement part of grid generation out of the hands of computational fluid dynamics (CFD) specialists and place it into the computer algorithm itself.

Chow, Alan S.↗

Neural-Network-Development Program

NETS, software tool for development and evaluation of neural networks, provides simulation of neural-network algorithms plus computing environment for development of such algorithms. Uses back-propagation learning method for all of networks it creates. Enables user to customize patterns of connections between layers of network. Also provides features for saving, during learning process, values of weights, providing more-precise control over learning process. Written in ANSI standard C language. Machine-independent version (MSC-21588) includes only code for command-line-interface version of NETS 3.0.

Phillips, Todd A.↗

Network compensation for missing sensors

A network learning translation invariance algorithm to compute interpolation functions is presented. This algorithm with one fixed receptive field can construct a linear transformation compensating for gain changes, sensor position jitter, and sensor loss when there are enough remaining sensors to adequately sample the input images. However, when the images are undersampled and complete compensation is not possible, the algorithm need to be modified. For moderate sensor losses, the algorithm works if the transformation weight adjustment is restricted to the weights to output units affected by the loss.

Ahumada, Albert J., Jr.↗

Active Control of Wind Tunnel Noise

The need for an adaptive active control system was realized, since a wind tunnel is subjected to variations in air velocity, temperature, air turbulence, and some other factors such as nonlinearity. Among many adaptive algorithms, the Least Mean Squares (LMS) algorithm, which is the simplest one, has been used in an Active Noise Control (ANC) system by some researchers. However, Eriksson's results, Eriksson (1985), showed instability in the ANC system with an ER filter for random noise input. The Restricted Least Squares (RLS) algorithm, although computationally more complex than the LMS algorithm, has better convergence and stability properties. The ANC system in the present work was simulated by using an FIR filter with an RLS algorithm for different inputs and for a number of plant models. Simulation results for the ANC system with acoustic feedback showed better robustness when used with the RLS algorithm than with the LMS algorithm for all types of inputs. Overall attenuation in the frequency domain was better in the case of the RLS adaptive algorithm. Simulation results with a more realistic plant model and an RLS adaptive algorithm showed a slower convergence rate than the case with an acoustic plant as a delay plant. However, the attenuation properties were satisfactory for the simulated system with the modified plant. The effect of filter length on the rate of convergence and attenuation was studied. It was found that the rate of convergence decreases with increase in filter length, whereas the attenuation increases with increase in filter length. The final design of the ANC system was simulated and found to have a reasonable convergence rate and good attenuation properties for an input containing discrete frequencies and random noise.

Hollis, Patrick↗

Optimizing Integrated Terminal Airspace Operations Under Uncertainty

In the terminal airspace, integrated departures and arrivals have the potential to increase operations efficiency. Recent research has developed geneticalgorithm- based schedulers for integrated arrival and departure operations under uncertainty. This paper presents an alternate method using a machine jobshop scheduling formulation to model the integrated airspace operations. A multistage stochastic programming approach is chosen to formulate the problem and candidate solutions are obtained by solving sample average approximation problems with finite sample size. Because approximate solutions are computed, the proposed algorithm incorporates the computation of statistical bounds to estimate the optimality of the candidate solutions. A proof-ofconcept study is conducted on a baseline implementation of a simple problem considering a fleet mix of 14 aircraft evolving in a model of the Los Angeles terminal airspace. A more thorough statistical analysis is also performed to evaluate the impact of the number of scenarios considered in the sampled problem. To handle extensive sampling computations, a multithreading technique is introduced.

air traffic optimization↗

Multitasking a three-dimensional Navier-Stokes algorithm on the Cray-2

A three-dimensional computational aerodynamics algorithm has been multitasked for efficient parallel execution on the Cray-2. It provides a means for examining the multitasking performance of a complete CFD application code. An embedded zonal multigrid scheme is used to solve the Reynolds-averaged Navier-Stokes equations for an internal flow model problem. The explicit nature of each component of the method allows a spatial partitioning of the computational domain to achieve a well-balanced task load for MIMD computers with vector-processing capability. Experiments have been conducted with both two- and three-dimensional multitasked cases. The best speedup attained by an individual task group was 3.54 on four processors of the Cray-2, while the entire solver yielded a speedup of 2.67 on four processors for the three-dimensional case. The multiprocessing efficiency of various types of computational tasks is examined, performance on two Cray-2s with different memory access speeds is compared, and extrapolation to larger problems is discussed.

Swisshelm, Julie M.↗

An improved digital algorithm for fast amplitude approximations of quadrature pairs

A computationally fast algorithm for approximating the amplitude (A) of a quadrature pair (I,Q) has been discovered. The piecewise linear formula, the unbiased estimate of A=X+1/8y when X or = 3Y and 7/8X + 1/2Y when X or = 3Y applies where X is congruent to the maximum absolute value of (I,Q) and Y is congruent to the minimum absolute value of (I,Q). This algorithm has been proven to be far more accurate then currently used approximations. An immediate application is the wideband digital spectrum analyzer under development for monitoring radio frequency interference at Deep Space Network stations.

Levitt, B. K.↗