Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational tractability”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Output-weighted sampling for multi-armed bandits with extreme payoffs

We present a new type of acquisition function for online decision-making in multi-armed and contextual bandit problems with extreme payoffs. Specifically, we model the payoff function as a Gaussian process and formulate a novel type of upper confidence bound acquisition function that guides exploration towards the bandits that are deemed most relevant according to the variability of the observed rewards. This is achieved by computing a tractable likelihood ratio that quantifies the importance of the output relative to the inputs and essentially acts as an attention mechanism that promotes exploration of extreme rewards. Our formulation is supported by asymptotic zero-regret guarantees, and its performance is demonstrated across several synthetic benchmarks, as well as two realistic examples involving noisy sensor network data. Finally, we provide a JAX library for efficient bandit optimization using Gaussian processes.

Science & Technology - Other Topics↗
DOE OSTI2020

Quantum Machine Learning in High Energy Physics

Machine learning has been used in high energy physics for a long time, primarily at the analysis level with supervised classification. Quantum computing was postulated in the early 1980s as way to perform computations that would not be tractable with a classical computer. With the advent of noisy intermediate-scale quantum computing devices, more quantum algorithms are being developed with the aim at exploiting the capacity of the hardware for machine learning applications. An interesting question is whether there are ways to apply quantum machine learning to High Energy Physics. This paper reviews the first generation of ideas that use quantum machine learning on problems in high energy physics and provide an outlook on future applications.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

A Many-Body Perturbation Theory Approach to Energy Band Alignment at the Crystalline Tetracene–Silicon Interface

Hybrid inorganic–organic semiconductor (HIOS) interfaces are of interest for new photovoltaic devices operating above the Shockley–Queisser limit. Predicting energy band alignment at the interfaces is crucial for their design, but represents a challenging problem due to the large scales of the system, the energy precision required and a wide range of physical phenomena that occur at the interface. To tackle this problem, many-body perturbation theory in the non-self-consistent GW approximation, orbital relaxation corrections for organic semiconductors, and line-up potential method for inorganic semiconductors which allows for tractable and accurate computing of energy band alignment in crystalline van-der-Waals hybrid inorganic–organic semiconductor interfaces are used. In this work, crystalline tetracene physisorbed on the clean hydrogen-passivated 1 × 2 reconstructed (100) silicon surface is studied. Using this computational approach, it is found that the energy band alignment is determined by an interplay of the mutual dynamic dielectric screening of two materials and the formation of a dipole layer due to a weak hybridization of atomic/molecular orbitals at the interface. The significant role of the exchange-correlation effects in predicting band offsets for the hybrid inorganic–organic semiconductor interfaces is also emphasized.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2020

Averaged invariants in storage rings with synchrotron motion

In an ideal accelerator, the single-particle dynamics can be decoupled into transverse motion—the betatron oscillations— and longitudinal motion—the synchrotron oscillations. Chromatic and dispersive effects introduce a coupling between these dynamics, the so-called synchro-betatron coupling. We present an analysis of the fully coupled dynamics over a single synchrotron oscillation that leads to an averaged invariant with synchro-betatron coupling in a generic lattice. Here, we apply this analysis to two problems: first, a toy lattice where the computations are analytically tractable, then a design for a rapid cycling synchrotron built using the integrable optics described by Danilov and Nagaitsev, showing that although there is fairly complex behavior over the course of a synchrotron oscillation, the Danilov-Nagaitsev invariants are nevertheless periodic with the synchrotron motion.

43 PARTICLE ACCELERATORS↗
DOE OSTI2021

HIRM v1.0: a hybrid impulse response model for climate modeling and uncertainty analyses

Simple climate models (SCMs) are frequently used in research and decision-making communities because of their flexibility, tractability, and low computational cost. SCMs can be idealized, flexibly representing major climate dynamics as impulse response functions, or process-based, using explicit equations to model possibly nonlinear climate and Earth system dynamics. Each of these approaches has strengths and limitations. Here we present and test a hybrid impulse response modeling framework (HIRM) that combines the strengths of process-based SCMs in an idealized impulse response model, with HIRM's input derived from the output of a process-based model. This structure enables the model to capture some of the major nonlinear dynamics that occur in complex climate models as greenhouse gas emissions transform to atmospheric concentration to radiative forcing to climate change. As a test, the HIRM framework was configured to emulate the total temperature of the simple climate model Hector 2.0 under the four Representative Concentration Pathways and the temperature response of an abrupt 4 times CO 2 concentration step. HIRM was able to reproduce near-term and long-term Hector global temperature with a high degree of fidelity. Additionally, we conducted two case studies to demonstrate potential applications for this hybrid model: examining the effect of aerosol forcing uncertainty on global temperature and incorporating more process-based representations of black carbon into a SCM. The open-source HIRM framework has a range of applications including complex climate model emulation, uncertainty analyses of radiative forcing, attribution studies, and climate model development.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

