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 757 records · Page 42

Deep learning based x-ray spectrometer for high repetition rate characterization of betatron radiation

Betatron radiation produced from a laser-wakefield accelerator is a broadband, hard x-ray (>1 keV) source that has been used in a variety of applications in medicine, engineering, and fundamental science. Further development and optimization of stable, high repetition rate (HRR) (>1 Hz) betatron sources will provide a means to extend their application base to include single-shot dynamical measurements of ultrafast processes or dense materials. Recent advances in laser technology used in such experiments have enabled increases in shot-rate and system stability, providing improved statistical analysis and detailed parameter scans. However, unique challenges exist at high repetition rate, where data throughput and source optimization are now limited by diagnostic acquisition rates and analysis. Here, we present the development of a machine-learning algorithm for the real-time analysis of betatron radiation. We report on the fielding of this deep learning algorithm for online source characterization at the Institut National de la Recherche Scientifique's Advanced Laser Light Source. By fine-tuning an algorithm originally trained on a fully synthetic dataset using a subset of experimental data, the algorithm can predict the betatron critical energy with a percent error of 7.2 % with a reconstruction time of 1.5 ms, providing a valuable tool for real-time, multi-objective optimization at HRR.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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↗

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↗

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↗

Blazing Signature Filter: a library for fast pairwise similarity comparisons

Identifying similarities between datasets is a fundamental task in data mining and has become an integral part of modern scientific investigation. Whether the task is to identify co-expressed genes in large-scale expression surveys or to predict combinations of gene knockouts which would elicit a similar phenotype, the underlying computational task is often a multi-dimensional similarity test. As datasets continue to grow, improvements to the efficiency, sensitivity or specificity of such computation will have broad impacts as it allows scientists to more completely explore the wealth of scientific data. A significant practical drawback of large-scale data mining is the vast majority of pairwise comparisons are unlikely to be relevant, meaning that they do not share a signature of interest. It is therefore essential to efficiently identify these unproductive comparisons as rapidly as possible and exclude them from more time-intensive similarity calculations. The Blazing Signature Filter (BSF) is a highly efficient pairwise similarity algorithm which enables extensive data mining within a reasonable amount of time. The algorithm transforms datasets into binary metrics, allowing it to utilize the computationally efficient bit operators and provide a coarse measure of similarity. As a result, the BSF can scale to high dimensionality and rapidly filter unproductive pairwise comparison. Furthermore, two bioinformatics applications of the tool are presented to demonstrate the ability to scale to billions of pairwise comparisons and the usefulness of this approach.

59 BASIC BIOLOGICAL SCIENCES↗

PSLQ: An Algorithm to Discover Integer Relations

Let x = (x{sub 1}, x{sub 2} {hor_ellipsis}, x{sub n}) be a vector of real or complex numbers. x is said to possess an integer relation if there exist integers a{sub i}, not all zero, such that a{sub 1}x{sub 1} + a{sub 2}x{sub 2} + {hor_ellipsis} + a{sub n}x{sub n} = 0. By an integer relation algorithm, we mean a practical computational scheme that can recover the vector of integers ai, if it exists, or can produce bounds within which no integer relation exists. As we will see in the examples below, an integer relation algorithm can be used to recognize a computed constant in terms of a formula involving known constants, or to discover an underlying relation between quantities that can be computed to high precision. At the present time, the most effective algorithm for integer relation detection is the 'PSLQ' algorithm of mathematician-sculptor Helaman Ferguson [10, 4]. Some efficient 'multi-level' implementations of PSLQ, as well as a variant of PSLQ that is well-suited for highly parallel computer systems, are given in [4]. PSLQ constructs a sequence of integer-valued matrices B{sub n} that reduces the vector y = xB{sub n}, until either the relation is found (as one of the columns of B{sub n}), or else precision is exhausted. At the same time, PSLQ generates a steadily growing bound on the size of any possible relation. When a relation is found, the size of smallest entry of the vector y abruptly drops to roughly 'epsilon' (i.e. 10{sup -p}, where p is the number of digits of precision). The size of this drop can be viewed as a 'confidence level' that the relation is real and not merely a numerical artifact - a drop of 20 or more orders of magnitude almost always indicates a real relation. Very high precision arithmetic must be used in PSLQ. If one wishes to recover a relation of length n, with coefficients of maximum size d digits, then the input vector x must be specified to at least nd digits, and one must employ nd-digit floating-point arithmetic. Maple and Mathematica include multiple precision arithmetic facilities and Maple ships with a full implementation of PSLQ. One may also use any of several freeware multiprecision software packages, for example the ARPREC package by the first author and colleagues at LBNL [7]. In the remaining sections we describe various representative applications of PSLQ. More detail about these examples is given in [8] and the references therein.

