Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical algorithms”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Distributionally Robust Variational Quantum Algorithms With Shifted Noise

Given their potential to demonstrate near-term quantum advantage, variational quantum algorithms (VQAs) have been extensively studied. Although numerous techniques have been developed for VQA parameter optimization, it remains a significant challenge. A practical issue is the high sensitivity of quantum noise to environmental changes, and its propensity to shift in real time. This presents a critical problem as an optimized VQA ansatz may not perform effectively under a different noise environment. For the first time, we explore how to optimize VQA parameters to be robust against unknown shifted noise. We model the noise level as a random variable with an unknown probability density function (PDF), and we assume that the PDF may shift within an uncertainty set. This assumption guides us to formulate a distributionally robust optimization problem, with the goal of finding parameters that maintain effectiveness under shifted noise. We utilize a distributionally robust Bayesian optimization solver for our proposed formulation. This provides numerical evidence in both the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE) with hardware-efficient ansatz, indicating that we can identify parameters that perform more robustly under shifted noise. We regard this work as the first step towards improving the reliability of VQAs influenced by real-time noise.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Numerical heating in particle-in-cell simulations with Monte Carlo binary collisions

The binary Monte Carlo (MC) collision algorithm is a standard and robust method to include binary Coulomb collision effects in particle-in-cell (PIC) simulations of plasmas. Here we show that the coupling between PIC and MC algorithms can give rise to (nonphysical) numerical heating of the system that significantly exceeds that observed when these algorithms operate independently. We argue that this deleterious effect results from an inconsistency between the particle motion associated with MC collisions and the work performed by the collective electromagnetic field on the PIC grid. This inconsistency manifests as the (artificial) stochastic production of electromagnetic energy, which ultimately heats the plasma particles. Here, the MC-induced numerical heating can significantly impact the evolution of the simulated system for long simulation times (≳10 3 collision periods, for typical numerical parameters). We describe the source of the MC-induced numerical heating analytically and discuss strategies to minimize it.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

State preparation and evolution in quantum computing: a perspective from Hamiltonian moments

Quantum algorithms on the noisy intermediate-scale quantum (NISQ) devices are expected to simulate quan- tum systems that are classically intractable to demonstrate quantum advantages. However, the non-negligible gate error on the NISQ devices impedes the conventional quantum algorithms to be implemented. Practical strategies usually exploit hybrid quantum-classical quantum algorithms to demonstrate potentially useful ap- plications of quantum computing in the NISQ era. Among the numerous hybrid quantum-classical algorithms, recent efforts highlight the development of quantum algorithms based upon quantum computed Hamiltonian moments, ?f|Hˆn|f? (n = 1, 2, · · · ), with respect to quantum state |f?. In this tutorial, we will give a brief review of these quantum algorithms with focuses on the typical ways of computing Hamiltonian moments using quantum hardware and improving the accuracy of the estimated state energies based on the quantum computed moments. Furthermore, we will present a tutorial to show how we can measure and compute the Hamiltonian moments of a four-site Heisenberg model, and compute the energy and magnetization of the model utilizing the imaginary time evolution in the real IBM-Q NISQ hardware environment. Along this line, we will further discuss some practical issues associated with these algorithms. We will conclude this tutorial review by overviewing some possible developments and applications in this direction in the near future.

Aulicino, Joseph C.↗
DOE OSTI2022

Effects of cosine tapering window on quantum phase estimation

Here, we provide a modification to the quantum phase estimation algorithm (QPEA) [Abrams and Lloyd, Phys. Rev. Lett. 83, 5162 (1999); Cleve et al., Proc. R. Soc. A 454, 339 (1998); Nielsen and Chuang, Quantum computation and quantum information, 2002.] inspired by classical windowing methods for spectral density estimation. From this modification we obtain an upper bound in the cost that implies a cubic improvement with respect to the algorithm's error rate. Numerical evaluation of the costs also demonstrates an improvement. Moreover, with similar techniques, we detail an iterative projective measurement method for ground state preparation that gives an exponential improvement over previous bounds using QPEA. Numerical tests that confirm the expected scaling behavior are also obtained. For these numerical tests we have used a lattice Thirring model as testing ground. Using well-known perturbation theory results, we also show how to more appropriately estimate the cost scaling with respect to state error instead of evolution operator error.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Solving the homogeneous Bethe-Salpeter equation with a quantum annealer