A Kinetic Monte Carlo Approach for Simulating Cascading Transmission Line Failure

In this work, cascading transmission line failures are studied through a dynamical model of the power system operating under fixed conditions. The power grid is modeled as a stochastic dynamical system where first-principles electromechanical dynamics are excited by small Gaussian disturbances in demand and generation around a specified operating point. In this context, a single line failure is interpreted in a large deviation context as a first escape event across a surface in phase space defined by line security constraints. The resulting system of stochastic differential equations admits a transverse decomposition of the drift, which leads to considerable simplification in evaluating the quasipotential (rate function) and, consequently, computation of exit rates. Tractable expressions for the rate of transmission line failure in a restricted network are derived from large deviation theory arguments and validated against numerical simulations. Extensions to realistic settings are considered, and individual line failure models are aggregated into a Markov model of cascading failure inspired by chemical kinetics. Cascades are generated by traversing a graph composed of weighted edges representing transitions to degraded network topologies. Numerical results indicate that the Markov model can produce cascades with qualitative power-law properties similar to those observed in empirical cascades.

Kinetic Monte Carlo, rare events, Cascading Failur↗
DOE OSTI2020

Time-sliced quantum circuit partitioning for modular architectures

Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitioning heuristics which map quantum circuits to modular physical machines one time slice at a time. Specifically, we create optimized mappings for each time slice, accounting for the cost to move data from the previous time slice and using a tunable lookahead scheme to reduce the cost to move to future time slices. We compare our approach to a traditional statically-mapped, owner-computes model. Our results show strict improvement over the static mapping baseline. Here, we reduce the non-local communication overhead by 89.8% in the best case and by 60.9% on average. Our techniques, unlike many exact solver methods, are computationally tractable.

Baker, Jonathan M.↗
DOE OSTI2023

Extreme-scale stochastic optimization and simulation via learning-enhanced decomposition and parallelization (Final Technical Report)

Stochastic optimization and simulation models ubiquitously arise in designing and operating complex service/engineering systems. They can be extreme in scale due to high-dimensional data and decisions, and can also involve decisions made sequentially in response to newly revealed data, both causing significant computational challenge. The objective of this research is to explore a unified framework that integrates machine learning with discrete optimization and risk-averse modeling, to improve the efficiency of decomposition paradigms for stochastic optimization and simulations at extreme scale. The models we consider represent a broad class of complex decision-making problems, where 0-1 or continuous decisions are made before and/or after knowing multiple sources of uncertainties that could be correlated. We will employ machine learning methods to dynamically decide and prioritize computational procedures, including cut generation, branching, and bounding of the optimal objective. Furthermore, the research will shed new lights on the traditional decomposition algorithms for extreme-scale computing. Deliverables of the research include new modeling and computational methods for advancing the state-of-the-art research in optimization and simulation, bringing many relevant risk-averse, data-driven optimization problems in practice within the range of tractability. Examples include distributed computing server scheduling and sensor deployment for monitoring critical infrastructures. Success in this effort will enable progress in solving multiple extreme-scale problems in the complex system design and operations arising from DoE missions in energy, environment, and national security.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

GPU-acceleration of the ELPA2 distributed eigensolver for dense symmetric and hermitian eigenproblems

The solution of eigenproblems is often a key computational bottleneck that limits the tractable system size of numerical algorithms, among them electronic structure theory in chemistry and in condensed matter physics. Large eigenproblems can easily exceed the capacity of a single compute node, thus must be solved on distributed-memory parallel computers. We here present GPU-oriented optimizations of the ELPA two-stage tridiagonalization eigensolver (ELPA2). On top of cuBLAS-based GPU offloading, we add a CUDA kernel to speed up the back-transformation of eigenvectors, which can be the computationally most expensive part of the two-stage tridiagonalization algorithm. Furthermore, we benchmark the performance of this GPU-accelerated eigensolver on two hybrid CPU–GPU architectures, namely a compute cluster based on Intel Xeon Gold CPUs and NVIDIA Volta GPUs, and the Summit supercomputer based on IBM POWER9 CPUs and NVIDIA Volta GPUs. Consistent with previous benchmarks on CPU-only architectures, the GPU-accelerated two-stage solver exhibits a parallel performance superior to the one-stage counterpart. Finally, we demonstrate the performance of the GPU-accelerated eigensolver developed in this work for routine semi-local KS-DFT calculations comprising thousands of atoms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Perspective on Quantum Computing Applications in Quantum Chemistry Using 25-100 Logical Qubits