97 MATHEMATICS AND COMPUTING↗

A fast and memory-sparing probabilistic selection algorithm for the GPU

A fast and memory-sparing probabilistic top-N selection algorithm is implemented on the GPU. This probabilistic algorithm gives a deterministic result and always terminates. The use of randomization reduces the amount of data that needs heavy processing, and so reduces both the memory requirements and the average time required for the algorithm. This algorithm is well-suited to more general parallel processors with multiple layers of memory hierarchy. Probabilistic Las Vegas algorithms of this kind are a form of stochastic optimization and can be especially useful for processors having a limited amount of fast memory available.

99 GENERAL AND MISCELLANEOUS↗

Leveraging Randomized Compiling for the QITE Algorithm

The success of the current generation of Noisy Intermediate-Scale Quantum (NISQ) hardware shows that quantum hardware may be able to tackle complex problems even without error correction. One outstanding issue is that of coherent errors arising from the increased complexity of these devices. These errors can accumulate through a circuit, making their impact on algorithms hard to predict and mitigate. Iterative algorithms like Quantum Imaginary Time Evolution are susceptible to these errors. This article presents the combination of both noise tailoring using Randomized Compiling and error mitigation with a purification. We also show that Cycle Benchmarking gives an estimate of the reliability of the purification. We apply this method to the Quantum Imaginary Time Evolution of a Transverse Field Ising Model and report an energy estimation and a ground state infidelity both below 1\%. Our methodology is general and can be used for other algorithms and platforms. We show how combining noise tailoring and error mitigation will push forward the performance of NISQ devices.

Ville, Jean-Loup↗

Iterative and Self-Consistent Estimation of Degradation and Soiling Loss in PV Systems - A Case Study

In many parts of the world, soiling is a significant loss mechanism for PV energy production. Methods for accurately quantifying historical and current soiling losses are needed. Furthermore, state-of-the-art methods to estimate degradation rates based on production data do not handle soiling in a satisfactory manner. In order to accurately estimate either of these quantities, it is in many cases helpful to consider their combined effect on PV system performance. In this work we make use of the Combined Degradation and Soiling (CODS) algorithm, which iteratively decomposes time series of daily normalized energy yield into four components: a soiling ratio, a degradation trend, seasonal variations, and noise. We demonstrate the use of the model on field performance data from a utility-scale power plant in a high-soiling environment in the Middle East. We apply the algorithm to the temperature-corrected performance index of the DC power on inverter level, quantifying how soiling varies over time and through the plant. The irradiation-weighted average soiling loss in this plant is 2.3 %, with a median soiling rate of -0.086 %/day. Between the inverters in the site in study, estimated degradation rates range between -0.86 %/year and -0.15 %/year, with a mean rate of -0.48 %/year.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Design and simulation of the snowflake divertor control for NSTX-U