The homogeneous Bethe-Salpeter equation (hBSE), describing a bound system in a genuinely relativistic quantum-field theory framework, was solved for the first time by using a D-Wave quantum annealer. After applying standard techniques of discretization, the hBSE, in ladder approximation, can be formally transformed in a generalized eigenvalue problem (GEVP), with two square matrices: one symmetric and the other nonsymmetric. The latter matrix poses the challenge of obtaining a suitable formal approach for investigating the GEVP by means of a quantum annealer, i.e., to recast it as a quadratic unconstrained binary optimization problem. A broad numerical analysis of the proposed algorithms, applied to matrices of dimension up to 64, was carried out by using both the simulated-annealing package and the D-Wave . The numerical results very nicely compare with those obtained with standard classical algorithms, and also show interesting scalability features. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

A space-time parallel algorithm with adaptive mesh refinement for computational fluid dynamics

This work describes a space-time parallel algorithm with space-time adaptive mesh refinement (AMR). AMR with subcycling is added to multigrid reduction-in-time (MGRIT) in order to provide solution efficient adaptive grids with a reduction in work performed on coarser grids. This algorithm is achieved by integrating two software libraries: XBraid (Parallel time integration with multigrid. https://computation.llnl.gov/projects/parallel-timeintegration-multigrid) and Chombo (Chombo software package for AMR applications—design document, 2014). The former is a parallel time integration library using multigrid and the latter is a massively parallel structured AMR library. Employing this adaptive space-time parallel algorithm is Chord (Comput Fluids 123:202–217, 2015), a computational fluid dynamics (CFD) application code for solving compressible fluid dynamics problems. For the same solution accuracy, speedups are demonstrated from the use of space-time parallelization over the time-sequential integration on Couette flow and Stokes’ second problem. On a transient Couette flow case, at least a 1.5× speedup is achieved, and with a time periodic problem, a speedup of up to 13.7× over the time-sequential case is obtained. In both cases, the speedup is achieved by adding processors and exploring additional parallelization in time. The numerical experiments show the algorithm is promising for CFD applications that can take advantage of the time parallelism. Future work will focus on improving the parallel performance and providing more tests with complex fluid dynamics to demonstrate the full potential of the algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Iterated projected position algorithm for constructing exponentially localized generalized Wannier functions for periodic and nonperiodic insulators in two dimensions and higher

Localized bases play an important role in understanding electronic structure. In periodic insulators, a natural choice of localized basis is given by the Wannier functions which depend on a choice of unitary transform known as a gauge transformation. Over the past few decades, there have been many works that have focused on optimizing the choice of the gauge so that the corresponding Wannier functions are maximally localized or reflect some symmetry of the underlying system. In this work, we consider fully nonperiodic materials where the usual Wannier functions are not well defined and gauge optimization is impractical. To tackle the problem of calculating exponentially localized generalized Wannier functions in both periodic and nonperiodic systems, we discuss the ‘iterated projected position (IPP)” algorithm. Here, the IPP algorithm is based on matrix diagonalization and therefore unlike optimization-based approaches, it does not require initialization and cannot get stuck at a local minimum. Furthermore, the IPP algorithm is guaranteed by a rigorous analysis to produce exponentially localized functions under certain mild assumptions. We numerically demonstrate that the IPP algorithm can be used to calculate exponentially localized bases for the Haldane model, the Kane-Mele model (in both Z 2 invariant even and Z 2 invariant odd phases), and the p x + ip y model on a quasicrystal lattice.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions

We present a method for dimensionally adaptive sparse trigonometric interpolation of multidimensional periodic functions belonging to a smoothness class of finite order. This method targets applications where periodicity must be preserved and the precise anisotropy is not known a priori. To the authors' knowledge, this is the first instance of a dimensionally adaptive sparse interpolation algorithm that uses a trigonometric interpolation basis. The motivating application behind this work is the adaptive approximation of a multi-input model for a molecular potential energy surface (PES) where each input represents an angle of rotation. Our method is based on an anisotropic quasi-optimal estimate for the decay rate of the Fourier coefficients of the model; a least-squares fit to the coefficients of the interpolant is used to estimate the anisotropy. Thus, our adaptive approximation strategy begins with a coarse isotropic interpolant, which is gradually refined using the estimated anisotropic rates. The procedure takes several iterations where ever-more accurate interpolants are used to generate ever-improving anisotropy rates. We present several numerical examples of our algorithm where the adaptive procedure successfully recovers the theoretical “best” convergence rate, including an application to a periodic PES approximation. An open-source implementation of our algorithm resides in the Tasmanian UQ library developed at Oak Ridge National Laboratory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A simple fourth order propagator based on the Magnus expansion in the Liouville space: Application to a Λ-system and assessment of the rotating wave approximation

A simple fourth-order propagator [Ture and Jang, J. Phys. Chem. A 128, 2871 (2024)] based on the Magnus expansion is extended to the Liouville space for both closed-system and Lindbladian open-system quantum dynamics. For both dynamics, commutator free versions of fourth-order propagators are provided as well. These propagators are then applied to the dynamics of a driven Λ-system, where Lindblad terms represent the effect of a photonic bath. For both dynamics, the accuracy of the rotating wave approximation (RWA) for the matter–radiation interaction is assessed. We confirmed reasonable performance of RWA for weak and resonant fields. However, small errors appear for moderate fields and substantial errors can be found for strong fields where coherent population trapping can still be expected. We also found that the presence of bath for open-system quantum dynamics consistently reduces the errors of the RWA. These results provide quantitative information on how the RWA breaks down beyond weak field or for non-resonant cases. Major results are benchmarked against results of our sixth-order ME-based propagator. Finally, we also provide numerical comparison of our algorithms with other fourth-order algorithms for the Λ-system. These confirm reasonable performance of our simple propagators and the improvement gained through commutator-free expressions.

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

Pricing and Energy Trading in Peer-to-Peer Zero Marginal-Cost Microgrids

Efforts to utilize 100% renewable energy in community microgrids require new approaches to energy markets and transactions to efficiently address periods of scarce energy supply. In this paper we contribute to the promising approach of peer-to-peer (P2P) energy trading in two main ways: analysis of a centralized, welfare-maximizing economic dispatch that characterizes optimal price and allocations, and a novel P2P system for negotiating energy trades that yields physically feasible and at least weakly Pareto-optimal outcomes. Our main results are 1) that optimal pricing is insufficient to induce agents with batteries to take optimal actions, 2) a novel P2P algorithm to addresses this while keeping private information, 3) a formal proof that this algorithm converges to the centralized solution in the case of two agents negotiating for a single period, and 4) numerical simulations of the P2P algorithm performance with up to 10 agents and 24 periods that show it converges on average to total welfare within 0.1% of the social optimum in on the order of 10s to 100s of iterations, increasing with the number of agents, time periods, and total storage capacity.

