Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized 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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Time scheduling of a mix of 4D equipped and unequipped aircraft

In planning for a future automated air traffic system, it is necessary to confront the transition situation in which some percentage of the traffic must be handled by conventional means. A safe, efficient transition system is needed since initially not all aircraft will be able to respond to a more automated system. The specific problem addressed was that of time scheduling a mix of 4D-equipped aircraft (aircraft that can accurately meet a controller specified time schedule at selected way points in the terminal area) when operating in conjunction with unequipped aircraft (aircraft that require air traffic handling by means of standard vectoring techniques). First, a relationship between time separation and system capacity was developed. The time separations were incorporated into a set of scheduling algorithms which contain the required elements of flexibility needed for terminal-area operation, such as delaying aircraft and changing time separations. The problem of reducing the size of time separations allotted for vectored aircraft by means of computer assists to the controller was also addressed.

Tobias, L.↗
NASA NTRS1989

Black light - How sensors filter spectral variation of the illuminant

Visual sensor responses may be used to classify objects on the basis of their surface reflectance functions. In a color image, the image data are represented as a vector of sensor responses at each point in the image. This vector depends both on the surface reflectance functions and on the spectral power distribution of the ambient illumination. Algorithms designed to classify objects on the basis of their surface reflectance functions typically attempt to overcome the dependence of the sensor responses on the illuminant by integrating sensor data collected from multiple surfaces. In machine vision applications, it is shown that it is often possible to design the sensor spectral responsivities so that the vector direction of the sensor responses does not depend upon the illuminant. The conditions under which this is possible are given and an illustrative calculation is performed. In biological systems, where the sensor responsivities are fixed, it is shown that some changes in the illumination cause no change in the sensor responses. Such changes in illuminant are called black illuminants. It is possible to express any illuminant as the sum of two unique components. One component is a black illuminant. The second component is called the visible component. The visible component of an illuminant completely characterizes the effect of the illuminant on the vector of sensor responses.

Brainard, David H.↗
NASA NTRS2009

Discrete Fourier Transform Analysis in a Complex Vector Space

Alternative computational strategies for the Discrete Fourier Transform (DFT) have been developed using analysis of geometric manifolds. This approach provides a general framework for performing DFT calculations, and suggests a more efficient implementation of the DFT for applications using iterative transform methods, particularly phase retrieval. The DFT can thus be implemented using fewer operations when compared to the usual DFT counterpart. The software decreases the run time of the DFT in certain applications such as phase retrieval that iteratively call the DFT function. The algorithm exploits a special computational approach based on analysis of the DFT as a transformation in a complex vector space. As such, this approach has the potential to realize a DFT computation that approaches N operations versus Nlog(N) operations for the equivalent Fast Fourier Transform (FFT) calculation.

Dean, Bruce H.↗
NASA NTRS2010

Determining Atmospheric-Density Profile of Titan

A method was developed for measuring the atmospheric density of Titan, the largest moon of Saturn, to create an accurate density profile as a function of altitude. This will allow mission planners to select safe flyby altitudes, and for navigation engineers to accurately predict the delta-v associated with those flybys. The spacecraft angular rate vector profile as a function of time is collected via telemetry from the onboard attitude estimator once every 2 seconds. The telemetry for thruster times, as a function of time, for eight Reaction Control System (RCS) thrusters is gathered, once a second, from the Propulsion Manager algorithm of the Cassini onboard attitude-control flight software. Using these data, the ground software computes the angular momentum vector profile and the per-axis external torque as a function of time imparted from the spacecraft only due to the atmospheric drag. The software can then determine the Titan atmospheric density profile as a function of time and altitude with the known values of spacecraft center of mass, the Titan-relative range and velocity data, the projected area, and the aerocenter, along with the estimated drag coefficient in a free molecular flow field.

Sarani, Siamak↗
DOE OSTI2025

Deep Koopman operators for causal discovery

Causal discovery aims to identify cause-effect mechanisms for better scientific understanding, explainable decision-making, and more accurate modeling. Standard statistical frameworks, such as Granger causality, lack the ability to quantify causal relationships in nonlinear dynamics due to the presence of complex feedback mechanisms, timescale mixing, and nonstationarity. Thus, applying these methods to study causal dynamics in real-world systems, such as the Earth, is a major challenge. Addressing this shortcoming, we leverage deep learning and a Koopman operator-theoretic formalism to present a class of causal discovery algorithms. Kausal uses deep Koopman operator methods to approximate nonlinear dynamics in a linearized vector space in which traditional causal inference methods such as Granger causality can be more easily applied. Our idealized experiments demonstrate Kausal’s superior ability in discovering and characterizing causal signals compared to existing deep learning and non-deep learning state-of-the-art approaches. Finally, the successful identification of major El Niño and La Niña events in observations showcases Kausal’s skill to handle real-world applications.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1980