This study presents the development of a physics-based multiple-input-multiple-output algorithm for real-time feedback control of snowflake divertor (SFD) configurations on the National Spherical Torus eXperiment Upgrade (NSTX-U). A model of the SFD configuration response to applied voltages on the divertor control coils is first derived and then used, in conjunction with multivariable control synthesis techniques, to design an optimal state feedback controller for the configuration. To demonstrate the capabilities of the controller, a nonlinear simulator for axisymmetric shape control was developed for NSTX-U which simultaneously evolves the currents in poloidal field coils based upon a set of feedback-computed voltage commands, calculates the induced currents in passive conducting structures, and updates the plasma equilibrium by solving the free-boundary Grad-Shafranov problem. Closed-loop simulations demonstrate that the algorithm enables controlled operations in a variety of SFD configurations and provides capabilities for accurate tracking of time-dependent target trajectories for the divertor geometry. In particular, simulation results suggest that a time-varying controller which can properly account for the evolving SFD dynamical response is not only desirable but necessary for achieving acceptable control performance. The algorithm presented in this paper has been implemented in the NSTX-U Plasma Control System in preparation for future control and divertor physics experiments.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Design and simulation of the snowflake divertor control for NSTX-U

This paper presents the development of a physics-based multiple-input-multiple-output algorithm for real-time feedback control of snowflake divertor (SFD) configurations on the National Spherical Torus eXperiment Upgrade (NSTX-U). A model of the SFD configuration response to applied voltages on the divertor control coils is first derived and then used, in conjunction with multivariable control synthesis techniques, to design an optimal state feedback controller for the configuration. To demonstrate the capabilities of the controller, a nonlinear simulator for axisymmetric shape control was developed for NSTX-U which simultaneously evolves the currents in poloidal field coils based upon a set of feedback-computed voltage commands, calculates the induced currents in passive conducting structures, and updates the plasma equilibrium by solving the free-boundary Grad-Shafranov problem. Closed-loop simulations demonstrate that the algorithm enables controlled operations in a variety of SFD configurations and provides capabilities for accurate tracking of time-dependent target trajectories for the divertor geometry. In particular, simulation results suggest that a time-varying controller which can properly account for the evolving SFD dynamical response is not only desirable but necessary for achieving acceptable control performance. The algorithm presented in this paper has been implemented in the NSTX-U Plasma Control System in preparation for future control and divertor physics experiments.

snowflake divertor, MIMO feedback control, nonline↗

RESOLVING THE ELECTROCHEMICAL EQUATIONS OF A SOLID OXIDE FUEL CELL FOR USE IN TRANSIENT SIMULATION AND INTEGRATION INTO CYBER-PHYSICAL SYSTEMS

A major challenge with complex cyber-physical systems stems from long model computational time that creates a mismatch between the model system and the physical system. The numerical modeling of solid oxide fuel cells (SOFCs) presents particular challenges due to the highly coupled nature of the underlying equations and the multiphysics needed to fully resolve their behavior during a transient event. To this end current approaches revolve around splitting the computational efforts into resolving temperature effects and resolving electrochemical effects. Current methods employed for the transient simulation of an SOFC for implementation in the Hybrid Performance (HyPer) facility cyberphysical plant at the National Energy Technology Laboratory reveal a distinct need for accelerated results with a high degree of stability. To this aim, an investigation into the computational time for the code reveals that the underlying electrochemical algorithm takes an order of magnitude more time than its thermal counterpart and has a tendency to vary in terms of iteration time and as such a rework of the underlying system is proposed. The primary method for accelerated electrochemical algorithm solutions is to employ higher order root finding recipes for the resolution of the highly coupled electrochemical equations. This is done with the intention to reduce the overall number of subiterations necessary for resolving voltage, current density, and species concentration, properties of the fuel cell that are all directly coupled and require nested iterative approaches. The overall objective of this approach is an order of magnitude reduction in calculation time without sacrificing stability and increasing accuracy. Specific approaches involve using both bounded and unbounded techniques, such as the False Position method and the Secant method (or if applicable Newton-Raphson) respectively, the drawbacks being slower convergence for False Position and instability for the Secant or Newton-Raphson methods. Current preliminary results on simplified versions of the parent functions involved for electrochemical calculations indicate a reduction in computational steps by a factor of two for the secant method and a factor of three for Newton-Raphson. When implemented into new modified electrochemical algorithms, the results indicate a possible order of magnitude reduction in calculation time.

Arias, Jesus↗