batteries↗
DOE OSTI2023

The Kimberlina synthetic multiphysics dataset for CO 2 monitoring investigations

Abstract We present a synthetic multi‐scale, multi‐physics dataset constructed from the Kimberlina 1.2 CO 2 reservoir model based on a potential CO 2 storage site in the Southern San Joaquin Basin of California. Among 300 models, one selected reservoir‐simulation scenario produces hydrologic‐state models at the onset and after 20 years of CO 2 injection. Subsequently, these models were transformed into geophysical properties, including P‐ and S‐wave seismic velocities, saturated density where the saturating fluid can be a combination of brine and supercritical CO 2 , and electrical resistivity using established empirical petrophysical relationships. From these 3D distributions of geophysical properties, we have generated synthetic time‐lapse seismic, gravity and electromagnetic responses with acquisition geometries that mimic realistic monitoring surveys and are achievable in actual field situations. We have also created a series of synthetic well logs of CO 2 saturation, acoustic velocity, density and induction resistivity in the injection well and three monitoring wells. These were constructed by combining the low‐frequency trend of the geophysical models with the high‐frequency variations of actual well logs collected at the potential storage site. In addition, to better calibrate our datasets, measurements of permeability and pore connectivity have been made on cores of Vedder Sandstone, which forms the primary reservoir unit. These measurements provide the range of scales in the otherwise synthetic dataset to be as close to a real‐world situation as possible. This dataset consisting of the reservoir models, geophysical models, simulated time‐lapse geophysical responses and well logs forms a multi‐scale, multi‐physics testbed for designing and testing geophysical CO 2 monitoring systems as well as for imaging and characterization algorithms. The suite of numerical models and data have been made publicly available for downloading on the National Energy Technology Laboratory's (NETL) Energy Data Exchange (EDX) website.

58 GEOSCIENCES↗
DOE OSTI2023

Real-time control of connected vehicles in signalized corridors using pseudospectral convex optimization

