Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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 703 records · Page 39

A finite element method for diffusion dominated unsteady viscous flows

A general conforming finite element scheme for computing viscous flows is presented which is of second-order accuracy in space and time. Viscous terms are treated implicitly and advection terms are treated explicitly in the time marching segment of the algorithm. A method for solving the algebraic equations at each time step is given. The method is demonstrated on two test problems, one of them being a plane vortex flow for which asymptotic methods are used to obtain suitable numerical boundary conditions at each time step.

Gunzburger, M. D.↗

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

A research effort was initiated at Georgia Tech in February 1991 on the development of efficient techniques for the computation of 2-D and 3-D unsteady compressible flow problems. It was found that in 2-D unsteady viscous flow applications, the generalized minimal residual (GMRES) scheme was able to significantly improve the accuracy and stability characteristics of an existing 2-D ADI (Alternating Direction Implicit) time marching scheme. That is, the GMRES/ADI combination allowed 10 to 20 times larger time steps compared to an ADI scheme. Because the GMRES algorithm requires 5 to 10 times the CPU work compared to the ADI scheme, the combined GMRES/ADI scheme yields a net factor of 2 savings in CPU cost. During the past year, we also experimented with GMRES/multigrid/ADI combination. The purpose of this combination was to compute the low frequency components of the change in the flow properties from one time step to the next on a coarse grid. This strategy reduces the memory requirements of the GMRES method roughly by a factor of 4-8 for steady flow problems.

Sankar, Lakshmi N.↗

Taxi Time Prediction at Charlotte Airport Using Fast-Time Simulation and Machine Learning Techniques

Accurate taxi time prediction is required for enabling efficient runway scheduling that can increase runway throughput and reduce taxi times and fuel consumptions on the airport surface. Currently NASA and American Airlines are jointly developing a decision-support tool called Spot and Runway Departure Advisor (SARDA) that assists airport ramp controllers to make gate pushback decisions and improve the overall efficiency of airport surface traffic. In this presentation, we propose to use Linear Optimized Sequencing (LINOS), a discrete-event fast-time simulation tool, to predict taxi times and provide the estimates to the runway scheduler in real-time airport operations. To assess its prediction accuracy, we also introduce a data-driven analytical method using machine learning techniques. These two taxi time prediction methods are evaluated with actual taxi time data obtained from the SARDA human-in-the-loop (HITL) simulation for Charlotte Douglas International Airport (CLT) using various performance measurement metrics. Based on the taxi time prediction results, we also discuss how the prediction accuracy can be affected by the operational complexity at this airport and how we can improve the fast time simulation model before implementing it with an airport scheduling algorithm in a real-time environment.

airport surface traffic↗

Sensor Data Quality and Angular Rate Down-Selection Algorithms on SLS EM-1

The NASA Space Launch System Block 1 launch vehicle is equipped with an Inertial Navigation System (INS) and multiple Rate Gyro Assemblies (RGA) that are used in the Guidance, Navigation, and Control (GN&C) algorithms. The INS provides the inertial position, velocity, and attitude of the vehicle along with both angular rate and specific force measurements. Additionally, multiple sets of co-located rate gyros supply angular rate data. The collection of angular rate data, taken along the launch vehicle, is used to separate out vehicle motion from flexible body dynamics. Since the system architecture uses redundant sensors, the capability was developed to evaluate the health (or validity) of the independent measurements. A suite of Sensor Data Quality (SDQ) algorithms is responsible for assessing the angular rate data from the redundant sensors. When failures are detected, SDQ will take the appropriate action and disqualify or remove faulted sensors from forward processing. Additionally, the SDQ algorithms contain logic for down-selecting the angular rate data used by the GNC software from the set of healthy measurements. This paper explores the trades and analyses that were performed in selecting a set of robust fault-detection algorithms included in the GN&C flight software. These trades included both an assessment of hardware-provided health and status data as well as an evaluation of different algorithms based on time-to-detection, type of failures detected, and probability of detecting false positives. We then provide an overview of the algorithms used for both fault-detection and measurement down selection. We next discuss the role of trajectory design, flexible-body models, and vehicle response to off-nominal conditions in setting the detection thresholds. Lastly, we present lessons learned from software integration and hardware-in-the-loop testing.

Park, Thomas↗

