Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm development”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Efficient fully-coherent quantum signal processing algorithms for real-time dynamics simulation

Simulating the unitary dynamics of a quantum system is a fundamental problem of quantum mechanics, in which quantum computers are believed to have significant advantage over their classical counterparts. One prominent such instance is the simulation of electronic dynamics, which plays an essential role in chemical reactions, non-equilibrium dynamics, and material design. These systems are time-dependent, which requires that the corresponding simulation algorithm can be successfully concatenated with itself over different time intervals to reproduce the overall coherent quantum dynamics of the system. In this paper, we quantify such simulation algorithms by the property of being fully-coherent: the algorithm succeeds with arbitrarily high success probability 1 − δ while only requiring a single copy of the initial state. Here we subsequently develop fully-coherent simulation algorithms based on quantum signal processing (QSP), including a novel algorithm that circumvents the use of amplitude amplification while also achieving a query complexity additive in time t, ln(1/δ), and ln(1/ϵ) for error tolerance ϵ: $Θ‖\mathscr{H}‖|t|+ln(1/ϵ)+ln(1/δ)$. Furthermore, we numerically analyze these algorithms by applying them to the simulation of the spin dynamics of the Heisenberg model and the correlated electronic dynamics of an H2 molecule. Since any electronic Hamiltonian can be mapped to a spin Hamiltonian, our algorithm can efficiently simulate time-dependent ab initio electronic dynamics in the circuit model of quantum computation. Accordingly, it is also our hope that the present work serves as a bridge between QSP-based quantum algorithms and chemical dynamics, stimulating a cross-fertilization between these exciting fields.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Compensating attenuation effects in full-waveform inversion with dissipation-dispersion decoupling

Seismic attenuation poses challenges to velocity model building from acoustic/elastic full-waveform inversion (FWI). In particular, when constructing the FWI gradient for velocity inversion, recent studies have indicated that the high-attenuation structure could distort the gradient by damping the amplitudes and shifting the kinematic phases, resulting in an imbalanced update and thus unreliable velocity model. These Q effects are particularly significant in the reflection acquisition geometry due to the “double-damping” issue. Here, we develop a Q-compensated FWI algorithm for constructing a Q-free FWI gradient. By using a recently developed viscoacoustic wave propagator, this compensation can be done conveniently by keeping the dispersion term and flipping the dissipation term in the wave equation when we simulate the forward and time-reversed adjoint wavefields. The resultant gradient obtained by interacting these two wavefields has correct kinematics and Q-free amplitudes. This Q-compensated FWI can balance the update between Q- and no- Q-areas, which we determine using synthetic examples. In addition, we illustrate how to take advantage of the dissipation-dispersion decoupling to determine the anomalous Q value in the Q model building workflow via Q-compensated reverse time migration.

Geochemistry & Geophysics↗
DOE OSTI2024

Multiparticle cumulant mapping for Coulomb explosion imaging: Calculations and algorithm

We present a versatile cumulant mapping algorithm for analyzing correlated particle emission, offering insights into complex electronic and nuclear dynamics. Recently, we have demonstrated the use of cumulant mapping to extract information-rich correlations between the momenta of multiple fragments produced in Coulomb explosion imaging experiments [C. Cheng et al., Phys. Rev. Lett. 130, 093001 (2023)]. We define cumulant mapping in terms of histograms, enabling fast computation of linear (additive) observables. However, applying the same algorithm to nonlinear (nonadditive) observables poses challenges, as the computation time of conventional estimators scales nonlinearly with data size. To overcome this, we develop estimators and an accompanying algorithm to enable computationally efficient estimation of the cumulant of interest. Comparisons of computation times and signal-to-noise ratios reveal the superior performance of our approach. This method is demonstrated on the (D+, D+, C+, O+) dissociation channel of CD 2 ⁢O 4+ produced in a strong-field ionization experiment. Additionally, Poisson statistics are used to simulate the two methods and provide insights into the efficiency of our algorithm. The proposed methodology unlocks efficient computation of cumulant mapping for a broader range of complex systems and observables, such as the laser pulse dependence of ionization dynamics.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2022

Real-Time Distribution System State Estimation with Asynchronous Measurements

We report state estimation is a fundamental task in power systems. Although distribution systems are increasingly equipped with sensing devices and smart meters, measurements are typically reported at different rates and asynchronously; these aspects pose severe strains on workhorse state estimation algorithms, which are designed to process batches of data collected in a synchronous manner from all the measurement units. In this paper, we develop a novel state estimation algorithm to continuously update the estimate of the state based on measurements received in an asynchronous manner from measurement units. The synthesis of the algorithm hinges on a proximal-point type method, implemented in an online fashion, and capable of processing measurements received sequentially from sensors. A performance analysis is presented by providing bounds on the estimation error in terms of the mean and variance that hold at each iteration and asymptotically. The scheme is also compared with a more traditional Weighted Least Squares estimator that compensates for the lack of measurement data by using, as pseudo measurements, the measurement retrieved during a certain time window. Numerical simulations on the IEEE 37-bus feeder corroborate the analytical findings.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Data for training and testing radiation detection algorithms in an urban environment

