Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solve time”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Exploiting Kronecker structure in exponential integrators: Fast approximation of the action of φ $-$functions of matrices via quadrature

Here, in this article, we propose an algorithm for approximating the action of φ $-$ functions of matrices against vectors, which is a key operation in exponential time integrators. In particular, we consider matrices with Kronecker sum structure, which arise from problems admitting a tensor product representation. The method is based on quadrature approximations of the integral form of the φ $-$ functions combined with a scaling and modified squaring method. Owing to the Kronecker sum representation, only actions of 1D matrix exponentials are needed at each quadrature node and assembly of the full matrix can be avoided. Additionally, we derive a priori bounds for the quadrature error, which show that, as expected by classical theory, the rate of convergence of our method is supergeometric. Guided by our analysis, we construct a fast and robust method for estimating the optimal scaling factor and number of quadrature nodes that minimizes the total cost for a prescribed error tolerance. We investigate the performance of our algorithm by solving several linear and semilinear time-dependent problems in 2D and 3D. The results show that our method is accurate and orders of magnitude faster than the current state-of-the-art.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Scaling and adiabaticity in a rapidly expanding gluon plasma

In this work we aim to gain qualitative insight on the far-from-equilibrium behavior of the gluon plasma produced in the early stages of a heavy-ion collision. It was recently discovered [1] that the distribution functions of quarks and gluons in QCD effective kinetic theory (EKT) exhibit self-similar “scaling” evolution with time-dependent scaling exponents long before those exponents reach their pre-hydrodynamic fixed-point values. In this work we shed light on the origin of this time-dependent scaling phenomenon in the small-angle approximation to the Boltzmann equation. We first solve the Boltzmann equation numerically and find that time-dependent scaling is a feature of this kinetic theory, and that it captures key qualitative features of the scaling of hard gluons in QCD EKT. We then proceed to study scaling analytically and semi-analytically in this equation. We find that an appropriate momentum rescaling allows the scaling distribution to be identified as the instantaneous ground state of the operator describing the evolution of the distribution function, and the approach to the scaling function is described by the decay of the excited states. That is to say, there is a frame in which the system evolves adiabatically. Furthermore, from the conditions for adiabaticity we can derive evolution equations for the time-dependent scaling exponents. In addition to the known free-streaming and BMSS fixed points, we identify a new “dilute” fixed point when the number density becomes small before hydrodynamization. Corrections to the fixed point exponents in the small-angle approximation agree quantitatively with those found previously in QCD EKT and arise from the evolution of the ratio between hard and soft scales.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

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↗
DOE OSTI2025

Real-Time Bayesian Inference at Extreme Scale: A Digital Twin for Tsunami Early Warning Applied to the Cascadia Subduction Zone

We present a Bayesian inversion-based digital twin that employs acoustic pressure data from seafloor sensors, along with 3D coupled acoustic–gravity wave equations, to infer earthquake-induced spatiotemporal seafloor motion in real time and forecast tsunami propagation toward coastlines for early warning with quantified uncertainties. Our target is the Cascadia subduction zone, with one billion parameters. Computing the posterior mean alone would require 50 years on a 512 GPU machine. Instead, exploiting the shift invariance of the parameter-to-observable map and devising novel parallel algorithms, we induce a fast offline–online decomposition. The offline component requires just one adjoint wave propagation per sensor; using MFEM, we scale this part of the computation to the full El Capitan system (43,520 GPUs) with 92% weak parallel efficiency. Moreover, given real-time data, the online component exactly solves the Bayesian inverse and forecasting problems in 0.2 seconds on a modest GPU system, a ten-billion-fold speedup.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Scattering using real-time path integrals

Background: Path integrals are a powerful tool for solving problems in quantum theory that are not amenable to a treatment by perturbation theory. Most path integral computations require an analytic continuation to imaginary time. While imaginary time treatments of scattering are possible, imaginary time is not a natural framework for treating scattering problems. More importantly, quantum algorithms for calculating path integrals require real-time evolution. Purpose: Here, we test a recently introduced method for performing direct calculations of scattering observables using real-time path integrals in order to understand the challenges facing real-time path integral calculations of scattering observables. Method: The computations are based on a new interpretation of the path integral as the expectation value of a potential functional on cylinder sets of continuous paths with respect to a complex probability distribution. The method can in principle be applied to arbitrary short-range potentials. Results: The method is applied to compute matrix elements of Møller wave operators applied to narrow wave packets. These are used to calculate half-shell sharp-momentum transition matrix elements for one-dimensional potential scattering. The calculations for half-shell transition operator matrix elements converge to the numerical solution of the Lippmann-Schwinger equation. Conclusions: This work presents a proof in principle that scattering observables can be computed using real-time Feynman path integrals. While the computational method is not efficient, it can be improved. It provides a laboratory for studying quantum computational algorithms that are applicable to scattering problems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Learning Optimal Solutions for Extremely Fast AC Optimal Power Flow