Recent advances in Connected and Automated Vehicle (CAV) technologies have opened up new opportunities to enable safe, efficient, and sustainable transportation systems. However, developing reliable and rapid speed control algorithms in highly dynamic environments with complex inter-vehicle interactions and nonlinear vehicle dynamics is still a daunting task. In this paper, we develop a novel speed control method for CAVs to produce optimal speed profiles that minimize the fuel consumption and avoid idling at signalized intersections. To this end, an optimal control problem is formulated using the information of the upcoming traffic signal to adapt vehicles' speeds to avoid frequent stop-and-go driving patterns. Here, by applying the pseudospectral discretization method and the sequential convex programming method, the computational efficiency is greatly improved, enabling potential real-time on-vehicle applications. In addition, the algorithm is implemented under a model predictive control framework to ensure online control with instant response for collision avoidance and robust vehicle coordination. The proposed algorithm is verified through numerical simulations of three different traffic scenarios. The convergence and accuracy of the proposed approach are demonstrated by comparing with a popular nonlinear solver. Furthermore, the benefit of the proposed method in both traffic mobility and fuel efficiency is validated using the speed profile determined from a traffic following model in a simulation software as the baseline.

42 ENGINEERING↗
DOE OSTI2022

Design of a supervisory control system for autonomous operation of advanced reactors

Advanced reactors to be deployed in the coming decades will face deregulated energy markets, and may adopt flexible operation to boost profitability. To aid in the transition from baseload to flexible operation paradigm, autonomous operation is sought. This work focuses on the control aspect of autonomous operation. Specifically, a hierarchical control system is designed to support constraint enforcement during routine operational transients. Within the system, data-driven modeling, physics-based state observation, and classical control algorithms are integrated to provide an adaptable and robust solution. A 320 MW Fluoride-cooled High-temperature Pebble-bed Reactor is the design basis for demonstrating the proposed control system. The hierarchical control system consists of a supervisory layer and low-level layer. The supervisory layer receives requests to change the system's operating conditions (e.g., the current reactor power to meet a load -follow), and accepts or rejects them based on constraints that have been assigned. Constraints are issued to keep the plant within an optimal operating region. The low-level layer interfaces with the actuators of the system to fulfill requested changes, while maintaining tracking and regulation duties. Further, to accept requests at the supervisory layer, the Reference Governor algorithm was adopted. To model the dynamics of the reactor, a system identification algorithm, Dynamic Mode Decomposition, was utilized. To estimate the evolution of process variables that cannot be directly measured (e.g., the propagation of delayed neutron precursors), the Unscented Kalman Filter, incorporating a nonlinear model of nuclear dynamics, was adopted. The composition of these algorithms led to a numerical demonstration of constraint enforcement during a 40% power drop transient (at a rate of 5 %/min). Uncontrolled secondary-side temperatures were successfully constrained. Adaptability of the proposed system was demonstrated by modifying the constraint values, and enforcing them during the transient. Robustness was also demonstrated by enforcing constraints under noisy environments.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2025

Incentivizing Cooperative Merging Control: Insights from Multi-Agent Deep Reinforcement Learning

Cooperative driving automation enables connected and automated vehicles (CAVs) to devise cooperative merging control, introducing great potentials to alleviate traffic congestion, reduce energy consumption, and enhance safety for highway on-ramp operations. Although numerous CAV cooperative merging algorithms have been developed to improve energy and traffic performance, the agreement-seeking among CAV users and their local benefits have been understudied. This can lead to rejections of cooperative merging plans and jeopardizing CAV performance, as a cooperation may entail certain CAVs to sacrifice their local benefits to achieve a system optimum. To address this issue, the study first leverages multi-agent deep reinforcement learning (MADRL) factoring both local reward and regional reward to demonstrate the discrepancies between CAV users’ local benefits and system optimum. Next, the existence of a correlated equilibrium is proved to characterize the convergence of MADRL training. This further facilitates the incorporation of incentives (computed based on reward discrepancies) to compensate for CAV users’ local benefits and facilitate system-optimal agreements in cooperative merging operations.

Zhou, Anye [ORNL] (ORCID:0000000301455579)↗
DOE OSTI2022

Physics constrained learning for data-driven inverse modeling from sparse observations