The intersection of quantum computing and quantum chemistry represents a promising frontier for achieving quantum utility in domains of both scientific and societal relevance. Owing to the exponential growth of classical resource requirements for simulating quantum systems, quantum chemistry has long been recognized as a natural candidate for quantum computation. This perspective focuses on identifying scientifically meaningful use cases where early fault-tolerant quantum computers, which are considered to be equipped with approximately 25-100 logical qubits, could deliver tangible impact. While recent advances in classical computing have pushed the boundaries of tractable simulations to unprecedented scales, this logical-qubit regime represents the first window where quantum devices can pursue qualitatively distinct strategies, such as polynomial-scaling phase estimation, direct simulation of quantum dynamics, and active-space embedding, that remain challenging for classical solvers, such as multireference charge-transfer and conical-intersection states central to photochemistry and materials design. We highlight near-term opportunities in algorithm and software design, discuss representative chemical problems suited for quantum acceleration, and propose strategic roadmaps and collaborative pathways for advancing practical quantum utility in quantum chemistry.

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

Diagonal state designs with reconfigurable real-time circuits

Unitary designs are widely used in quantum computation, but in many practical settings it suffices to construct a diagonal state design generated with unitary gates diagonal in the computational basis. In this work, we introduce a simple and efficient diagonal state 3-design based on real-time evolutions under 2-local Hamiltonians. Our construction is inspired by the classical Girard-Hutchinson trace estimator in that it involves the stochastic preparation of many random-phase states. Though the exact Girard-Hutchinson states are not tractably implementable on a quantum computer, we can construct states that match the statistical moments of the Girard-Hutchinson states with real-time evolution. Importantly, our random states are all generated using the same Hamiltonians for real-time evolution, with the randomness arising solely from stochastic variations in the durations of the evolutions. In this sense, the circuit is fully reconfigurable and thus suited for near-term realizations on both digital and analog platforms. Moreover, we show how to extend our construction to achieve diagonal state designs of arbitrarily high order.