Time-accurate simulation of a self-excited oscillatory supersonic external flow with a multi-block solution-adaptive mesh algorithm

Results are presented of an investigation of the time-accurate simulation of supersonic unsteady flow oscillations over spike-tipped bodies using the multistage Runge-Kutta scheme coupled with a dynamic solution-adaptive grid algorithm modified for multiblock capabilities. The inviscid fluxes are described by a modified advective upwind split method to obviate the need for artificial dissipation. If a time-varying, solution-adaptive mesh algorithm is incorporated, resolution of the details of the unsteady spike-tipped body flow is improved. The adaptive algorithm is also shown to resolve multiple and diverse features of the flow simultaneously, with the adapted regions in the mesh convecting with these features as they translate.

Ingram, Clint L.↗

Prognostics Applied to Electric Propulsion UAV

Health management plays an important role in operations of UAV. If there is equipment malfunction on critical components, safe operation of the UAV might possibly be compromised. A technology with particular promise in this arena is equipment prognostics. This technology provides a state assessment of the health of components of interest and, if a degraded state has been found, it estimates how long it will take before the equipment will reach a failure threshold, conditional on assumptions about future operating conditions and future environmental conditions. This chapter explores the technical underpinnings of how to perform prognostics and shows an implementation on the propulsion of an electric UAV. A particle filter is shown as the method of choice in performing state assessment and predicting future degradation. The method is then applied to the batteries that provide power to the propeller motors. An accurate run-time battery life prediction algorithm is of critical importance to ensure the safe operation of the vehicle if one wants to maximize in-air time. Current reliability based techniques turn out to be insufficient to manage the use of such batteries where loads vary frequently in uncertain environments.

Batteries↗

Peak Seeking Control for Reduced Fuel Consumption with Preliminary Flight Test Results

The Environmentally Responsible Aviation project seeks to accomplish the simultaneous reduction of fuel burn, noise, and emissions. A project at NASA Dryden Flight Research Center is contributing to ERAs goals by exploring the practical application of real-time trim configuration optimization for enhanced performance and reduced fuel consumption. This peak-seeking control approach is based on Newton-Raphson algorithm using a time-varying Kalman filter to estimate the gradient of the performance function. In real-time operation, deflection of symmetric ailerons, trailing-edge flaps, and leading-edge flaps of a modified F-18 are directly optimized, and the horizontal stabilators and angle of attack are indirectly optimized. Preliminary results from three research flights are presented herein. The optimization system found a trim configuration that required approximately 3.5% less fuel flow than the baseline trim at the given flight condition. The algorithm consistently rediscovered the solution from several initial conditions. These preliminary results show the algorithm has good performance and is expected to show similar results at other flight conditions and aircraft configurations.

Brown, Nelson↗

Advancements in the Development of an Operational Lightning Jump Algorithm for GOES-R GLM

Rapid increases in total lightning have been shown to precede the manifestation of severe weather at the surface. These rapid increases have been termed lightning jumps, and are the current focus of algorithm development for the GOES-R Geostationary Lightning Mapper (GLM). Recent lightning jump algorithm work has focused on evaluation of algorithms in three additional regions of the country, as well as, markedly increasing the number of thunderstorms in order to evaluate the each algorithm s performance on a larger population of storms. Lightning characteristics of just over 600 thunderstorms have been studied over the past four years. The 2 lightning jump algorithm continues to show the most promise for an operational lightning jump algorithm, with a probability of detection of 82%, a false alarm rate of 35%, a critical success index of 57%, and a Heidke Skill Score of 0.73 on the entire population of thunderstorms. Average lead time for the 2 algorithm on all severe weather is 21.15 minutes, with a standard deviation of +/- 14.68 minutes. Looking at tornadoes alone, the average lead time is 18.71 minutes, with a standard deviation of +/-14.88 minutes. Moreover, removing the 2 lightning jumps that occur after a jump has been detected, and before severe weather is detected at the ground, the 2 lightning jump algorithm s false alarm rate drops from 35% to 21%. Cold season, low topped, and tropical environments cause problems for the 2 lightning jump algorithm, due to their relative dearth in lightning as compared to a supercellular or summertime airmass thunderstorm environment.

Shultz, Chris↗

Health Monitoring System for the SSME-fault detection algorithms