CCD data processor for maximum likelihood feature classification

The paper describes an advanced technology development which utilizes a high speed analog/binary CCD correlator to perform the matrix multiplications necessary to implement onboard feature classification. The matrix manipulation module uses the maximum likelihood classification algorithm assuming a Gaussian probability density function. The module will process 16 element multispectral vectors at rates in excess of 500 thousand multispectral vector elements per second. System design considerations for the optimum use of this module are discussed, test results from initial device fabrication runs are presented, and the performance in typical processing applications is described

Benz, H. F.↗
NASA NTRS1983

Flux-based acceleration of the Euler equations

A new coarse grid acceleration scheme for the Euler equations is presented. This flux based scheme eliminates the need, exhibited by previous accelerators, for computing flux vector Jacobian matrices. The method is derived and implemented in a two dimensional flow algorithm. Numerical results are presented for both subcritical and shocked, supercritical flow. These results demonstrate that the flux based accelerator is more efficient than its Jacobian based counterpart. Generalization to three dimensions is immediate. Construction of flux based accelerators for the Navier-Stokes equations is also discussed.

Johnson, G. M.↗
NASA NTRS1986

Efficient solution methods for the Navier-Stokes equations

Implicit finite difference schemes for solving two-dimensional and three-dimensional Euler and thin layer Navier-Stokes equations are addressed. The methods are demonstrated in fully vectorized codes for a Cray type architecture. The Beam and Warming implicit approximate factorization algorithm in generalized coordinates is used. The methods are either time accurate or accelerated non-time accurate steady state schemes. Acceleration and efficiency modifications such as matrix reduction, diagonalization, and flux split schemes are presented. Two dimensional inviscid and viscous calculations (e.g., airfoils with a deflected spoiler, circulation control airfoils, and unsteady buffeting) and of three dimensional viscous elliptical bodies, exhausting boattails, and generic oblique wing computations are discussed.

Pulliam, T. H.↗
NASA NTRS1987

Analysis of implicit local linearization techniques for upwind and TVD algorithms

An attempt is made to investigate local time linearization techniques for implicit flux-difference splitting and flux-vector splitting schemes in the simplest settings (i.e., first-order spatial schemes and one-dimensional Euler flows). It is noted that first-order spatial schemes provide the simplest examples of schemes which are collective extensions of scalar TVD schemes. Simple analytical results concerning the local linearizations are highlighted and subsequently verified using a numerical fixed-point analysis on selected problems. It is noted that while primary emphasis is on asymptotic behavior, many of the results have implications for time-accurate calculations as well.

Barth, Timothy J.↗
NASA NTRS2016

Full Gradient Solution to Adaptive Hybrid Control

This paper focuses on the adaptation mechanisms in adaptive hybrid controllers. Most adaptive hybrid controllers update two filters individually according to the filtered-reference least mean squares (FxLMS) algorithm. Because this algorithm was derived for feedforward control, it does not take into account the presence of a feedback loop in the gradient calculation. This paper provides a derivation of the proper weight vector gradient for hybrid (or feedback) controllers that takes into account the presence of feedback. In this formulation, a single weight vector is updated rather than two individually. An internal model structure is assumed for the feedback part of the controller. The full gradient is equivalent to that used in the standard FxLMS algorithm with the addition of a recursive term that is a function of the modeling error. Some simulations are provided to highlight the advantages of using the full gradient in the weight vector update rather than the approximation.

Bean, Jacob↗
NASA NTRS2017

Full Gradient Solution to Adaptive Hybrid Control

This paper focuses on the adaptation mechanisms in adaptive hybrid controllers. Most adaptive hybrid controllers update two filters individually according to the filtered reference least mean squares (FxLMS) algorithm. Because this algorithm was derived for feedforward control, it does not take into account the presence of a feedback loop in the gradient calculation. This paper provides a derivation of the proper weight vector gradient for hybrid (or feedback) controllers that takes into account the presence of feedback. In this formulation, a single weight vector is updated rather than two individually. An internal model structure is assumed for the feedback part of the controller. The full gradient is equivalent to that used in the standard FxLMS algorithm with the addition of a recursive term that is a function of the modeling error. Some simulations are provided to highlight the advantages of using the full gradient in the weight vector update rather than the approximation.

Bean, Jacob↗
NASA NTRS1995

Selecting a general-purpose data compression algorithm

The National Space Science Data Center's Common Data Formate (CDF) is capable of storing many types of data such as scalar data items, vectors, and multidimensional arrays of bytes, integers, or floating point values. However, regardless of the dimensionality and data type, the data break down into a sequence of bytes that can be fed into a data compression function to reduce the amount of data without losing data integrity and thus remaining fully reconstructible. Because of the diversity of data types and high performance speed requirements, a general-purpose, fast, simple data compression algorithm is required to incorporate data compression into CDF. The questions to ask are how to evaluate and compare compression algorithms, and what compression algorithm meets all requirements. The object of this paper is to address these questions and determine the most appropriate compression algorithm to use within the CDF data management package that would be applicable to other software packages with similar data compression needs.

