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,081 records · Page 60

Learning Many-Body Hamiltonians with Heisenberg-Limited Scaling

Learning a many-body Hamiltonian from its dynamics is a fundamental problem in physics. Here, in this Letter, we propose the first algorithm to achieve the Heisenberg limit for learning an interacting N-qubit local Hamiltonian. After a total evolution time of $\mathscr{O}$⁡(ε –1 ), the proposed algorithm can efficiently estimate any parameter in the N-qubit Hamiltonian to ε error with high probability. Our algorithm uses ideas from quantum simulation to decouple the unknown N-qubit Hamiltonian H into noninteracting patches and learns H using a quantum-enhanced divide-and-conquer approach. The proposed algorithm is robust against state preparation and measurement error, does not require eigenstates or thermal states, and only uses polylog⁡(ε –1 ) experiments. In contrast, the best existing algorithms require $\mathscr{O}$⁡⁡(ε –2 ) experiments and total evolution time. We prove a matching lower bound to establish the asymptotic optimality of our algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improvements on the minimax algorithm for the Laplace transformation of orbital energy denominators

We present a robust and non-heuristic algorithm that finds all extremum points of the error distribution function of numerically Laplace-transformed orbital energy denominators. The extremum point search is one of the two key steps for finding the minimax approximation. If pre-tabulation of initial guesses is supposed to be avoided, strategies for a sufficiently robust algorithm have not been discussed so far. We compare our non-heuristic approach with a bracketing and bisection algorithm and demonstrate that 3 times less function evaluations are required altogether when applying it to typical non-relativistic and relativistic quantum chemical systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Could We Apply a NeuroProcessor For Analyzing a Gas Response Of Multisensor Arrays?

We describe an effort of implementation of hardware neuroprocessor to carry out pattern recognition of signals generated by a multisensor microarray of Electronic Nose type. The multisensor microarray is designed with the SnO{sub 2} thin film segmented by co-planar electrodes according to KAMINA (KArlsruhe Micro NAse) E-nose architecture. The response of this microarray to reducing gases mixtured with a synthetic air is processed by principal component analysis technique realized in PC (Matlab software) and the neural microprocessor NeuroMatrix NM6403. It is shown that the neuroprocessor is able to successfully carry out a gas-recognition algorithm at a real-time scale.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Parallel State Estimation Assessment with Practical Data

This paper presents a full-cycle parallel state estimation (PSE) implementation using a preconditioned conjugate gradient algorithm. The developed code is able to solve large-size power system state estimation within 5 seconds using real-world data, comparable to the Supervisory Control And Data Acquisition (SCADA) rate. This achievement allows the operators to know the system status much faster to help improve grid reliability. Case study results of the Bonneville Power Administration (BPA) system with real measurements are presented. The benefits of fast state estimation are also discussed.

State Estimation, Preconditioned Conjugate Gradien↗

Performance evaluation of cosmic ray muon trajectory estimation algorithms

Muons, being elementary particles with minimal interaction with nuclear materials and abundant at sea level, have sparked interest in utilizing them for imaging various applications, such as mining [Borselli et al., Sci. Rep. 12, 22329 (2022)], volcano imaging [Nagamine et al., Nucl. Instrum. Meth. A, 356, 585(1995)], and underground tunnel detection [Guardincerri et al., Pure Appl. Geophys. 174, 2133 (2017)]. Recently, their use in nuclear nonproliferation and safeguard verification has gained attention, particularly in cargo screening for nuclear waste smuggling [Baesso et al., J. Instrum. 9, C10041 (2014)], source localization [L. J. Schultz et al., Nucl. Instrum. Meth. A 519, 687 (2004)], and locating nuclear fuel debris in reactors [Borozdin et al., Phys. Rev. Let. 109, 152501 (2012)]. However, the resolution of muon image reconstruction techniques is limited due to multiple Coulomb scattering (MCS) within the target object. To achieve robust muon tomography, it is crucial to develop efficient and flexible physics-based algorithms that can model the MCS process accurately and estimate the most probable trajectory of muons as they pass through the target object. To address this limitation, in this study, a novel algorithmic approach utilizing the Bayesian probability theory and Gaussian approximation of MCS is chosen. Different energy levels, materials, and target sizes were considered in the evaluations. The results demonstrate that the Generalized Muon Trajectory Estimation (GMTE) algorithm offers significant improvements over currently used algorithms. Across all test scenarios, the GMTE algorithm demonstrated ~50% and 38% increase in precision compared to Straight Line Path (SLP) and Point of Closest Approach (PoCA) algorithms, respectively. Furthermore, it exhibited 10%–35% and 10%–15% increases in muon flux utilization for high and medium Z materials, respectively, compared to the PoCA algorithm. In conclusion, the extensive simulations confirm the enhanced performance and efficiency of the GMTE algorithm, offering improved resolution and reduced measurement time for cosmic ray muon imaging compared to the current SLP and PoCA algorithms.