We develop, in this paper, a machine learning approach to optimize the real-time operation of electric power grids. In particular, we learn feasible solutions to the AC optimal power flow (OPF) problem with negligible optimality gaps. The AC OPF problem aims at identifying optimal operational conditions of the power grids that minimize power losses and/or generation costs. Due to the computational challenges with solving this nonconvex problem, many efforts have focused on linearizing or approximating the problem in order to solve the AC OPF on faster timescales. However, many of these approximations can be fairly poor representations of the actual system state and still require solving an optimization problem, which can be time consuming for large networks. In this work, we learn a mapping between the system loading and optimal generation values, enabling us to find near-optimal and feasible AC OPF solutions. This allows us to bypass solving the traditionally nonconvex AC OPF problem, resulting in a significant decrease in computational burden for grid operators.

machine learning↗
DOE OSTI2020

Learning Optimal Solutions for Extremely Fast AC Optimal Power Flow: Preprint

We develop, in this paper, a machine learning approach to optimize the real-time operation of electric power grids. In particular, we learn feasible solutions to the AC optimal power flow (OPF) problem with negligible optimality gaps. The AC OPF problem aims at identifying optimal operational conditions of the power grids that minimize power losses and/or generation costs. Due to the computational challenges with solving this nonconvex problem, many efforts have focused on linearizing or approximating the problem in order to solve the AC OPF on faster timescales. However, many of these approximations can be fairly poor representations of the actual system state and still require solving an optimization problem, which can be time consuming for large networks. In this work, we learn a mapping between the system loading and optimal generation values, enabling us to find near-optimal and feasible AC OPF solutions. This allows us to bypass solving the traditionally nonconvex AC OPF problem, resulting in a significant decrease in computational burden for grid operators.

machine learning↗
DOE OSTI2025

Fast and Scalable FFT-Based GPU-Accelerated Algorithms for Block-Triangular Toeplitz Matrices with Application to Linear Inverse Problems Governed by Autonomous Dynamical Systems

In this work, we present an efficient and scalable algorithm for performing matrix-vector multiplications (matvecs) for block Toeplitz matrices. Such matrices, which are shift-invariant with respect to their blocks, arise in the context of solving inverse problems governed by autonomous systems, and time-invariant systems in particular. In this article, we consider inverse problems that infer unknown parameters from observational data of a linear time-invariant dynamical system given in the form of partial differential equations (PDEs). Matrix-free Newton-conjugate-gradient methods are often the gold standard for solving these inverse problems, but they require numerous actions of the Hessian on a vector. Matrix-free adjoint-based Hessian matvecs require solution of a pair of linearized forward/adjoint PDE solves per Hessian action, which may be prohibitive for large-scale inverse problems. Time invariance of the forward PDE problem leads to a block Toeplitz structure of the discretized parameter-to-observable (p2o) map defining the mapping from inputs (parameters) to outputs (observables) of the PDEs. This block Toeplitz structure enables us to exploit two key properties: (1) compact storage of the p2o map and its adjoint, and (2) efficient fast Fourier transform–based Hessian matvecs. The proposed algorithm is mapped onto large multi-GPU clusters and achieves more than 80% of peak bandwidth on NVIDIA A100 GPUs. Excellent weak scaling is shown for up to 48 A100 GPUs. For the targeted problems, the implementation executes Hessian matvecs within fractions of a second, which is orders of magnitude faster than can be achieved by conventional matrix-free Hessian matvecs via forward/adjoint PDE solves.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Diffusion-Model-Assisted Supervised Learning of Generative Models for Density Estimation

Here, we present a supervised learning framework of training generative models for density estimation. Generative models, including generative adversarial networks (GANs), normalizing flows, and variational auto-encoders (VAEs), are usually considered as unsupervised learning models, because labeled data are usually unavailable for training. Despite the success of the generative models, there are several issues with the unsupervised training, e.g., requirement of reversible architectures, vanishing gradients, and training instability. To enable supervised learning in generative models, we utilize the score-based diffusion model to generate labeled data. Unlike existing diffusion models that train neural networks to learn the score function, we develop a training-free score estimation method. This approach uses mini-batch-based Monte Carlo estimators to directly approximate the score function at any spatial-temporal location in solving an ordinary differential equation (ODE), corresponding to the reverse-time stochastic differential equation (SDE). This approach can offer both high accuracy and substantial time savings in neural network training. Once the labeled data are generated, we can train a simple, fully connected neural network to learn the generative model in the supervised manner. Compared with existing normalizing flow models, our method does not require the use of reversible neural networks and avoids the computation of the Jacobian matrix. Compared with existing diffusion models, our method does not need to solve the reverse-time SDE to generate new samples. As a result, the sampling efficiency is significantly improved. We demonstrate the performance of our method by applying it to a set of 2D datasets as well as real data from the University of California Irvine (UCI) repository.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Scalable Approaches to Selecting Key Entities in Large Networked Infrastructure Systems

