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 1,477 records · Page 82

Time delay analysis of the lensed quasar SDSS J1001+5027

We modify the algorithm we proposed in Aghamousa and Shafieloo for the time delay estimation of strongly lensed systems incorporating the weighted cross-correlation and weighted summation of correlation coefficients. We show the high performance of this algorithm by applying it to Time Delay Challenge (TDC1) simulated data. We apply then our proposed method to the light curves of the lensed quasar SDSS J1001+5027 since this system has been well studied by other groups, to compare our results with their findings. In this work we propose a new estimator, the “mirror” estimator, along with a list of criteria for reliability testing of the estimation. Our mirror estimator results are −117.1{sub −3.7}{sup +7.1} and −117.1{sub −8.8}{sup +7.2} using simple Monte Carlo simulations and simulated light curves provided by Rathna Kumar et al., respectively. Although the TDC1 simulations do not reflect the properties of the SDSS J1001+5027 light curves, using these simulations results in a smaller uncertainty, which shows that the higher quality observations can lead to a substantially more precise time delay estimation. Our time delay estimation is in agreement with the findings of the other groups for this strongly lensed system, and the difference in the size of the error bars reflects the importance of appropriate light curve simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

Computations of unsteady transonic flow governed by the conservative full potential equation using an alternating direction implicit algorithm

A development was the time linearization of the density function. This linearization reduces the solution process from solving just a single equation. Two sample cases were computed. First, a one dimensional traveling shock wave was computed and compared with the analytic solution. Second, a two dimensional case was calculated for a flow field which resulted from a thickening and subsequently, thinning airfoil. The resulting flow field, which included a traveling shock wave, was compared to the flow field obtained from the low frequency, small disturbance, transonic equation.

Goorjian, P. M.↗

A singular perturbation analysis of minimum time long range intercept

The application of singular perturbation theory for deriving algorithms suitable for on board real time computation of optimal aircraft trajectory control was investigated. Minimum time intercept in three dimensions was selected as a pilot problem formulation, and data for an early version F-4 aircraft was used to represent aircraft aerodynamic and propulsion characteristics. Results include the derivation of nonlinear, near optimal feedback control laws that are readily implementable in an aircraft flight computer, performance results for a variety of initial conditions (including optimal intercept at short ranges), and a point mass three dimensional simulation suitable for representing fighter aircraft under closed loop optimal control.

Calise, A.↗

Maximum likelihood estimation of signal-to-noise ratio and combiner weight

An algorithm for estimating signal to noise ratio and combiner weight parameters for a discrete time series is presented. The algorithm is based upon the joint maximum likelihood estimate of the signal and noise power. The discrete-time series are the sufficient statistics obtained after matched filtering of a biphase modulated signal in additive white Gaussian noise, before maximum likelihood decoding is performed.

Kalson, S.↗

Distributed Spatiotemporal Motion Planning for Spacecraft Swarms in Cluttered Environments

This paper focuses on trajectory planning for spacecraft swarms in cluttered environments, like debris fields or the asteroid belt. Our objective is to reconfigure the spacecraft swarm to a desired formation in a distributed manner while minimizing fuel and avoiding collisions among themselves and with the obstacles. In our prior work we proposed a novel distributed guidance algorithm for spacecraft swarms in static environments.1 In this paper, we present the Multi-Agent Moving-Obstacles Spherical Expansion and Sequential Convex Programming (MAMO SE–SCP) algorithm that extends our prior work to include spatiotemporal constraints such as time-varying, moving obstacles and desired time-varying terminal positions. In the MAMO SE–SCP algorithm, each agent uses a spherical-expansion-based sampling algorithm to cooperatively explore the time-varying environment, a distributed assignment algorithm to agree on the terminal position for each agent, and a sequential-convex-programming-based optimization step to compute the locally-optimal trajectories from the current location to the assigned time-varying terminal position while avoiding collision with other agent and the moving obstacles. Simulations results demonstrate that the proposed distributed algorithm can be used by a spacecraft swarm to achieve a time-varying, desired formation around an object of interest in a dynamic environment with many moving and tumbling obstacles.

Hadaegh, Fred Y.↗

A Bayesian approach to tracking patients having changing pharmacokinetic parameters

This paper considers the updating of Bayesian posterior densities for pharmacokinetic models associated with patients having changing parameter values. For estimation purposes it is proposed to use the Interacting Multiple Model (IMM) estimation algorithm, which is currently a popular algorithm in the aerospace community for tracking maneuvering targets. The IMM algorithm is described, and compared to the multiple model (MM) and Maximum A-Posteriori (MAP) Bayesian estimation methods, which are presently used for posterior updating when pharmacokinetic parameters do not change. Both the MM and MAP Bayesian estimation methods are used in their sequential forms, to facilitate tracking of changing parameters. Results indicate that the IMM algorithm is well suited for tracking time-varying pharmacokinetic parameters in acutely ill and unstable patients, incurring only about half of the integrated error compared to the sequential MM and MAP methods on the same example.

Bayes Theorem↗

Fermionic Isometric Tensor Network States in Two Dimensions