Deep neural networks (DNN) have been used to model nonlinear relations between physical quantities. Those DNNs are embedded in physical systems described by partial differential equations (PDE) and trained by minimizing a loss function that measures the discrepancy between predictions and observations in some chosen norm. This loss function often includes the PDE constraints as a penalty term when only sparse observations are available. As a result, the PDE is only satisfied approximately by the solution. However, the penalty term typically slows down the convergence of the optimizer for stiff problems. We present a new approach that trains the embedded DNNs while numerically satisfying the PDE constraints. We develop an algorithm that enables differentiating both explicit and implicit numerical solvers in reverse-mode automatic differentiation. This allows the gradients of the DNNs and the PDE solvers to be computed in a unified framework. We demonstrate that our approach enjoys faster convergence and better stability in relatively stiff problems compared to the penalty method. Furthermore, our approach allows for the potential to solve and accelerate a wide range of data-driven inverse modeling, where the physical constraints are described by PDEs and need to be satisfied accurately.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Ultrasonic nondestructive diagnosis of lithium-ion batteries with multiple frequencies

Accurately estimating the state of charge (SoC) in battery management systems (BMSs) requires the measurement of numerous parameters and advanced algorithms. This work studies multifrequency ultrasonic waves to estimate the SoC of Li-ion batteries by sensing the material changes during charge/discharge. A pouch-type LiNi 0.6 Mn 0.2 Co 0.2 O 2 (NMC622) graphite battery cell is designed and fabricated with a capacity of 2.4 Ah. Different ultrasonic testing setups are explored to determine the optimal testing parameters for the battery. An ultrasonic monitoring system is developed to monitor the battery during charge/discharge at 750 kHz, 1 MHz, and 1.5 MHz. Signal processing algorithms are proposed for extracting three ultrasonic features—amplitude, wave velocity, and attenuation. In a three-cycle test, the amplitude histories do not show clear correlations with the SoC. The wave velocities of all three frequencies have an approximately linear relationship with the SoC, which can be used for SoC estimation. Hysteresis behavior is observed for the wave velocity in terms of a larger slope in the discharge process and velocity drop after a close charge/discharge cycle. The wave attenuation is able to capture the material phase transitions during charge/discharge.

25 ENERGY STORAGE↗
DOE OSTI2024

Harnessing the predicted maize pan-interactome for putative gene function prediction and prioritization of candidate genes for important traits

Abstract The recent assembly and annotation of the 26 maize nested association mapping population founder inbreds have enabled large-scale pan-genomic comparative studies. These studies have expanded our understanding of agronomically important traits by integrating pan-transcriptomic data with trait-specific gene candidates from previous association mapping results. In contrast to the availability of pan-transcriptomic data, obtaining reliable protein–protein interaction (PPI) data has remained a challenge due to its high cost and complexity. We generated predicted PPI networks for each of the 26 genomes using the established STRING database. The individual genome-interactomes were then integrated to generate core- and pan-interactomes. We deployed the PPI clustering algorithm ClusterONE to identify numerous PPI clusters that were functionally annotated using gene ontology (GO) functional enrichment, demonstrating a diverse range of enriched GO terms across different clusters. Additional cluster annotations were generated by integrating gene coexpression data and gene description annotations, providing additional useful information. We show that the functionally annotated PPI clusters establish a useful framework for protein function prediction and prioritization of candidate genes of interest. Our study not only provides a comprehensive resource of predicted PPI networks for 26 maize genomes but also offers annotated interactome clusters for predicting protein functions and prioritizing gene candidates. The source code for the Python implementation of the analysis workflow and a standalone web application for accessing the analysis results are available at https://github.com/eporetsky/PanPPI.

Genetics & Heredity↗
DOE OSTI2021

Butterfly Factorization Via Randomized Matrix-Vector Multiplications

This paper presents an adaptive randomized algorithm for computing the butterfly factorization of an m × n matrix with m ≈ n provided that both the matrix and its transpose can be rapidly applied to arbitrary vectors. The resulting factorization is composed of O(log n) sparse factors, each containing O(n) nonzero entries. The factorization can be attained using O(n 3/2 log n) computation and O(n log n) memory resources. Furthermore, the proposed algorithm can be implemented in parallel and can apply to matrices with strong or weak admissibility conditions arising from surface integral equation solvers as well as multi-frontal-based finite-difference, finite-element, or finite-volume solvers. A distributed-memory parallel implementation of the algorithm demonstrates excellent scaling behavior.

97 MATHEMATICS AND COMPUTING↗