This work aims at bringing advances in discrete optimization algorithms to solving practical engineering problems at scale. Often times, in many engineering design problems, there is a need to select a small set of influential or representative elements from a large ground set of entities in an optimal fashion. Submodular optimization provides for a formal way to solve such problems. Common examples with infrastructure systems involve sensor placement and identification of key entities with certain objectives. However, scaling these approaches to large infrastructure systems can be challenging because of the high computational complexity of the overall framework that include the optimization algorithms as well as high-complexity compute-oracles that provide the necessary objective function values. In this work, we explore a well-studied and widely-applicable paradigm, namely leader-selection in a multi-agent networked setting in the context of scalable methodologies. We demonstrate novel frameworks that utilize variations of accelerated submodular optimization algorithms along with linear-algebraic methods that can help accelerate the oracle computations. We further explore this combination in conjunction with graph partitioning paradigms to take advantage of the accelerated algorithms in a distributed setting. Finally we demonstrate the key findings on a practical problem in an operational setting. For this, we leverage an example road network with approximately 18k nodes and 27k edges in a traffic control application, where we seek a limited number of k=200 key intersections. This problem can be solved in a serial setting in just under 5 hours providing more than 2 orders of magnitude speed-up over methods that do not consider acceleration techniques.

Visweswara Sathanur, Arun↗
DOE OSTI2022

On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming

Interior point methods (IPMs) are a common approach for solving linear programs (LPs) with strong theoretical guarantees and solid empirical performance. The time complexity of these methods is dominated by the cost of solving a linear system of equations at each iteration. In common applications of linear programming, particularly in machine learning and scientific computing, the size of this linear system can become prohibitively large, requiring the use of iterative solvers, which provide an approximate solution to the linear system. However, approximately solving the linear system at each iteration of an IPM invalidates the theoretical guarantees of common IPM analyses. To remedy this, we theoretically and empirically analyze (slightly modified) predictor-corrector IPMs when using approximate linear solvers: our approach guarantees that, when certain conditions are satisfied, the number of IPM iterations does not increase and that the final solution remains feasible. We also provide practical instantiations of approximate linear solvers that satisfy these conditions for special classes of constraint matrices using randomized linear algebra.

Dexter, Gregory↗
DOE OSTI2020

Interpenetrating Plasma Simulations

This project investigated multifluid models for simulating interpenetrating plasmas. These models solve the Euler equations for each plasma stream along with an appropriate model for electron dynamics. The project developed a novel code, Euclid, that simulates these models using high-order conservative spatial discretization methods and explicit and semi-implicit time integration methods. Euclid was used to solve several multifluid test cases representative of plasma dynamics in high-energy density physics experiments. Kinetic simulations of interpenetrating flows using the LOKI code revealed novel physical effects of the ion-ion streaming instability. A new multi-flow collision operator was developed for the LOKI code. A simple model of the ion-ion streaming instability was also developed. Several presentations were given on the project results; three journal articles have been published, one has been submitted, and two are planned.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Field–potential finite-difference time-domain (FiPo FDTD) technique for computational electromagnetics

Modeling light–matter interactions at the nanoscale requires accurate handling of coupled quantum and electromagnetic systems. This coupling requires information about the electric scalar potential Φ and the magnetic vector potential A, which are not typically calculated in standard computational electromagnetics implementations. To that end, we have developed a field–potential finite-difference time-domain (FiPo FDTD) algorithm, which solves a set of first-order equations for Φ and A alongside equations for the electric and magnetic fields E and H. The FiPo Basic code is essentially conventional FDTD, but with an added module that calculates the potentials. The FiPo Hybrid code self-consistently calculates both fields and potentials and is particularly suitable for coupling with quantum electronic transport solvers because it can be sourced by the potentials themselves. To terminate the domain and mimic infinite space, we have derived and implemented a convolutional perfectly matched layer (CPML) absorbing boundary condition for FiPo FDTD whose performance is on par with state-of-the-art CPMLs for standard FDTD. We present FiPo simulation results on several example systems.

