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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 505 records · Page 28

All sources NASA NTRS DOE OSTI

NASA NTRS1992

Linear system identification via backward-time observer models

Presented here is an algorithm to compute the Markov parameters of a backward-time observer for a backward-time model from experimental input and output data. The backward-time observer Markov parameters are decomposed to obtain the backward-time system Markov parameters (backward-time pulse response samples) for the backward-time system identification. The identified backward-time system Markov parameters are used in the Eigensystem Realization Algorithm to identify a backward-time state-space model, which can be easily converted to the usual forward-time representation. If one reverses time in the model to be identified, what were damped true system modes become modes with negative damping, growing as the reversed time increases. On the other hand, the noise modes in the identification still maintain the property that they are stable. The shift from positive damping to negative damping of the true system modes allows one to distinguish these modes from noise modes. Experimental results are given to illustrate when and to what extent this concept works.

Juang, Jer-Nan↗

NASA NTRS1982

Scaled Runge-Kutta algorithms for treating the problem of dense output

A set of scaled Runge-Kutta algorithms for the third- through fifth-orders are developed to determine the solution at any point within the integration step at a relatively small increase in computing time. Each scaled algorithm is designed to be used with an existing Runge-Kutta formula, using the derivative evaluations of the defining algorithm along with an additional derivative evaluation (or two). Third-order, scaled algorithms are embedded within the existing formulas at no additional derivative expense. Such algorithms can easily be adopted to generate interpolating polynomials (or dependent variable stops) efficiently.

Horn, M. K.↗

NASA NTRS2014

Temporal Precedence Checking for Switched Models and its Application to a Parallel Landing Protocol

This paper presents an algorithm for checking temporal precedence properties of nonlinear switched systems. This class of properties subsume bounded safety and capture requirements about visiting a sequence of predicates within given time intervals. The algorithm handles nonlinear predicates that arise from dynamics-based predictions used in alerting protocols for state-of-the-art transportation systems. It is sound and complete for nonlinear switch systems that robustly satisfy the given property. The algorithm is implemented in the Compare Execute Check Engine (C2E2) using validated simulations. As a case study, a simplified model of an alerting system for closely spaced parallel runways is considered. The proposed approach is applied to this model to check safety properties of the alerting logic for different operating conditions such as initial velocities, bank angles, aircraft longitudinal separation, and runway separation.

Duggirala, Parasara Sridhar↗

NASA NTRSDate not supplied

COBRA-DDP: Trajectory Generation and Collision Avoidance Augmentations for eVTOL Vehicles

This paper presents a receding horizon model predictive control variation of the combined Bernstein polynomial optimal reciprocal collision avoidance (ORCA) differential dynamic programming (COBRA-DDP) algorithm for AAM vehicles. Collision avoidance in combination with effective trajectory replanning are expected to be core components of AAM vehicles operating within a crowded airspace. This environment necessitates the use of real-time trajectory planning algorithms that are capable of planning around large amounts of stationary and moving obstacles. Previous work on COBRA-DDP demonstrated the capability of the algorithm to produce dynamically feasible trajectories for AAM vehicles and general collision avoidance. This paper improves upon the previous work by increasing the number of stationary and moving obstacles, implementing a variation of COBRA-DDP that lends itself to real-time application. These advancements are demonstrated on a vertical takeoff and landing (VTOL) vehicle simulation with highly nonlinear vehicle dynamics.

COBRA-DDP↗

NASA NTRSDate not supplied

COBRA-DDP: Trajectory Generation and Collision Avoidance Augmentations for eVTOL Vehicles

COBRA-DDP↗

NASA NTRS2019

ATLAS Flight Science Receiver Algorithms

This is the basis document for the ATLAS Receiver Algorithms. ATLAS is the single instrument on the ICESat-2 mission. The Receiver (Rx) Algorithms select the signal location in real-time and instruct the hardware to telemeter a vertical band of received time-tags about this signal location. The algorithms are implemented in the Flight Software (FSW) and in the hardware of the Photon Counting Electronics (PCE) cards. The sole purpose of the algorithms is to reduce the telemetry data volume to fit within the downlink constraint while maximizing the probability of downlinking surface signal. All versions of the Receiver Algorithms from version 2.8 onward incorporate our best knowledge of the ATLAS hardware at this time. It presents algorithms that, based on current Simulator testing, satisfy all of the requirements for the Rx Algorithms. Testing during ATLAS Instrument Integration and Testing with the hardware and software implementation of the Rx Algorithms revealed characteristics and responses that required changes to the Rx Algorithms and this document, which are captured in the change record below.All relevant documentation for the Receiver Algorithms can be found on the ICESat-2 Technical Data Management System (TDMS) under the ATLAS Algorithms subsystem.The launch version of the FSW (version 3.1.0) is based upon version 3.7c of this document.

Mcgarry, Jan L.↗

NASA NTRS1988

