Search NASA⌕ Search

SEARCH · Search NASA

Results for “complex 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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Hybrid-Electric Aero-Propulsion Controls Testbed Results with Energy Storage

Electrified aircraft propulsion (EAP) research is a priority of the National Aeronautics and Space Administration (NASA) for its potential to increase propulsion system efficiency, performance, and operability at the subsystem and vehicle levels while decreasing emissions. These EAP systems demand more advanced control algorithms due to increased complexity. NASA has developed a reconfigurable, hardware-in-the-loop rig to verify control algorithm performance using a sub-scale electro-mechanical system. A novel capability of this rig is the ability to test full scale EAP control algorithms on a sub-scale representation of the electro-mechanical system without turbomachinery/rotors. A novel feature is the use of a physical energy storage device within the electro-mechanical system. A dual spool, parallel hybrid-electric turbofan architecture and energy management control system is tested with the goal of verifying the ability to obtain turbomachinery model operability benefits while controlling sub-scale electro-mechanical hardware. Pre-test predictions of the turbofan model, control, and rig performance were obtained through simulation using a software model of the rig. Theoretical results showing the true performance of the turbofan model were obtained through a software simulation using full-scale mechanical shaft models. The paper compares theoretical, predicted, and actual test results from the turbofan model, energy management control and rig perspectives. The results show that the presence of sub-scale electro-mechanical hardware did not inhibit the energy management algorithm from achieving turbomachinery operability benefits.

hybrid↗
NASA NTRS1978

Sorting on STAR

Timing comparisons are given for three sorting algorithms written for the CDC STAR computer. One algorithm is Hoare's (1962) Quicksort, which is the fastest or nearly the fastest sorting algorithm for most computers. A second algorithm is a vector version of Quicksort that takes advantage of the STAR's vector operations. The third algorithm is an adaptation of Batcher's (1968) sorting algorithm, which makes especially good use of vector operations but has a complexity of N(log N)-squared as compared with a complexity of N log N for the Quicksort algorithms. In spite of its worse complexity, Batcher's sorting algorithm is competitive with the serial version of Quicksort for vectors up to the largest that can be treated by STAR. Vector Quicksort outperforms the other two algorithms and is generally preferred. These results indicate that unusual instruction sets can introduce biases in program execution time that counter results predicted by worst-case asymptotic complexity analysis.

Stone, H. S.↗
NASA NTRSDate not supplied

Systems Health Management and Prognostics Approaches for Electric Aircrafts

As more and more electric vehicles emerge in our daily operation progressively, a very critical challenge lies in the prediction of remaining driving flying time/distance for the flying vehicles. This information is important, particularly in the case of auto vehicles, because such vehicles can become self-aware, autonomously compute its own capabilities, and identify how to best plan and successfully complete vehicular missions safely. In case of electric aircrafts, computing the remaining flying time is also safety-critical, since an aircraft that runs out of power (battery charge) while in the air will eventually lose control leading to catastrophe. To facilitate and solve the prediction problem, awareness of the current health state of the system is key, since it is necessary to perform condition-based predictions. To accurately predict the future state of any system, it is required to possess knowledge of its current health state and future operational conditions. Latest achievements of data-driven algorithms in regression of complex nonlinear functions and classification tasks have generated a growing interest in artificial intelligence for industrial applications. Complex multi-physics models as well as digital twins, once purely built on physics and corresponding simplified lumped parameter iterations, can now benefit from machine learning algorithms to mitigate the lack of understanding of some complex behavior. Given models of the current and future system behavior, a general approach of model-based prognostics can solve the prediction problem and further decision-making. A systematic prediction framework is implemented to identify all possible sources of uncertainty, quantify each of them individually, and mathematically estimate their combined effect on the system-level quantity of interest, in this case, the remaining flying time/distance of the unmanned aircraft. Note - This presentation contains all previously published information.

Systems Health Managent↗
NASA NTRSDate not supplied

Health Monitoring and Prognostics for Electric Aircrafts