Avazpour, L. [University of Wisconsin-Madison, WI ↗
DOE OSTI2023

Study of Different Formulations for the Multiperiod Blending Problem Applied to Lithium Recovery from Produced Water

We present several formulations to solve the MPBP for the recovery of REE/CMs from produced water and propose a decomposition approach thatleverages strategies in general disjunctive programming to enhance its performance. We compare these proposed formulations/strategies via two illustrative case studies on recovering lithium from a network of produced water sources.

Ovalle, Daniel↗
DOE OSTI2022

Atomistically-informed modeling of point defect clustering and evolution in irradiated ThO 2

A cluster dynamics (CD) model has been developed to investigate the nucleation and growth of point defect clusters, i.e., interstitial prismatic loops and nanoscale and sub-nanoscale voids, in ThO 2 during irradiation by energetic particles. The model considers cluster off-stoichiometry due to the asymmetry of point defect generation on the O and Th sublattices under irradiation, as well as the point defect diffusivities and the defect binding energies to clusters. The energies were established using detailed molecular dynamics simulations considering the statistical variability of cluster configuration. A high-order adaptive time-integration has been used to solve the model. The predicted loop density and their average size is in good agreement with reported experimental observations for proton irradiated ThO 2 at 600°C. In conclusion, the model did not predict void evolution due to the sluggish kinetics of cation vacancies, explaining the absence of voids in proton irradiated ThO 2 (and other oxides) at relatively low temperatures.

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

Comparison of permeability predictions on cemented sandstones with physics-based and machine learning approaches

Permeability prediction has been an important problem since the time of Darcy. Most approaches to solve this problem have used either idealized physical models or empirical relations. In recent years, machine learning (ML) has led to more accurate and robust, but less interpretable empirical models. Using 211 core samples collected from 12 wells in the Garn Sandstone from the North Sea, this study compared idealized physical models based on the Carman-Kozeny equation to interpretable ML models. We found that ML models trained on estimates of physical properties are more accurate than physical models. The results show evidence of a threshold of about 10% volume fraction, above which pore-filling cement strongly affects permeability.

03 NATURAL GAS↗
DOE OSTI2021

Influence of non-adiabatic effects on linear absorption spectra in the condensed phase: Methylene blue

Modeling linear absorption spectra of solvated chromophores is highly challenging as contributions are present both from coupling of the electronic states to nuclear vibrations and from solute–solvent interactions. In systems where excited states intersect in the Condon region, significant non-adiabatic contributions to absorption line shapes can also be observed. Here, we introduce a robust approach to model linear absorption spectra accounting for both environmental and non-adiabatic effects from first principles. This model parameterizes a linear vibronic coupling (LVC) Hamiltonian directly from energy gap fluctuations calculated along molecular dynamics (MD) trajectories of the chromophore in solution, accounting for both anharmonicity in the potential and direct solute–solvent interactions. The resulting system dynamics described by the LVC Hamiltonian are solved exactly using the thermalized time-evolving density operator with orthogonal polynomials algorithm (T-TEDOPA). The approach is applied to the linear absorption spectrum of methylene blue in water. We show that the strong shoulder in the experimental spectrum is caused by vibrationally driven population transfer between the bright S1 and the dark S2 states. The treatment of the solvent environment is one of many factors that strongly influence the population transfer and line shape; accurate modeling can only be achieved through the use of explicit quantum mechanical solvation. The efficiency of T-TEDOPA, combined with LVC Hamiltonian parameterizations from MD, leads to an attractive method for describing a large variety of systems in complex environments from first principles.

Dunnett, Angus J. (ORCID:0000000285797826)↗
DOE OSTI2023

Theoretical Analysis of Resonant Tunneling Enhanced Field Emission

In this paper, we develop an exact analytical quantum theory for field emission from surfaces with a nearby quantum well, by solving the one-dimensional time-independent Schrödinger equation. The quantum well, which may be introduced by ions, atoms, nanoparticles, etc., is simplified as a square potential well with depth H, width d, and distance to the surface L. The theory is used to analyze the effects of the quantum well (d, H, and L), the cathode properties (work function W and Fermi energy E F ), and dc field F. It is found that the quantum well can lead to resonant tunneling enhanced field emission up to several orders of magnitude larger than that from bare cathode surfaces. In the meantime, the electron-emission-energy spectrum is significantly narrowed. The strong enhancement region is bounded by the conditions eFL + H ≥ W + C and eFL ≤ W, with e being the elementary charge (positive) and C a constant dependent on dc field F. It is also found that the linear shift of resonance peaks in the electron-emission-energy spectrum with dc field F follows ε p =ε p⁢0 –e⁢FL, with ε p⁢0 being approximately the eigenenergies for electrons confined in a square potential well without a dc field. Finally, the theory provides insights for the design of high-efficiency field emitters, which can produce a high current and highly collimated electron beams.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