79 ASTRONOMY AND ASTROPHYSICS↗

A NEW ALGORITHM FOR SELF-CONSISTENT THREE-DIMENSIONAL MODELING OF COLLISIONS IN DUSTY DEBRIS DISKS

We present a new 'collisional grooming' algorithm that enables us to model images of debris disks where the collision time is less than the Poynting-Robertson (PR) time for the dominant grain size. Our algorithm uses the output of a collisionless disk simulation to iteratively solve the mass flux equation for the density distribution of a collisional disk containing planets in three dimensions. The algorithm can be run on a single processor in approx1 hr. Our preliminary models of disks with resonant ring structures caused by terrestrial mass planets show that the collision rate for background particles in a ring structure is enhanced by a factor of a few compared to the rest of the disk, and that dust grains in or near resonance have even higher collision rates. We show how collisions can alter the morphology of a resonant ring structure by reducing the sharpness of a resonant ring's inner edge and by smearing out azimuthal structure. We implement a simple prescription for particle fragmentation and show how PR drag and fragmentation sort particles by size, producing smaller dust grains at smaller circumstellar distances. This mechanism could cause a disk to look different at different wavelengths, and may explain the warm component of dust interior to Fomalhaut's outer dust ring seen in the resolved 24 mum Spitzer image of this system.

79 ASTRONOMY AND ASTROPHYSICS↗

Quantum Algorithm for Linear Non-unitary Dynamics with Near-Optimal Dependence on All Parameters

We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially enhance the accuracy of the recently introduced linear combination of Hamiltonian simulation (LCHS) method [An, Liu, and Lin, Physical Review Letters, 2023]. For the first time, this approach enables quantum algorithms to solve linear differential equations with both optimal state preparation cost and near-optimal scaling in matrix queries on all parameters.

Applied Dynamical Systems↗

Advance Resource Provisioning in Bulk Data Scheduling

Today?s scientific and business applications generate mas- sive data sets that need to be transferred to remote sites for sharing, processing, and long term storage. Because of increasing data volumes and enhancement in current net- work technology that provide on-demand high-speed data access between collaborating institutions, data handling and scheduling problems have reached a new scale. In this paper, we present a new data scheduling model with ad- vance resource provisioning, in which data movement operations are defined with earliest start and latest comple- tion times. We analyze time-dependent resource assign- ment problem, and propose a new methodology to improve the current systems by allowing researchers and higher-level meta-schedulers to use data-placement as-a-service, so they can plan ahead and submit transfer requests in advance. In general, scheduling with time and resource conflicts is NP-hard. We introduce an efficient algorithm to organize multiple requests on the fly, while satisfying users? time and resource constraints. We successfully tested our algorithm in a simple benchmark simulator that we have developed, and demonstrated its performance with initial test results.

97 MATHEMATICS AND COMPUTING↗

Understanding kinetics of defect annihilation in chemoepitaxy-directed self-assembly.

Directed self-assembly (DSA) of block copolymers (BCP) has attracted considerable interest from the semiconductor industry because it can achieve semiconductor-relevant structures with a relatively simple process and low cost. However, the self-assembling structures can become kinetically trapped into defective states, which greatly impedes the implementation of DSA in high-volume manufacturing. Understanding the kinetics of defect annihilation is crucial to optimizing the process and eventually eliminating defects in DSA. Such kinetic experiments, however, are not commonly available in academic laboratories. To address this challenge, we perform a kinetic study of chemoepitaxy DSA in a 300 mm wafer fab, where the complete defectivity information at various annealing conditions can be readily captured. Through extensive statistical analysis, we reveal the statistical model of defect annihilation in DSA for the first time. The annihilation kinetics can be well described by a power law model, indicating that all dislocations can be removed by sufficiently long annealing time. We further develop image analysis algorithms to analyze the distribution of dislocation size and configurations and discover that the distribution stays relatively constant over time. The defect distribution is determined by the role of the guiding stripe, which is found to stabilize the defects. Although this study is based on polystyrene-b-poly(methyl methacrylate) (PS-b-PMMA), we anticipate that these findings can be readily applied to other BCP platforms as well.