The detection, identification, and localization of illicit nuclear materials in urban environments is of utmost importance for national security. Most often, the process of performing these operations consists of a team of trained individuals equipped with radiation detection devices that have built-in algorithms to alert the user to the presence nuclear material and, if possible, to identify the type of nuclear material present. To encourage the development of new detection, radioisotope identification, and source localization algorithms, a dataset consisting of realistic Monte Carlo-simulated radiation detection data from a 2 in. × 4 in. × 16 in. NaI(Tl) scintillation detector moving through a simulated urban environment based on Knoxville, Tennessee, was developed and made public in the form of a Topcoder competition. The methodology used to create this dataset has been verified using experimental data collected at the Fort Indiantown Gap National Guard facility. Realistic signals from special nuclear material and industrial and medical sources are included in the data for developing and testing algorithms in a dynamic real-world background.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
DOE OSTI2020

Real-Time Federated Cyber-Transmission-Distribution Testbed Architecture for the Resiliency Analysis

With the ongoing automation driven by the push toward the smart electric grid and the advancement in associated cyber infrastructure, the interaction between physical [electric transmission and distribution (T&D) systems], cyber (communication, automation, and control), and human (grid operators and decision-makers) is increasingly becoming more complex. This creates the requirement of analyzing the effect of the transmission system on the distribution system and vice versa with consideration of the additional complexity of the cyber infrastructure. Such an integrated testbed will also help with resiliency analysis, where resiliency refers to the ability of the system to continue serving energy to the critical loads even with limited extreme contingencies. Interaction of the physical power grid with the cyber layer can be effectively modeled using real-time (RT) simulator for developing and validating various operational and control algorithms. Testbeds using RT simulators with multiple capabilities have been developed at different institutions. Still, no single existing testbed can offer full scalability while simultaneously meeting high fidelity requirements for resiliency experimentation. Co-simulating federated testbed assets can provide a scalable experimentation platform that can be leveraged for verification and validation. In this article, an architecture is developed for federated cyber-physical testbed. A local federation with two real-time simulators is developed: real-time digital simulator (RTDS) and OPAL-RT have been interfaced using VILLAS framework for end-to-end testing. Also, a real-time linear predictor is developed and integrated here to address the communication latency impact on geographically allocated federated RT simulation. Finally, resiliency analysis tools are formulated and utilized for T&D systems. Finally as an illustrative use case, the resiliency of a T&D test system is simulated, and the results are analyzed. A 179-bus Western Electricity Coordinating Council (WECC) transmission system is developed using OPAL-RT/ HYPERSIM, and a modified IEEE 13 node feeder system is modeled in RTDS/RSCAD and interfaced for resiliency analysis.

42 ENGINEERING↗
DOE OSTI2023

Review of machine learning and deep learning models for toxicity prediction

The ever-increasing number of chemicals has raised public concerns due to their adverse effects on human health and the environment. To protect public health and the environment, it is critical to assess the toxicity of these chemicals. Traditional in vitro and in vivo toxicity assays are complicated, costly, and time-consuming and may face ethical issues. These constraints raise the need for alternative methods for assessing the toxicity of chemicals. Recently, due to the advancement of machine learning algorithms and the increase in computational power, many toxicity prediction models have been developed using various machine learning and deep learning algorithms such as support vector machine, random forest, k-nearest neighbors, ensemble learning, and deep neural network. This review summarizes the machine learning- and deep learning-based toxicity prediction models developed in recent years. Support vector machine and random forest are the most popular machine learning algorithms, and hepatotoxicity, cardiotoxicity, and carcinogenicity are the frequently modeled toxicity endpoints in predictive toxicology. It is known that datasets impact model performance. The quality of datasets used in the development of toxicity prediction models using machine learning and deep learning is vital to the performance of the developed models. The different toxicity assignments for the same chemicals among different datasets of the same type of toxicity have been observed, indicating benchmarking datasets is needed for developing reliable toxicity prediction models using machine learning and deep learning algorithms. This review provides insights into current machine learning models in predictive toxicology, which are expected to promote the development and application of toxicity prediction models in the future.

Research & Experimental Medicine↗
DOE OSTI2023

TAMM: Tensor algebra for many-body methods