We generalize isometric tensor network states to fermionic systems, paving the way for efficient adaptations of 1D tensor network algorithms to 2D fermionic systems. As the first application of this formalism, we developed and benchmarked a time-evolving block-decimation (TEBD) algorithm for real-time and imaginary-time evolution. The imaginary-time evolution produces ground-state energies for gapped systems, systems with a Dirac point, and systems with gapless edge modes to good accuracy. Here, the real-time TEBD captures the scattering of two fermions and the chiral edge dynamics on the boundary of a Chern insulator.

2-dimensional systems↗

Krylov Subspace Methods for Quantum Dynamics with Time-Dependent Generators

Krylov subspace methods in quantum dynamics identify the minimal subspace in which a process unfolds. To date, their use is restricted to time evolutions governed by time-independent generators. Here, we introduce a generalization valid for driven quantum systems governed by a time-dependent Hamiltonian that maps the evolution to a diffusion problem in a one-dimensional lattice with nearest-neighbor hopping probabilities that are inhomogeneous and time dependent. This representation is used to establish a novel class of fundamental limits to the quantum speed of evolution and operator growth. We also discuss generalizations of the algorithm, adapted to discretized time evolutions and periodic Hamiltonians, with applications to many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Minimal State Augmentation Algorithm for Vision-Based Navigation without Using Mapped Landmarks

This paper describes MAVeN (Minimal State Augmentation Algorithm for Vision-Based Navigation), which is a new algorithm for vision-based navigation that has only 21 states, yet is able to track features in successive camera images and use them to propagate estimates of the spacecraft position and velocity. The filter dimension drops to 12 if attitude information is already available. The low filter dimension makes MAVeN a very reliable and practical algorithm for real-time flight implementation. The main idea is to project observed features onto a rough shape model of the ground surface, which are then used by the filter as pseudo-landmarks. The shape model is assumed to be known beforehand, as would be obtained from prior surveillance of the landing site from orbit. MAVeN does not require pre-mapped landmarks, so it is able to navigate terrain that has not been previously observed up close. This property is especially important for close proximity operations in small body missions where ground surface features are being seen for the first time at close range. MAVeN is also able to hover motionless above the ground without position error growth, which is unusual for this class of vision-based navigation algorithms.

San Martin, A. Miguel↗

Multirate sampled-data yaw-damper and modal suppression system design

A multirate control law synthesized algorithm based on an infinite-time quadratic cost function, was developed along with a method for analyzing the robustness of multirate systems. A generalized multirate sampled-data control law structure (GMCLS) was introduced. A new infinite-time-based parameter optimization multirate sampled-data control law synthesis method and solution algorithm were developed. A singular-value-based method for determining gain and phase margins for multirate systems was also developed. The finite-time-based parameter optimization multirate sampled-data control law synthesis algorithm originally intended to be applied to the aircraft problem was instead demonstrated by application to a simpler problem involving the control of the tip position of a two-link robot arm. The GMCLS, the infinite-time-based parameter optimization multirate control law synthesis method and solution algorithm, and the singular-value based method for determining gain and phase margins were all demonstrated by application to the aircraft control problem originally proposed for this project.

Berg, Martin C.↗

Implementation of a level 1 trigger system using high speed serial (VXS) techniques for the 12GeV high luminosity experimental programs at Thomas Jefferson National Accelerator Facility

We will demonstrate a hardware and firmware solution for a complete fully pipelined multi-crate trigger system that takes advantage of the elegant high speed VXS serial extensions for VME. This trigger system includes three sections starting with the front end crate trigger processor (CTP), a global Sub-System Processor (SSP) and a Trigger Supervisor that manages the timing, synchronization and front end event readout. Within a front end crate, trigger information is gathered from each 16 Channel, 12 bit Flash ADC module at 4 nS intervals via the VXS backplane, to a Crate Trigger Processor (CTP). Each Crate Trigger Processor receives these 500 MB/S VXS links from the 16 FADC-250 modules, aligns skewed data inherent of Aurora protocol, and performs real time crate level trigger algorithms. The algorithm results are encoded using a Reed-Solomon technique and transmission of this Level 1 trigger data is sent to the SSP using a multi-fiber link. The multi-fiber link achieves an aggregate trigger data transfer rate to the global trigger at 8 Gb/s. The SSP receives and decodes Reed-Solomon error correcting transmission from each crate, aligns the data, and performs the global level trigger algorithms. The entire trigger system is synchronous and operates at 250 MHz with the Trigger Supervisor managing not only the front end event readout, but also the distribution of the critical timing clocks, synchronization signals, and the global trigger signals to each front end readout crate. These signals are distributed to the front end crates on a separate fiber link and each crate is synchronized using a unique encoding scheme to guarantee that each front end crate is synchronous with a fixed latency, independent of the distance between each crate. The overall trigger signal latency is <3 uS, and the proposed 12GeV experiments at Jefferson Lab require up to 200KHz Level 1 trigger rate.

43 PARTICLE ACCELERATORS↗

A Repositioning Method for Shared Autonomous Vehicles Operation