A Health Monitoring System (HMS) Framework for the Space Shuttle Main Engine (SSME) has been developed by United Technologies Corporation (UTC) for the NASA Lewis Research Center. As part of this effort, fault detection algorithms have been developed to detect the SSME faults with sufficient time to shutdown the engine. These algorithms have been designed to provide monitoring coverage during the startup, mainstage and shutdown phases of the SSME operation. The algorithms have the capability to detect multiple SSME faults, and are based on time series, regression and clustering techniques. This paper presents a discussion of candidate algorithms suitable for fault detection followed by a description of the algorithms selected for implementation in the HMS and the results of testing these algorithms with the SSME test stand data.

Tulpule, S.↗

Computability of five-color maps

Aside from the mathematical question as to whether any planar map can be colored with four or five colors so that no adjacent regions are assigned the same color, there is a computational problem of finding a coloration for a given map. This report presents an algorithm for the five-color problem which has an asymptotic computing time which is proportional to the square of the number of regions, at worst. The algorithm can be modified to produce six-color maps in linear time. The algorithm has been implemented for practical use in an image processing system and can be used in practical cases to produce four-color maps.

Mclemore, B. D.↗

Measuring the effects of heterogeneity on distributed systems

Distributed computer systems in daily use are becoming more and more heterogeneous. Currently, much of the design and analysis studies of such systems assume homogeneity. This assumption of homogeneity has been mainly driven by the resulting simplicity in modeling and analysis. A simulation study is presented which investigated the effects of heterogeneity on scheduling algorithms for hard real time distributed systems. In contrast to previous results which indicate that random scheduling may be as good as a more complex scheduler, this algorithm is shown to be consistently better than a random scheduler. This conclusion is more prevalent at high workloads as well as at high levels of heterogeneity.

El-Toweissy, Mohamed↗

A fast algorithm for parallel computation of multibody dynamics on MIMD parallel architectures

In this paper the implementation of a parallel O(LogN) algorithm for computation of rigid multibody dynamics on a Hypercube MIMD parallel architecture is presented. To our knowledge, this is the first algorithm that achieves the time lower bound of O(LogN) by using an optimal number of O(N) processors. However, in addition to its theoretical significance, the algorithm is also highly efficient for practical implementation on commercially available MIMD parallel architectures due to its highly coarse grain size and simple communication and synchronization requirements. We present a multilevel parallel computation strategy for implementation of the algorithm on a Hypercube. This strategy allows the exploitation of parallelism at several computational levels as well as maximum overlapping of computation and communication to increase the performance of parallel computation.

Fijany, Amir↗

Validating and Improving Long-Term Aerosol Data Records from SeaWiFS

Natural and anthropogenic aerosols influence the radiative balance of the Earth through direct and indirect interactions with incoming solar radiation. However, the quantification of these interactions and their ultimate effect on the Earth's climate still have large uncertainties. This is partly due to the limitations of current satellite data records which include short satellite lifetimes, retrieval algorithm uncertainty, or insufficient calibration accuracy. We have taken the first steps in overcoming this hurdle with the production and public release of an aerosol data record using the radiances from the Sea-viewing Wide Field-of-View Sensor (Sea WiFS). Sea WiFS was launched in late 1997 and provided exceptionally well-calibrated top-of-atmosphere radiance data until December 2010, more than 13 years. We have partnered this data with an expanded Deep Blue aerosol retrieval algorithm. In accordance with Deep Blue's original focus, the latest algorithm retrieves aerosol properties not only over bright desert surfaces, but also over oceans and vegetated surfaces. With this combination of a long time series and global algorithm, we can finally identify the changing patterns of regional aerosol loading and provide insight into longterm variability and trends of aerosols on regional and global scales. In this work, we provide an introduction to Sea WiFS, the current algorithms, and our aerosol data records. We have validated the data over land and ocean with ground measurements from the Aerosol Robotic Network (AERONET) and compared them with other satellites such as MODIS and MISR. Looking ahead to the next data release, we will also provide details on the implemented and planned algorithm improvements, and subsequent validation results.

Bettenhausen, Corey↗

Parallel variable-band Choleski solvers for computational structural analysis applications on vector multiprocessor supercomputers