block copolymer↗

Fixed Depth Hamiltonian Simulation via Cartan Decomposition

Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize limited quantum resources remains an open problem. In this study, we tackle this problem by presenting a constructive algorithm, based on Cartan decomposition of the Lie algebra generated by the Hamiltonian, which generates quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one-dimensional transverse field $\mathrm{XY}$ model, where $\mathscr{O}$(n 2 )-gate circuits naturally emerge. Compared to product formulas with significantly larger gate counts, our algorithm drastically improves simulation precision. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computational algebraic geometry for statistical modeling FY09Q2 progress.

This is a progress report on polynomial system solving for statistical modeling. This is a progress report on polynomial system solving for statistical modeling. This quarter we have developed our first model of shock response data and an algorithm for identifying the chamber cone containing a polynomial system in n variables with n+k terms within polynomial time - a significant improvement over previous algorithms, all having exponential worst-case complexity. We have implemented and verified the chamber cone algorithm for n+3 and are working to extend the implementation to handle arbitrary k. Later sections of this report explain chamber cones in more detail; the next section provides an overview of the project and how the current progress fits into it.

99 GENERAL AND MISCELLANEOUS↗

Multimessenger Gamma-Ray and Neutrino Coincidence Alerts Using HAWC and IceCube Subthreshold Data

The High Altitude Water Cerenkov (HAWC) and IceCube observatories, through the Astrophysical Multimessenger Observatory Network (AMON) framework, have developed a multimessenger joint search for extragalactic astrophysical sources. This analysis looks for sources that emit both cosmic neutrinos and gamma rays that are produced in photohadronic or hadronic interactions. The AMON system is running continuously, receiving subthreshold data (i.e., data that are not suited on their own to do astrophysical searches) from HAWC and IceCube, and combining them in real time. Here we present the analysis algorithm, as well as results from archival data collected between 2015 June and 2018 August, with a total live time of 3.0 yr. During this period we found two coincident events that have a false-alarm rate (FAR) of <1 coincidence yr -1 , consistent with the background expectations. The real-time implementation of the analysis in the AMON system began on 2019 November 20 and issues alerts to the community through the Gamma-ray Coordinates Network with an FAR threshold of <4 coincidences yr -1 .

79 ASTRONOMY AND ASTROPHYSICS↗

Thermal Radiation Transport with Tensor Trains

We present a novel tensor network algorithm to solve the time-dependent, gray thermal radiation transport equation. The method invokes a tensor train (TT) decomposition for the specific intensity. The efficiency of this approach is dictated by the rank of the decomposition. When the solution is “low rank,” the memory footprint of the specific intensity solution vector may be significantly compressed. The algorithm, following a step-then-truncate approach of a traditional discrete ordinates method, operates directly on the compressed state vector, thereby enabling large speedups for low-rank solutions. To achieve these speedups, we rely on a recently developed rounding approach based on the Gram-SVD. We detail how familiar S N algorithms for (gray) thermal transport can be mapped to this TT framework and present several numerical examples testing both the optically thick and thin regimes. The TT framework finds low-rank structure and supplies up to ≃60× speedups and ≃1000× compressions for problems demanding large angle counts, thereby enabling previously intractable SN calculations and supplying a promising avenue to mitigate ray effects.

79 ASTRONOMY AND ASTROPHYSICS↗

Solving reaction dynamics with quantum computing algorithms