As more and more electric vehicles emerge in our daily operation progressively, a very critical challenge lies in the prediction of remaining driving flying time/distance for the flying vehicles. This information is important, particularly in the case of auto vehicles, because such vehicles can become self-aware, autonomously compute its own capabilities, and identify how to best plan and successfully complete vehicular missions safely. In case of electric aircrafts, computing the remaining flying time is also safety-critical, since an aircraft that runs out of power (battery charge) while in the air will eventually lose control leading to catastrophe. To facilitate and solve the prediction problem, awareness of the current health state of the system is key, since it is necessary to perform condition-based predictions. To accurately predict the future state of any system, it is required to possess knowledge of its current health state and future operational conditions. Latest achievements of data-driven algorithms in regression of complex nonlinear functions and classification tasks have generated a growing interest in artificial intelligence for industrial applications. Complex multi-physics models as well as digital twins, once purely built on physics and corresponding simplified lumped parameter iterations, can now benefit from machine learning algorithms to mitigate the lack of understanding of some complex behavior. Given models of the current and future system behavior, a general approach of model-based prognostics can solve the prediction problem and further decision-making. A systematic prediction framework is implemented to identify all possible sources of uncertainty, quantify each of them individually, and mathematically estimate their combined effect on the system-level quantity of interest, in this case, the remaining flying time/distance of the unmanned aircraft. Note - This presentation contains all previously approved and published information.

Systems Health Managent↗
NASA NTRSDate not supplied

Physics Informed Neural Nets for Systems Health Management

To facilitate and solve the prediction problem, awareness of the current health state of the system is key, since it is necessary to perform condition-based predictions. To accurately predict the future state of any system, it is required to possess knowledge of its current health state and future operational conditions. Development in data-driven algorithms in regression of complex nonlinear functions and classification tasks have generated a growing interest in artificial intelligence for industrial applications. Complex multi-physics models as well as digital twins, once purely built on physics and corresponding simplified lumped parameter iterations, can now benefit from machine learning algorithms to mitigate the lack of understanding of some complex behavior. The research work presents application of physics-informed neural nets application to a representative electric powertrain for unmanned aerial vehicles. The model is composed of physics-derived and empirical equations, integrated with connected networks that are strategically placed within the model to substitute equations that are subject to large uncertainty. Polynomial fit driven by heuristics or empirical observations can be substituted by more flexible networks that can minimize the error between model predictions and observations without being restricted to a predefined functional form. This modeling strategy allows training of networks deep inside the model and unknown parameters in a single learning stage.

Physics Informed↗
NASA NTRS2014

Improved Algorithms for Accurate Retrieval of UV - Visible Diffuse Attenuation Coefficients in Optically Complex, Inshore Waters

Photochemical processes driven by high-energy ultraviolet radiation (UVR) in inshore, estuarine, and coastal waters play an important role in global bio geochemical cycles and biological systems. A key to modeling photochemical processes in these optically complex waters is an accurate description of the vertical distribution of UVR in the water column which can be obtained using the diffuse attenuation coefficients of down welling irradiance (Kd()). The Sea UV Sea UVc algorithms (Fichot et al., 2008) can accurately retrieve Kd ( 320, 340, 380,412, 443 and 490 nm) in oceanic and coastal waters using multispectral remote sensing reflectances (Rrs(), Sea WiFS bands). However, SeaUVSeaUVc algorithms are currently not optimized for use in optically complex, inshore waters, where they tend to severely underestimate Kd(). Here, a new training data set of optical properties collected in optically complex, inshore waters was used to re-parameterize the published SeaUVSeaUVc algorithms, resulting in improved Kd() retrievals for turbid, estuarine waters. Although the updated SeaUVSeaUVc algorithms perform best in optically complex waters, the published SeaUVSeaUVc models still perform well in most coastal and oceanic waters. Therefore, we propose a composite set of SeaUVSeaUVc algorithms, optimized for Kd() retrieval in almost all marine systems, ranging from oceanic to inshore waters. The composite algorithm set can retrieve Kd from ocean color with good accuracy across this wide range of water types (e.g., within 13 mean relative error for Kd(340)). A validation step using three independent, in situ data sets indicates that the composite SeaUVSeaUVc can generate accurate Kd values from 320 490 nm using satellite imagery on a global scale. Taking advantage of the inherent benefits of our statistical methods, we pooled the validation data with the training set, obtaining an optimized composite model for estimating Kd() in UV wavelengths for almost all marine waters. This optimized composite set of SeaUVSeaUVc algorithms will provide the optical community with improved ability to quantify the role of solar UV radiation in photochemical and photobiological processes in the ocean.

UV↗
NASA NTRS2020

Spectral Range Within Global aCDOM(440) Algorithms for Oceanic, Coastal, and Inland Waters with Application to Airborne Measurements