Tensor algebra operations such as contractions in computational chemistry consume a significant fraction of the computing time on large-scale computing platforms. The widespread use of tensor contractions between large multi-dimensional tensors in describing electronic structure theory has motivated the development of multiple tensor algebra frameworks targeting heterogeneous computing platforms. In this paper, we present Tensor Algebra for Many-body Methods (TAMM), a framework for productive and performance-portable development of scalable computational chemistry methods. TAMM decouples the specification of the computation from the execution of these operations on available high-performance computing systems. With this design choice, the scientific application developers (domain scientists) can focus on the algorithmic requirements using the tensor algebra interface provided by TAMM, whereas high-performance computing developers can direct their attention to various optimizations on the underlying constructs, such as efficient data distribution, optimized scheduling algorithms, and efficient use of intra-node resources (e.g., graphics processing units). The modular structure of TAMM allows it to support different hardware architectures and incorporate new algorithmic advances. We describe the TAMM framework and our approach to the sustainable development of scalable ground- and excited-state electronic structure methods. We present case studies highlighting the ease of use, including the performance and productivity gains compared to other frameworks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

QForte: An Efficient State-Vector Emulator and Quantum Algorithms Library for Molecular Electronic Structure

Here, we introduce a novel open-source software package QForte, a comprehensive development tool for new quantum simulation algorithms. QForte incorporates functionality for handling molecular Hamiltonians, fermionic encoding, ansatz construction, time evolution, and state-vector emulation, requiring only a classical electronic structure package as a dependency. QForte also contains black-box implementations of a wide variety of quantum algorithms, including variational and projective quantum eigensolvers, adaptive eigensolvers, quantum imaginary time evolution, and quantum Krylov methods. We highlight two features of QForte: (i) how the Python class structure of QForte enables the facile implementation of new algorithms, and (ii) how existing algorithms can be executed in just a few lines of code.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Developing a Consistent Travel-Time Framework for Comparing Three-Dimensional Velocity Models for Seismic Location Accuracy