Shared fully-automated, or autonomous, mobility (SAVs) is anticipated to be the likely choice for future urban travel. SAVs boast many operational benefits but will add congestion in the form of unoccupied miles. The fleet's success further depends on service measures like the wait times for pickup trips. Agent-based simulation tools have closely looked at SAV operations but typically lack the integration between the supply and demand sides when simulating a population at scale. This paper focuses on the impact of SAV relocation on traveler wait times using a novel algorithm for repositioning. POLARIS, an agent-based tool, is used for a case study of Bloomington, Illinois to quantify the benefits of allowing SAV repositioning. On average, the wait times were lower with repositioning for all adequate fleet sizes. SAVs were available more uniformly across the region's zones, and proportional to trip-making at different times of day. In addition, with repositioning enable a higher share of demands were served. Finally, the increase in empty fleet miles from SAV repositioning may be justified with more trips being served, and an overall improvement in SAV wait times. (C) 2020 The Authors. Published by Elsevier B.V.

Agent-Based Simulation↗

A quantum algorithm to efficiently sample from interfering binary trees

Quantum computers provide an opportunity to efficiently sample from probability distributions that include non-trivial interference effects between amplitudes. Using a simple process wherein all possible state histories can be specified by a binary tree, we construct an explicit quantum algorithm that runs in polynomial time to sample from the process once. The corresponding naive Markov Chain algorithm does not produce the correct probability distribution and an explicit classical calculation of the full distribution requires exponentially many operations. Finally, the problem can be reduced to a system of two qubits with repeated measurements, shedding light on a quantum-inspired efficient classical algorithm.

97 MATHEMATICS AND COMPUTING↗

Parallel Algorithms for Efficient Computation of High-Order Line Graphs of Hypergraphs

This paper considers structures of systems beyond dyadic (pairwise) interactions and investigates mathematical modeling of multi-way interactions and connections as hypergraphs, where captured relationships among system entities are set-valued. To date, in most situations, entities in a hypergraph are considered connected as long as there is at least one common ``neighbor''. However, minimal commonality sometimes discards the ``strength'' of connections and interactions among groups. To this end, considering the ``width'' of a connection, referred to as the \emph{$s$-overlap} of neighbors, provides more meaningful insights into how closely the communities or entities interact with each other. In addition, $s$-overlap computation is the fundamental kernel to construct the line graph of a hypergraph, a low-order approximation of the hypergraph which can carry significant information about the original hypergraph. Subsequent stages of a data analytics pipeline then can apply highly-tuned graph algorithms on the line graph to reveal important features. Given a hypergraph, computing the $s$-overlaps by exhaustively considering all pairwise entities can be computationally prohibitive. To tackle this challenge, we develop efficient algorithms to compute $s$-overlaps and the corresponding line graph of a hypergraph. We propose several heuristics to avoid execution of redundant work and improve performance of the $s$-overlap computation. Our parallel algorithm, combined with these heuristics, is orders of magnitude (more than $10\times$) faster than the naive algorithm in all cases and the SpGEMM algorithm with filtration in most cases (especially with large $s$ value).

hypergraph algorithms, graph algorithms, parallel ↗

Calculation of Residual Dose Around Small Objects Using Mu2e Target as an Example

The MARS15 code provides contact residual dose rates for relatively large accelerator and experimental components for predefined irradiation and cooling times. The dose rate at particular distances from the components, some of which can be rather small in size, is calculated in a post Monte-Carlo stage via special algorithms described elsewhere. The approach is further developed and described in this paper.

43 PARTICLE ACCELERATORS↗

Numerical predictions of residence times behind a rearward facing step with transverse injection

A numerical investigation of the two-dimensional recirculation zone formed between a rear-ward facing step and a transverse hydrogen jet in a supersonic flow is presented. Calculations were made using an elliptic flow computer code with a time-relaxation finite difference integration algorithm. Cases were examined for jet static pressures between 2 and 5 times mainstream with jets located 3 to 7 step heights downstream of the step. Nominal mainstream flow conditions were Mach 2.4 air at 1 atm pressure and 1000K (1800R) static temperature. Results in the form of mean properties in the recirculation zone and residence time are presented. Calculations of the decay of hydrogen mass from the steady state are presented for selected cases. The combustion potential for each case is assessed by comparison of computed conditions in the recirculation zone with the results from a well-stirred reactor theory.

Rogers, R. C.↗

Numerical predictions of residence times behind a rearward facing step with transverse injection

A numerical investigation of the two-dimensional recirculation zone formed between a rearward facing step and a transverse hydrogen jet in a supersonic flow is presented. Calculations were made using an elliptic flow computer code with a time-relaxation finite difference integration algorithm. Cases were examined for jet static pressures between 2 and 5 times mainstream with jets located 3 to 7 step heights downstream of the step. Nominal mainstream flow conditions were Mach 2.4 air at 1 atm pressure and 1000 K (1800 R) static temperature. Results in the form of mean properties in the recirculation zone and residence time are presented. Calculations of the decay of hydrogen mass from the steady state are presented for selected cases. The combustion potential for each case is assessed by comparison of computed conditions in the recirculation zone with the results from a well-stirred reactor theory.

Rogers, R. C.↗