The description of quantum many-body dynamics is extremely challenging on classical computers, as it can involve many degrees of freedom. However, the time evolution of quantum states is a natural application for quantum computers that are designed to efficiently perform unitary transformations. Here, in this paper, we study quantum algorithms for response functions, relevant for describing different reactions governed by linear response. We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations. For the case of a contact interaction, we develop an algorithm for time evolution based on the Trotter approximation that scales logarithmically with the lattice size and is combined with quantum phase estimation. We eventually focus on the nuclear two-body system and a typical response function relevant for electron scattering as an example. We also investigate ground-state preparation and examine the total circuit depth required for a realistic calculation and the hardware noise level required to interpret the signal.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Safety-assured, real-time neural active fault management for resilient microgrids integration

Federated-learning-based active fault management (AFM) is devised to achieve real-time safety assurance for microgrids and the main grid during faults. AFM was originally formulated as a distributed optimization problem. Here, federated learning is used to train each microgrid's network with training data achieved from distributed optimization. The main contribution of this work is to replace the optimization-based AFM control algorithm with a learning-based AFM control algorithm. The replacement transfers computation from online to offline. With this replacement, the control algorithm can meet real-time requirements for a system with dozens of microgrids. By contrast, distributed-optimization-based fault management can output reference values fast enough for a system with several microgrids. More microgrids, however, lead to more computation time with optimization-based method. Distributed-optimization-based fault management would fail real-time requirements for a system with dozens of microgrids. Controller hardware-in-the-loop real-time simulations demonstrate that learning-based AFM can output reference values within 10 ms irrespective of the number of microgrids.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Large Deviations Anomaly Detection (LAD) for collection of multivariate time series data: Applications to COVID-19 data

Time series anomaly detection is frequently used to identify extreme behaviors within a single time series. Identifying extreme trends in relation to a collection of other time series, on the other hand, is frequently of significant interest, such as in public health policy, social justice, and pandemic propagation. Using concepts from large deviations theory , we propose an algorithm that can scale to large collections of time series data. This paper expands on the LAD algorithm presented in Guggilam et al. (2022). The proposed algorithm is an online anomaly detection method for identifying anomalies in a collection of multivariate time series that takes advantage of the algorithm’s ability to scale to high-dimensional data. We show how the proposed Large Deviations Anomaly Detection (LAD) algorithm can be used to identify regions with anomalous trends in COVID-19 cases, deaths, biweekly growth rates, vaccinations, and fatality rates. Several of the observed anomalous trends are associated with regions that have demonstrated poor response to the COVID pandemic.

97 MATHEMATICS AND COMPUTING↗

Fast Quasi-Static Time-Series (QSTS) for yearlong PV impact studies using vector quantization

The rapidly growing penetration levels of distributed photovoltaic (PV) systems requires more comprehensive studies to understand their impact on distribution feeders. IEEE P.1547 highlights the need for Quasi-Static Time Series (QSTS) simulation in conducting distribution impact studies for distributed resource interconnection. Unlike conventional scenario-based simulation, the time series simulation can realistically assess time-dependent impacts such as the operation of various controllable elements (e.g. voltage regulating tap changers) or impacts of power fluctuations. However, QSTS simulations are still not widely used in the industry because of the computational burden associated with running yearlong simulations at a 1-s granularity, which is needed to capture device controller effects responding to PV variability. This study presents a novel algorithm that reduces the number of times that the non-linear 3-phase unbalanced AC power flow must be solved by storing and reassigning power flow solutions as it progresses through the simulation. Each unique power flow solution is defined by a set of factors affecting the solution that can easily be queried. We demonstrate a computational time reduction of 98.9% for a yearlong simulation at 1-s resolution with minimal errors for metrics including: number of tap changes, capacitor actions, highest and lowest voltage on the feeder, line losses, and ANSI voltage violations. Finally, the key contribution of this work is the formulation of an algorithm capable of: (i) drastically reducing the computational time of QSTS simulations, (ii) accurately modeling distribution system voltage-control elements with hysteresis, and (iii) efficiently compressing result time series data for post-simulation analysis.

14 SOLAR ENERGY↗

Single-particle digitization strategy for quantum computation of a Φ 4 scalar field theory

Motivated by the parton picture of high-energy quantum chromodynamics, we develop a single-particle digitization strategy for the efficient quantum simulation of relativistic scattering processes in a d + 1-dimensional scalar Φ 4 field theory. Here, we work out quantum algorithms for initial state preparation, time evolution, and final state measurements. We outline a nonperturbative renormalization strategy in this single-particle framework.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