Abstract Location algorithms have historically relied on simple, one-dimensional (1D) velocity models for fast seismic event locations. 1D models are generally used as travel-time lookup tables, one for each seismic phase, with travel-times pre-calculated for event distance and depth. These travel-time lookup tables are extremely fast to use and this fast computational speed makes them the preferred type of velocity model for operational needs. Higher-dimensional (i.e., three-dimensional—3D) seismic velocity models are becoming readily available and provide more accurate event locations over 1D models. The computational requirements of these 3D models tend to make their operational use prohibitive. Additionally, comparing location accuracy for 3D seismic velocity models tends to be problematic, as each model is determined using different ray-tracing algorithms. Attempting to use a different algorithm than the one used to develop a model usually results in poor travel-time prediction. We demonstrate and test a framework to create first-P and first-S 3D travel-time correction surfaces using an open-source framework ( PCalc + GeoTess , https://www.sandia.gov/salsa3d/software/geotess ) that easily stores 3D travel-time and uncertainty data. This framework produces fast travel-time and uncertainty predictions and overcomes the ray-tracing algorithm hurdle because the lookup tables can be generated using the exact ray-tracing algorithm that is preferred for a model.

3D velocity models↗
DOE OSTI2023

Implementation and test of an automated control hunting fault correction algorithm in a fault detection and diagnostics tool

Control hunting due to improper proportional–integral–derivative (PID) parameters in the building automation system (BAS) is one of the most common faults identified in commercial buildings. It can cause suboptimal performance and early failure of heating, ventilation, and air conditioning (HVAC) equipment. Commercial fault detection and diagnostics (FDD) software represents one of the fastest growing market segments in smart building technologies in the United States. Implementation of PID retuning procedures as an auto-correction algorithm and integration into FDD software has the potential to mitigate control hunting across a heterogeneous portfolio of buildings with different BAS in a scalable way. This paper presents the development, implementation, and field testing of an automated control hunting fault correction algorithm based on lambda tuning open-loop rules. The algorithm was developed in a commercial FDD software and successfully tested among nine variable air volume boxes in an office building in the United States. The paper shows the feasibility of using FDD tools to automatically correct control hunting faults, discusses scalability considerations, and proposes a path forward for the HVAC industry and academia to further improve this technology.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2024

Status of the Measurement of Proton Scattering on Carbon Nuclei in EMPHATIC for Neutrino Flux Uncertainty Reduction

In long-baseline neutrino oscillation experiments, Monte Carlo (MC) simulations based on hadron interactions and decays are used to predict the neutrino flux. The 10%-level systematic uncertainty of the predicted neutrino fluxes from these simulations is dominated by uncertainties in hadron interaction cross sections due to limited hadron scattering data. EMPHATIC aims to reduce the neutrino flux uncertainty by providing additional data. Using a table-top-sized spectrometer located at the Fermilab Test Beam Facility (FTBF), its physics program includes precise measurements of hadron scattering and production cross sections at various beam momenta and target species that are relevant for GeV-scale neutrino production. Using simulation, we have developed a simple single-track reconstruction algorithm that has a momentum resolution of 3-4\%. We will demonstrate the progress in developing one of EMPHATIC’s first track reconstruction algorithms – an important step in making a new single-track forward scattering measurement (p + C $\rightarrow$ p + C at several beam momenta) using Phase 1 data collected between 2022 and 2023.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Leverage Score Sampling for Parametric PDEs (Final Technical Report)

This final technical report summarizes the accomplishments of work performed under DOE Office of Science Award DE-SC0022266, which is titled “Leverage Score Sampling for Parametric PDEs”. The goal of the project was to extend methods from Randomized Numerical Linear Algebra (RandNLA) to tackle central computational challenges in model order reduction and uncertainty quantification (UQ) for parametric partial differential equations (PDEs). In particular, we sought to use importance sampling methods originally developed for RandNLA to develop sample efficient active learning algorithms for approximating high-dimensional scalar functions, e.g. by polynomials, Gaussian process models, and simple neural networks. Such methods can be immediately applied to developing surrogate models or to approximating quantity of interest (QoI) surfaces. In the context of PDEs, each sample used for learning equates to the solution of the differential equation for a particular set of parameters, so sample efficiency translates to improved computational efficiency for a variety of downstream tasks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Scalable Tensor Methods for Nonuniform Hypergraphs

While multilinear algebra appears natural for studying the multiway interactions modeled by hypergraphs, tensor methods for general hypergraphs have been stymied by theoretical and practical barriers. A recently proposed adjacency tensor is applicable to nonuniform hypergraphs, but is prohibitively costly to form and analyze in practice. We develop tensor times same vector (TTSV) algorithms for this tensor which improve complexity from $O(n^r)$ to a low-degree polynomial in $r$, where $n$ is the number of vertices and $r$ is the maximum hyperedge size. Our algorithms are implicit, avoiding formation of the order $r$ adjacency tensor. Here, we demonstrate the flexibility and utility of our approach in practice by developing tensor-based hypergraph centrality and clustering algorithms. We also show these tensor measures offer complementary information to analogous graph-reduction approaches on data, and are also able to detect higher-order structure that many existing matrix-based approaches provably cannot.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

VTK-m User's Guide (V.1.8)

Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Modular Finite Element Methods

MFEM is a free, lightweight, scalable C++ library for finite element methods. The goal of MFEM is to enable research and development of scalable finite element discretization and solver algorithms through general finite element abstractions, accurate and flexible visualization, and tight integration with the hypre library. Conceptually, MFEM can be viewed as a finite element toolbox that provides the building blocks for developing finite element algorithms in a manner similar to that of MATLAB for linear algebra methods.

ECP↗
DOE OSTI2021

An automated procedure built on MTEX for reconstructing deformation twin hierarchies from electron backscattered diffraction datasets of heavily twinned microstructures

Here we present a set of algorithms built on the MTEX and MATLAB graph toolboxes for automatic reconstruction of deformation twin hierarchies from Electron Backscatter Diffraction (EBSD) datasets with a focus on developing methods for heavily twinned microstructures (twin fractions >0.5). The algorithms address key issues arising at large strains, mainly: missing twin relationships, grouping of heavily deformed grain fragments into families of similar orientation originating from a single initial grain, identification of parent fragments for large twin volume fractions, and classification of families having twin relationships with multiple families. To facilitate the development of these algorithms, large-grained ultra-high purity α-Ti deformed in compression along two directions is investigated. Graphs are utilized to handle non-local geometric merging and to represent relationships throughout the reconstruction process. When determining if a grain fragment is from the undeformed microstructure, the combined metrics of the fragment's orientation volume fraction in the initial texture and the directed graph centrality measure of out-closeness (the number of nodes reached in a graph from a given node) are essential. To address automation in reconstructing the sequence of twinning and relating fragments originating from a single grain in the initial microstructure, the twin family tree is formulated as a minimum spanning tree emanating from the initial grain family. A scheme constructing the distances associated with twin relationship comprising the spanning tree is developed, and a novel quasi-directional Prim spanning tree algorithm is used to determine the twin family tree. The procedure is demonstrated to significantly improve the level of automation in reconstructing twin hierarchies in heavily twinned microstructure compared to other methodologies in literature. The procedure can readily be applied to analyses of twinning in metals, as well as provide an approach for routinely extracting twin statistics at larger deformation levels than previously possible. Significantly, the procedure is demonstrated to be capable of identifying third generation twinning in α-Ti microstructures.

36 MATERIALS SCIENCE↗