Shen, Yizhi [LBL, Berkeley] (ORCID:000000024160548↗
DOE OSTI2022

Genetic programming for interpretable, data-driven continuum damage models.

The damage mechanisms that lead to failure in engineering alloys have been studied extensively, but converting this knowledge into constitutive models that are suitable for engineering-scale analysis remains a challenge. Evolution laws for continuum damage have been developed in the past and have proven effective but suffer from many non-physical assumptions that inhibit the overall accuracy of the model. Further, the assumptions inherent in these existing models prevent them from being applicable to a broad class of materials. At the same time, computational models of fine-scale damage mechanisms continue to advance making it tractable to generate large training data sets through computer simulation. Data-driven machine learning approaches can leverage these data sets to avoid making limiting assumptions, and instead produce models directly from the results of microstructural simulations and/or experiments. Many of these machine learning approaches are rapid and accurate, but they offer little to no insight into the underlying relationships among state variables being discovered. Conversely, genetic programming symbolic regression (GPSR) is a machine learning method that produces analytic expressions relating the state variables, allowing maximal insight and interpretability. To that end, we propose using GPSR as a data-driven method of obtaining microstructurally informed continuum damage models. Data is generated using microstructural simulations of damage evolution, parameterized over microstructural statistics (i.e., pore shape) and nominally applied deformations. Analytic expressions for damage evolution are obtained from the data using GPSR, and these expressions are then utilized within a continuum constitutive model. Overall, this approach is a promising method of automatically obtaining analytic relations describing constitutive phenomena in a material.

Buche, Michael Robert↗
DOE OSTI2022

Approaches for handling high-dimensional cluster expansions of ionic systems

Disordered multicomponent systems attract great interest due to their engineering design flexibility and subsequent rich space of properties. However, detailed characterization of the structure and atomic correlations remains challenging and hinders full navigation of these complex spaces. A lattice cluster expansion is one tool to obtain configurational and energetic resolution. While in theory a cluster expansion can be applied to any system of any dimensionality, the method has primarily been used in binary systems or ternary alloys. Here we apply cluster expansions in high-component ionic systems, setting up the largest cluster expansion ever attempted to our knowledge. In doing so, we address and discuss challenges specific to high-component ionic systems, namely charge state assignments, structural relaxations, and rank-deficient systems. We introduce practical procedures to make the fitting and analysis of complex systems tractable, providing guidance for future computational studies of disordered ionic systems.

25 ENERGY STORAGE↗
DOE OSTI2021

Tuning successive linear programming to solve AC optimal power flow problem for large networks

Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow (ACOPF) is no exception, particularly the large size of real-world networks. However, in order to achieve tractability, it is essential to tune the SLP algorithm presented in the literature. This paper presents a modified SLP algorithm to solve the ACOPF problem, specified by the U.S. Department of Energy’s (DOE) Grid Optimization (GO) Competition Challenge 1, within strict time limits. The algorithm first finds a near-optimal solution for the relaxed problem (i.e., Stage 1). Then, it finds a feasible solution in the proximity of the near-optimal solution (i.e., Stage 2 and Stage 3). The numerical experiments on test cases ranging from 500-bus to 30,000-bus systems show that the algorithm is tractable. Here the results show that our proposed algorithm is tractable and can solve more than 80% of test cases faster than the well-known Interior Point Method while significantly reduce the number of iterations required to solve ACOPF. The number of iterations is considered an important factor in the examination of tractability which can drastically reduce the computational time required within each iteration.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Neural Posterior Estimation for Scalable and Accurate Inverse Parameter Inference in Li-Ion Batteries

Diagnosing the internal state of Li-ion batteries is critical for battery research, operation of real-world systems, and prognostic evaluation of remaining lifetime. By using physics-based models to perform probabilistic parameter estimation via Bayesian calibration, diagnostics can account for the uncertainty due to model fitness, data noise, and the observability of any given parameter. However, Bayesian calibration in Li-ion batteries using electrochemical data is computationally intensive even when using a fast surrogate in place of physics-based models, requiring many thousands of model evaluations. A fully amortized alternative is neural posterior estimation (NPE). NPE shifts the computational burden from the parameter estimation step to data generation and model training, reducing the parameter estimation time from minutes to milliseconds, enabling real-time applications. The present work shows that NPE can infer parameters equally or more accurately than Bayesian calibration, even if it leads to higher voltage reconstruction errors. We also demonstrate that the higher computational costs for data generation are tractable even in high-dimensional cases (ranging from 6 to 27 estimated parameters). The NPE method also offers several interpretability advantages over Bayesian calibration, such as local parameter sensitivity to specific regions of the voltage curve. The NPE method is demonstrated using an experimental fast charge dataset, with parameter estimates validated against measurements of loss of lithium inventory and loss of active material. The implementation is made available in a companion repository (https://github.com/NatLabRockies/BatFIT).

25 ENERGY STORAGE↗
DOE OSTI2020

Advances in Structure Prediction of Lanthanides and Actinides with Genetic Algorithms

Computationally guided materials discovery has advanced significantly in the past two decades. Recent developments of widely available genetic algorithm-based structure prediction software in the past 10+ years has led to increased use of this methodology in the discovery and design of new materials. Owing to the computational challenges of treating f-block elements and computationally expensive methods for structure prediction, the discovery of new phases of lanthanide and actinide materials has been particularly challenging. With advancements in the development of genetic algorithms for structure prediction and the continuing improvement of high-performance computing resources, genetic algorithms provide a tractable method to find new stable phases of materials at high pressure or to search a large phase space for unknown compounds. Genetic algorithms have already been applied to the successful identification of novel lanthanide and actinide materials, as well as the prediction of unusual material properties in new phases that make promising synthetic targets.

Shields, Ashley↗
DOE OSTI2022

Global Sensitivity Analysis Using the Ultra‐Low Resolution Energy Exascale Earth System Model

Abstract For decades, Arctic temperatures have increased twice as fast as average global temperatures. As a first step toward quantifying parametric uncertainty in Arctic climate, we performed a variance‐based global sensitivity analysis (GSA) using a fully coupled, ultra‐low resolution (ULR) configuration of version 1 of the U.S. Department of Energy's Energy Exascale Earth System Model (E3SMv1). Specifically, we quantified the sensitivity of six quantities of interests (QOIs), which characterize changes in Arctic climate over a 75 year period, to uncertainties in nine model parameters spanning the sea ice, atmosphere, and ocean components of E3SMv1. Sensitivity indices for each QOI were computed with a Gaussian process emulator using 139 random realizations of the random parameters and fixed preindustrial forcing. Uncertainties in the atmospheric parameters in the Cloud Layers Unified by Binormals (CLUBB) scheme were found to have the most impact on sea ice status and the larger Arctic climate. Our results demonstrate the importance of conducting sensitivity analyses with fully coupled climate models. The ULR configuration makes such studies computationally feasible today due to its low computational cost. When advances in computational power and modeling algorithms enable the tractable use of higher‐resolution models, our results will provide a baseline that can quantify the impact of model resolution on the accuracy of sensitivity indices. Moreover, the confidence intervals provided by our study, which we used to quantify the impact of the number of model evaluations on the accuracy of sensitivity estimates, have the potential to inform the computational resources needed for future sensitivity studies.

54 ENVIRONMENTAL SCIENCES↗