Reliable broadcast in hypercube multicomputers

A simple algorithm for broadcasting in a hypercube multicomputer containing faulty nodes/links is proposed. The algorithm delivers multiple copies of the broadcast message through disjoint paths to all the modes in the system. Its salient feature is that the delivery of the multiple copies is transparent to the processes receiving the message and does not require the processes to know the identity of the faulty processors. The processes on nonfaulty nodes that receive the message identify the original message from the multiple copies using some scheme appropriate for the fault model used. The algorithm completes in n + 1 steps if each node can simultaneously use all of its outgoing links. If each node cannot use more than one outgoing link at a time, then the algorithm requires 2n steps.

Ramanathan, P.↗

NASA NTRS1990

Rapid calculation of terrain parameters for radiation modeling from digital elevation data

Digital elevation models are now widely used to calculate terrain parameters to determine incoming solar and longwave radiation for use in surface climate models, interpretation of remote-sensing data, and parameters in hydrologic models. Because of the large number of points in an elevation grid, fast algorithms are useful to save computation time. A description is given of rapid methods for calculating slope and azimuth, solar illumination angle, horizons, and view factors for radiation from sky and terrain. Calculation time is reduced by fast algorithms and lookup tables.

Dozier, Jeff↗

NASA NTRS1991

Optimal discrete-time dynamic output-feedback design - A w-domain approach

An alternative method for optimal digital control design is described in this paper. The method is based on the usage of the w-transform and has many attractive design features. One of these is its immediate connection with frequency loop-shaping techniques that are now popular and effective for multivariable control synthesis in continuous-time domain. Furthermore, any design algorithms originally developed for continuous-time systems can now be immediately extended to the discrete-time domain. The main results presented in this paper are the exact problem formulation and solution of an optimal discrete-time dynamic output-feedback design in the w-domain involving a quadratic performance index to random disturbances. In addition, necessary conditions for optimality are obtained for the numerical solution of the optimal output-feedback compensator design. A numerical example is presented illustrating its application to the design of a low-order dynamic compensator in a stability augmentation system of a commercial transport.

Ha, Cheolkeun↗

NASA NTRS2012

Method and system for enabling real-time speckle processing using hardware platforms

An accelerator for the speckle atmospheric compensation algorithm may enable real-time speckle processing of video feeds that may enable the speckle algorithm to be applied in numerous real-time applications. The accelerator may be implemented in various forms, including hardware, software, and/or machine-readable media.

Ortiz, Fernando E.↗

NASA NTRS1990

Improved Coupled Fluid/Structural Dynamical Model

Improved algorithm developed for simulation of coupled motions of fluids and structures. Minimum requirement for correct simulation of damping is forces and velocities at interface compatible in models of structure and fluid at each time step. Improved algorithm, conforms to this requirement, involves fluid-transient model, structural modal/transient model, and an algebraic impedance/coupling subalgorithm. Use of this algorithm greatly improves computational stability.

Fenwick, James R.↗

NASA NTRSDate not supplied

Path-Adaptive Guidance Algorithm Trades for a Two-Stage Lunar Descent Vehicle

For the next generation of NASA’s missions, explicit, path-adaptive descent guidance algorithms must provide the stability and customizability required for a safe and efficient descent to the lunar surface, while also meeting program and vehicle constraints. Several descent algorithms have been flown and tested for single-stage landers through the Apollo and Altair programs, but thus far little analysis has been conducted involving the application of these algorithms to a two-stage descent vehicle. Due to payload mass and fairing constraints of the existing fleet of launch vehicles, multi-stage descent architectures are a unique option for achieving the greatest possible mass to lunar surface. This paper seeks to compare the performance of guidance configurations of a lunar lander system consisting of two stages, one of which separates partway through descent. Through development of this paper, an optimization suite has been written that is specifically designed for optimizing planetary non-atmospheric two-stage descent trajectories, and is used as a baseline to compare the guidance algorithms tested. Time-to-go computational methods and ignition logic routines that may be employed in a lunar environment are also discussed. Preliminary results are presented that show relative performance metrics for a range of different guidance algorithm configurations.

Jason M Everett↗

NASA NTRS1985

Dynamic Identification for Control of Large Space Structures

This is a compilation of reports by the one author on one subject. It consists of the following five journal articles: (1) A Parametric Study of the Ibrahim Time Domain Modal Identification Algorithm; (2) Large Modal Survey Testing Using the Ibrahim Time Domain Identification Technique; (3) Computation of Normal Modes from Identified Complex Modes; (4) Dynamic Modeling of Structural from Measured Complex Modes; and (5) Time Domain Quasi-Linear Identification of Nonlinear Dynamic Systems.

Ibrahim, S. R.↗

NASA NTRS1989

The power and efficiency of advanced software and parallel processing