Mathews, Gary Jason↗
NASA NTRS1979

CLASSY: An adaptive maximum likelihood clustering algorithm

The CLASSY clustering method alternates maximum likelihood iterative techniques for estimating the parameters of a mixture distribution with an adaptive procedure for splitting, combining, and eliminating the resultant components of the mixture. The adaptive procedure is based on maximizing the fit of a mixture of multivariate normal distributions to the observed data using its first through fourth central moments. It generates estimates of the number of multivariate normal components in the mixture as well as the proportion, mean vector, and covariance matrix for each component. The basic mathematical model for CLASSY and the actual operation of the algorithm as currently implemented are described. Results of applying CLASSY to real and simulated LANDSAT data are presented and compared with those generated by the iterative self-organizing clustering system algorithm on the same data sets.

Lennington, R. K.↗
NASA NTRS2011

State-Based Implicit Coordination and Applications

In air traffic management, pairwise coordination is the ability to achieve separation requirements when conflicting aircraft simultaneously maneuver to solve a conflict. Resolution algorithms are implicitly coordinated if they provide coordinated resolution maneuvers to conflicting aircraft when only surveillance data, e.g., position and velocity vectors, is periodically broadcast by the aircraft. This paper proposes an abstract framework for reasoning about state-based implicit coordination. The framework consists of a formalized mathematical development that enables and simplifies the design and verification of implicitly coordinated state-based resolution algorithms. The use of the framework is illustrated with several examples of algorithms and formal proofs of their coordination properties. The work presented here supports the safety case for a distributed self-separation air traffic management concept where different aircraft may use different conflict resolution algorithms and be assured that separation will be maintained.

Narkawicz, Anthony J.↗
NASA NTRS1985

Efficient algorithms for use in probabilistic finite element analysis

This paper investigates the use of Fast Probability Integration (FPI) algorithms in a Finite Element environment. A method allowing the representation of correlated fields in terms of a vector of uncorrelated transformed variables, based on the spectral decomposition of the variance-covariance matrix is developed. The response of the deterministic model corresponding to selected perturbations of these uncorrelated variables is then obtained via a Newton-type iterative scheme. The results of the perturbed problems are used to construct a local representation of the model's behavior in the neighborhood of the deterministic state, which the FPI algorithm will use to estimate the reliability of the system. Although the proposed strategy has thus far only been applied to linear elastostatics, the extension of the method to a broader class of problems appears to be feasible.

Dias, J. B.↗
NASA NTRS1987

Enhancements to Program LAURA for computation of three-dimensional hypersonic flow

Changes to Program Laura (Langley Aerothermodynamic Upwind Relaxation Algorithm) are presented which enhance both stability and accuracy of the algorithm. A discussion of iteration/sweeping strategies and their relation to computer architectures is included to best exploit the capabilities of serial, vector, and parallel processor machines. Test cases for Mach 10 perfect gas flow and Mach 32 real gas flow in chemical nonequilibrium over a blunt, raked elliptic cone using the thin-layer Navier-Stokes equations are presented in order to demonstrate the current improved capabilities. Algorithm changes include the use of volume averaging, application of a symmetric total variation diminishing (TVD) scheme, and stronger interaction between the grid/shock alignment routine and the relaxation algorithm. Good comparisons with heat transfer and pitching moment data at three different angles of attack for the Mach 10 tests serve to further validate the present algorithm. Parameters are defined which control the coupling of the specie continuity equations with the solution of the mixture conservation equations. A discussion of the consequences involved in the choice of strong versus weak coupling is presented, and a sample nonequilibrium calculation on a fine grid over a full scale model of the Aeroassist Flight Experiment (AFE) demonstrates current capabilities.

Gnoffo, Peter A.↗
NASA NTRS1991

Transonic Navier-Stokes solutions about a generic hypersonic configuration

Three-dimensional transonic viscous flow computations are presented for a generic high-speed accelerator model that includes wing, body, fillets, and a no-flow-through engine nacelle. Solutions are obtained from an algorithm for the compressible Navier-Stokes equations that incorporates an upwind-biased, flux-vector-splitting approach along with longitudinally patched grids. Results are presented for fully turbulent flow assumptions and include correlations with wind-tunnel data. A good quantitative agreement for the forebody surface pressure distribution is achieved between computations and the available wind-tunnel measurements at M∞ = 0.9. Furthermore, it is demonstrated that the flow is stagnating around the boattail region due to separation from the aft-engine cowl lip.

Hypersonic flows↗
DOE OSTI2026

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