The optically active component of dissolved organic material in aquatic ecosystems, or colored dissolved organic matter (CDOM), is represented by the coefficient of absorption due to the dissolved aquatic constituents at 440 nm, aCDOM(440). Remote sensing of aCDOM(440) enables characterization of ecosystem processes and aids in retrieval of chlorophyll a, a proxy for phytoplankton biomass. Spectrally adjacent band-ratio domains, e.g., blue to green, have previously been applied for remote sensing of aCDOM(440) in coastal and oceanic waters with similar results compared to more complex semi-analytical algorithms. Estimation of aCDOM(440) from ratios of the most spectrally separated ocean color wavebands (end members), e.g., ultraviolet (UV) to near-infrared (NIR), termed end-member analysis (EMA), has previously been shown to increase the accuracy of global aCDOM(440) retrievals from in-water observations of diffuse attenuation and to enable a unified algorithmic perspective without requiring regional adjustment of internal bio-optical parameters. EMA of above-water observations is evaluated herein, with a focus on coastal and inland waters in which increasing optical complexity and likelihood of bottom reflectance challenge the oceanic algorithms developed for deep and optically simple (case-1) waters. Analysis herein of three independent, in situ, bio-optical datasets indicates significant correlation between aCDOM(440) and end-member band ratios (next-generation 320 and 780 nm or legacy 412 and 670 nm ratios) with a coefficient of determination, R2, of 0.87 (log-scale) or higher based on a dataset spanning the dynamic range of global, conservative water bodies. For applicable wavelengths, EMA algorithms are shown to agree with case-1 relationships and to produce consistent log-scale uncertainties across more than three orders of magnitude in aCDOM(440) values (0.001–2.305 m􀀀1). EMA using UV and NIR wavelengths (320 and 780 nm) is applied to low-altitude airborne observations and satisfies 25% uncertainty based on unbiased percent differences (UPDs) within each of three dissimilar match-up sites ranging in aCDOM(440) from 0.02–0.57 m􀀀1. Results demonstrate that EMA is a useful and robust approach for the remote sensing of aCDOM(440) in coastal and inland waters, which are generally shallower, contain more optically complex environments, and span a greater range in aCDOM(440) than oceanic waters.

CDOM↗
NASA NTRS2000

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↗
NASA NTRS1998

Fast Transformation of Temporal Plans for Efficient Execution

Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of execution flexibility is counterbalanced by the cost during execution of propagating the time of occurrence of events throughout the flexible plan. To minimize execution latency, this propagation needs to be very efficient. Previous work showed that every temporal plan can be reformulated as a dispatchable plan, i.e., one for which propagation to immediate neighbors is sufficient. A simple algorithm was given that finds a dispatchable plan with a minimum number of edges in cubic time and quadratic space. In this paper, we focus on the efficiency of the reformulation process, and improve on that result. A new algorithm is presented that uses linear space and has time complexity equivalent to Johnson s algorithm for all-pairs shortest-path problems. Experimental evidence confirms the practical effectiveness of the new algorithm. For example, on a large commercial application, the performance is improved by at least two orders of magnitude. We further show that the dispatchable plan, already minimal in the total number of edges, can also be made minimal in the maximum number of edges incoming or outgoing at any node.

Tsamardinos, Ioannis↗
NASA NTRS1973

Algebraic criteria for positive realness relative to the unit circle.

A purely algebraic algorithm is developed for testing positive real character of real rational functions and matrices relative to the unit circle in the complex plane. Since the algorithm is entirely recursive and is performed in finite number of steps, it is suitable for machine computations.

Siljak, D. D.↗
NASA NTRS1994

Segmentation Of Multifrequency Complex-Amplitude SAR Data

Several mathematical models and associated algorithms implement method of segmenting multifrequency, highly speckled, high-resolution, complex-amplitude (amplitude and phase) synthetic-aperture-radar (SAR) digitized image into regions, within each of which radar backscattering characteristics are similar or homogeneous from place to place. Typically, each region represents different type of terrain or other surface; e.g., forest, agricultural land, sea ice, or water. Method of segmentation of SAR scene into regions is product of generalization, to multifrequency case, of single-frequency method described in "Algorithms for Segmentation of Complex-Amplitude SAR Data" (NPO-18524).

Rignot, Eric J.↗
NASA NTRS2010

Updates to Multi-Dimensional Flux Reconstruction for Hypersonic Simulations on Tetrahedral Grids