Real-time simulation of flexible and articulating systems is difficult because of the computational burden of the time varying calculations. The mobile servicing system of the NASA Space Station Freedom will handle heavy payloads by local arm manipulations and by translating along the spline of the Station, it is crucial to have real-time simulation available. To enable such a simulation to be of high fidelity and to be able to be hosted on a modest computer, special care must be made in formulating the structural dynamics. Frontal solution algorithms save considerable time in performing these calculations. In addition, it is necessary to take advantage of parallel processing be compatible to take full advantage of both. An approach is offered which will result in high fidelity, real-time simulation for flexible, articulating systems such as the space Station remote servicing system.

Singh, Ramen P.↗

NASA NTRS1991

Sensor placement for on-orbit modal testing

A systematic procedure of placing accelerometers for the on-orbit modal identification of large flexible space structures is addressed. Target modes for modal testing are selected by examining the modal cost of each mode. Assuming that a time-domain modal identification algorithm such as Eigensystem Realization Algorithm is employed to identify the modes from measured time response data, the sensors are placed to ensure the recovery of the target modes. As an application example of the procedure, an accelerometer placement study for the Space Station Freedom On-Orbit Modal Identification Experiment is presented.

Lim, Tae W.↗

NASA NTRS2018

A Blueprint for Demonstrating Quantum Supremacy with Superconducting Qubits

Long coherence times and high fidelity control recently achieved in scalable superconducting circuits paved the way for the growing number of experimental studies of many-qubit quantum coherent phenomena in these devices. Albeit full implementation of quantum error correction and fault tolerant quantum computation remains a challenge the near term pre-error correction devices could allow new fundamental experiments despite inevitable accumulation of errors. One such open question foundational for quantum computing is achieving the so called quantum supremacy, an experimental demonstration of a computational task that takes polynomial time on the quantum computer whereas the best classical algorithm would require exponential time and/or resources. It is possible to formulate such a task for a quantum computer consisting of less than a 100 qubits. The computational task we consider is to provide approximate samples from a non-trivial quantum distribution. This is a generalization for the case of superconducting circuits of ideas behind boson sampling protocol for quantum optics introduced by Arkhipov and Aaronson. In this presentation we discuss a proof-of-principle demonstration of such a sampling task on a 9-qubit chain of superconducting gmon qubits developed by Google. We discuss theoretical analysis of the driven evolution of the device resulting in output approximating samples from a uniform distribution in the Hilbert space, a quantum chaotic state. We analyze quantum chaotic characteristics of the output of the circuit and the time required to generate a sufficiently complex quantum distribution. We demonstrate that the classical simulation of the sampling output requires exponential resources by connecting the task of calculating the output amplitudes to the sign problem of the Quantum Monte Carlo method. We also discuss the detailed theoretical modeling required to achieve high fidelity control and calibration of the multi-qubit unitary evolution in the device. We use a novel cross-entropy statistical metric as a figure of merit to verify the output and calibrate the device controls. Finally, we demonstrate the statistics of the wave function amplitudes generated on the 9-gmon chain and verify the quantum chaotic nature of the generated quantum distribution. This verifies the implementation of the quantum supremacy protocol.

Kechedzhi, Kostyantyn↗

NASA NTRS2017

Implementation of (O-)CGR in The ONE

Routing in Delay-/Disruption-Tolerant Networking (DTN) requires specific solutions as link impairments prevent the use of ordinary Internet algorithms, based on a timely dissemination of network topology information. Among DTN routing algorithms there is a dichotomy between opportunistic and deterministic (scheduled) solutions. The former are numerous and apply to terrestrial environments; CGR is the most widely supported algorithm designed for scheduled connectivity, and it is usually applied to space networks. However, in an attempt to provide a unified approach, an opportunistic variant of CGR, Opportunistic CGR (OCGR) has been recently proposed by some of the authors. Performance evaluations are normally carried out for opportunistic solutions by means of simulators, such as The ONE considered in this paper. CGR by contrast is more often studied by means of small testbeds. As the simulation approach could be complementary for CGR, and essential for OCGR, the authors have recently ported both of them into The ONE, by developing and releasing as free software a specific additional package. The aim of this paper is to show the rationale of this choice and discuss the many challenges that needed to be tackled to achieve this primary goal.

Tempesta, G.↗

NASA NTRS1993

The application of preconditioning in viscous flows

The present time-derivative preconditioning algorithm is effective in flow conditions ranging from inviscid to very diffusive flows, as well as low subsonic to supersonic flow velocities. By means of a preconditioning matrix that (1) introduces well-conditioned eigenvalues and (2) avoids nonphysical time reversals for viscous flows, a mechanism is obtained which controls the inviscid and viscous time-step parameters at very diffusive flows. These capabilities are demonstrated for a variety of sample problems; convergence rates of solutions that are indistinguishable from those obtained without preconditioning are shown to be accelerated by as much as two orders of magnitude.

Choi, Y.-H.↗