A Choleski method used to solve linear systems of equations that arise in large scale structural analyses is described. The method uses a novel variable-band storage scheme and is structured to exploit fast local memory caches while minimizing data access delays between main memory and vector registers. Several parallel implementations of this method are described for the CRAY-2 and CRAY Y-MP computers demonstrating the use of microtasking and autotasking directives. A portable parallel language, FORCE, is also used for two different parallel implementations, demonstrating the use of CRAY macrotasking. Results are presented comparing the matrix factorization times for three representative structural analysis problems from runs made in both dedicated and multi-user modes on both the CRAY-2 and CRAY Y-MP computers. CPU and wall clock timings are given for the various parallel methods and are compared to single processor timings of the same algorithm. Computation rates over 1 GIGAFLOP (1 billion floating point operations per second) on a four processor CRAY-2 and over 2 GIGAFLOPS on an eight processor CRAY Y-MP are demonstrated as measured by wall clock time in a dedicated environment. Reduced wall clock times for the parallel methods relative to the single processor implementation of the same Choleski algorithm are also demonstrated for runs made in multi-user mode.

Poole, E. L.↗

Wavelet-Based Interpolation and Representation of Non-Uniformly Sampled Spacecraft Mission Data

A well-documented problem in the analysis of data collected by spacecraft instruments is the need for an accurate, efficient representation of the data set. The data may suffer from several problems, including additive noise, data dropouts, an irregularly-spaced sampling grid, and time-delayed sampling. These data irregularities render most traditional signal processing techniques unusable, and thus the data must be interpolated onto an even grid before scientific analysis techniques can be applied. In addition, the extremely large volume of data collected by scientific instrumentation presents many challenging problems in the area of compression, visualization, and analysis. Therefore, a representation of the data is needed which provides a structure which is conducive to these applications. Wavelet representations of data have already been shown to possess excellent characteristics for compression, data analysis, and imaging. The main goal of this project is to develop a new adaptive filtering algorithm for image restoration and compression. The algorithm should have low computational complexity and a fast convergence rate. This will make the algorithm suitable for real-time applications. The algorithm should be able to remove additive noise and reconstruct lost data samples from images.

Bose, Tamal↗

Attitude determination system for Seasat-A mission

The attitude determination (AD) system hardware of Seasat-A consists of two sun aspect sensors, two infrared (IR) horizon scanners, related electronics, telemetry, and science sensors. The earth horizon pulse signal sensing is accomplished by a variable thresholding method intended to self-adjust for earth radiance variations. The use of sun sensors rather than star trackers for yaw determination calls for estimation rather than measurement of yaw attitude about 50% of mission time. Features of the yaw interpolation algorithm include adaptability and automatic incorporation of time-varying confidence levels of various data sources. The performance accuracy of the AD system was assessed, where it is found that the most important error source is the variation in earth atmospheric radiance. Analysis of science instrument sensitivity to AD uncertainties was performed, and the most sensitive instrument, the scatterometer system, shows only gradual degradation of performance in the vicinity of the AD accuracy requirement.

Ohtakay, H.↗

Optimal Sensor Locations for Structural Identification

The optimum sensor location problem, OSLP, may be thought of in terms of the set of systems, S, the class of input time functions, I, and the identification algorithm (estimator) used, E. Thus, for a given time history of input, the technique of determining the OSL requires, in general, the solution of the optimization and the identification problems simultaneously. A technique which uncouples the two problems is introduced. This is done by means of the concept of an efficient estimator for which the covariance of the parameter estimates is inversely proportional to the Fisher Information Matrix.

Udwadia, F. E.↗

A stiffly-stable implicit Runge-Kutta algorithm for CFD applications

A stiffly-stable implicit Runge-Kutta integration algorithm is derived for CFD applications spanning the range of semidiscrete theories. The algorithm family contains the one-step 'theta' algorithms, including backwards Euler and the trapezoidal rule, and provides a versatile framework to identify expressions governing algorithm stability characteristics. Parameters of a Runge-Kutta optimal implicit algorithm, second-order accurate in time and stiffly-stable, are established. This algorithm is implemented within a weak statement finite element semidiscrete formulation for one- and two-dimensional conservation law systems. Numerical results are compared to theta-algorithm solutions, for unsteady quasi-one-dimensional Euler predictions with shocks, and for a specially derived two-dimensional conservation law system modeling the Euler equations.

Baker, A. J.↗