The quality of simulated hypersonic stagnation region heating with tetrahedral meshes is investigated by using an updated three-dimensional, upwind reconstruction algorithm for the inviscid flux vector. An earlier implementation of this algorithm provided improved symmetry characteristics on tetrahedral grids compared to conventional reconstruction methods. The original formulation however displayed quantitative differences in heating and shear that were as large as 25% compared to a benchmark, structured-grid solution. The primary cause of this discrepancy is found to be an inherent inconsistency in the formulation of the flux limiter. The inconsistency is removed by employing a Green-Gauss formulation of primitive gradients at nodes to replace the previous Gram-Schmidt algorithm. Current results are now in good agreement with benchmark solutions for two challenge problems: (1) hypersonic flow over a three-dimensional cylindrical section with special attention to the uniformity of the solution in the spanwise direction and (2) hypersonic flow over a three-dimensional sphere. The tetrahedral cells used in the simulation are derived from a structured grid where cell faces are bisected across the diagonal resulting in a consistent pattern of diagonals running in a biased direction across the otherwise symmetric domain. This grid is known to accentuate problems in both shock capturing and stagnation region heating encountered with conventional, quasi-one-dimensional inviscid flux reconstruction algorithms. Therefore the test problems provide a sensitive indicator for algorithmic effects on heating. Additional simulations on a sharp, double cone and the shuttle orbiter are then presented to demonstrate the capabilities of the new algorithm on more geometrically complex flows with tetrahedral grids. These results provide the first indication that pure tetrahedral elements utilizing the updated, three-dimensional, upwind reconstruction algorithm may be used for the simulation of heating and shear in hypersonic flows in upwind, finite volume formulations.

Gnoffo, Peter A.↗
NASA NTRS2005

Computation of Symmetric Discrete Cosine Transform Using Bakhvalov's Algorithm

A number of algorithms for recursive computation of the discrete cosine transform (DCT) have been developed recently. This paper presents a new method for computing the discrete cosine transform and its inverse using Bakhvalov's algorithm, a method developed for evaluation of a polynomial at a point. In this paper, we will focus on both the application of the algorithm to the computation of the DCT-I and its complexity. In addition, Bakhvalov s algorithm is compared with Clenshaw s algorithm for the computation of the DCT.

Aburdene, Maurice F.↗
NASA NTRS2013

Data Mining for Anomaly Detection

The Vehicle Integrated Prognostics Reasoner (VIPR) program describes methods for enhanced diagnostics as well as a prognostic extension to current state of art Aircraft Diagnostic and Maintenance System (ADMS). VIPR introduced a new anomaly detection function for discovering previously undetected and undocumented situations, where there are clear deviations from nominal behavior. Once a baseline (nominal model of operations) is established, the detection and analysis is split between on-aircraft outlier generation and off-aircraft expert analysis to characterize and classify events that may not have been anticipated by individual system providers. Offline expert analysis is supported by data curation and data mining algorithms that can be applied in the contexts of supervised learning methods and unsupervised learning. In this report, we discuss efficient methods to implement the Kolmogorov complexity measure using compression algorithms, and run a systematic empirical analysis to determine the best compression measure. Our experiments established that the combination of the DZIP compression algorithm and CiDM distance measure provides the best results for capturing relevant properties of time series data encountered in aircraft operations. This combination was used as the basis for developing an unsupervised learning algorithm to define "nominal" flight segments using historical flight segments.

Biswas, Gautam↗
NASA NTRS1999

Map Algorithms for Decoding Linear Block codes Based on Sectionalized Trellis Diagrams

The MAP algorithm is a trellis-based maximum a posteriori probability decoding algorithm. It is the heart of the turbo (or iterative) decoding which achieves an error performance near the Shannon limit. Unfortunately, the implementation of this algorithm requires large computation and storage. Furthermore, its forward and backward recursions result in long decoding delay. For practical applications, this decoding algorithm must be simplified and its decoding complexity and delay must be reduced. In this paper, the MAP algorithm and its variations, such as Log-MAP and Max-Log-MAP algorithms, are first applied to sectionalized trellises for linear block codes and carried out as two-stage decodings. Using the structural properties of properly sectionalized trellises, the decoding complexity and delay of the MAP algorithms can be reduced. Computation-wise optimum sectionalizations of a trellis for MAP algorithms are investigated. Also presented in this paper are bi-directional and parallel MAP decodings.

Lin, Shu↗
NASA NTRS2000

MAP Algorithms for Decoding Linear Block Codes Based on Sectionalized Trellis Diagrams

The maximum a posteriori probability (MAP) algorithm is a trellis-based MAP decoding algorithm. It is the heart of turbo (or iterative) decoding that achieves an error performance near the Shannon limit. Unfortunately, the implementation of this algorithm requires large computation and storage. Furthermore, its forward and backward recursions result in long decoding delay. For practical applications, this decoding algorithm must be simplified and its decoding complexity and delay must be reduced. In this paper, the MAP algorithm and its variations, such as log-MAP and max-log-MAP algorithms, are first applied to sectionalized trellises for linear block codes and carried out as two-stage decodings. Using the structural properties of properly sectionalized trellises, the decoding complexity and delay of the MAP algorithms can be reduced. Computation-wise optimum sectionalizations of a trellis for MAP algorithms are investigated. Also presented in this paper are bidirectional and parallel MAP decodings.

Lui, Ye↗