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

Exponential Runge-Kutta Parareal for non-diffusive equations

Parareal is a well-known parallel-in-time algorithm that combines a coarse and fine propagator within a parallel iteration. It allows for large-scale parallelism that leads to significantly reduced computational time compared to serial time-stepping methods. However, like many parallel-in-time methods it can fail to converge when applied to non-diffusive equations such as hyperbolic systems or dispersive nonlinear wave equations. Here, this paper explores the use of exponential integrators within the Parareal iteration. Exponential integrators are particularly interesting candidates for Parareal because of their ability to resolve fast-moving waves, even at the large stepsizes used by coarse propagators. This work begins with an introduction to exponential Parareal integrators followed by several motivating numerical experiments involving the nonlinear Schrödinger equation. These experiments are then analyzed using linear analysis that approximates the stability and convergence properties of the exponential Parareal iteration on nonlinear problems. The paper concludes with two additional numerical experiments involving the dispersive Kadomtsev-Petviashvili equation and the hyperbolic Vlasov-Poisson equation. These experiments demonstrate that exponential Parareal methods offer improved time-to-solution compared to serial exponential integrators when solving certain non-diffusive equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Adiabatic quantum linear regression

Abstract A major challenge in machine learning is the computational expense of training these models. Model training can be viewed as a form of optimization used to fit a machine learning model to a set of data, which can take up significant amount of time on classical computers. Adiabatic quantum computers have been shown to excel at solving optimization problems, and therefore, we believe, present a promising alternative to improve machine learning training times. In this paper, we present an adiabatic quantum computing approach for training a linear regression model. In order to do this, we formulate the regression problem as a quadratic unconstrained binary optimization (QUBO) problem. We analyze our quantum approach theoretically, test it on the D-Wave adiabatic quantum computer and compare its performance to a classical approach that uses the Scikit-learn library in Python. Our analysis shows that the quantum approach attains up to $${2.8 \times }$$ 2.8 × speedup over the classical approach on larger datasets, and performs at par with the classical approach on the regression error metric. The quantum approach used the D-Wave 2000Q adiabatic quantum computer, whereas the classical approach used a desktop workstation with an 8-core Intel i9 processor. As such, the results obtained in this work must be interpreted within the context of the specific hardware and software implementations of these machines.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Efficient smoothed particle radiation hydrodynamics I: Thermal radiative transfer

This work presents efficient solution techniques for radiative transfer in the smoothed particle hydrodynamics discretization. Two choices that impact efficiency are how the material and radiation energy are coupled, which determines the number of iterations needed to converge the emission source, and how the radiation diffusion equation is solved, which must be done in each iteration. The coupled material and radiation energy equations are solved using an inexact Newton iteration scheme based on nonlinear elimination, which reduces the number of Newton iterations needed to converge within each time step. During each Newton iteration, the radiation diffusion equation is solved using Krylov iterative methods with a multigrid preconditioner, which abstracts and optimizes much of the communication when running in parallel. The code is verified for an infinite medium problem, a one-dimensional Marshak wave, and a two and three-dimensional manufactured problem, and exhibits first-order convergence in time and second-order convergence in space. For these problems, the number of iterations needed to converge the inexact Newton scheme and the diffusion equation is independent of the number of spatial points and the number of processors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Quantum spatial search with multiple excitations

Spatial search is the problem of finding a marked vertex in a graph. A continuous-time quantum walk in the single-excitation subspace of an $n$ spin system solves the problem of spatial search by finding the marked vertex in $O(\sqrt{n})$ time. Here, we investigate a natural extension of the spatial search problem, marking multiple vertices of a graph, which are still marked with local fields. We prove that a continuous-time quantum walk in the $k$-excitation subspace of $n$ spins can determine the binary string of $k$ marked vertices with an asymptotic fidelity in time $O(\sqrt{n})$, despite the size of the state space growing as $O(n^k)$. Numerically, we show that this algorithm can be implemented with interactions that decay as $1/r^\alpha$, where $r$ is the distance between spins, and an $\alpha$ that is readily available in current ion trap systems.

Lewis, Dylan↗
DOE OSTI2021

Co-Optimization of Velocity and Charge-Depletion for Plug-In Hybrid Electric Vehicles: Accounting for Acceleration and Jerk Constraints

Abstract Recent advances in vehicle connectivity and automation technologies promote advanced control algorithms that co-optimize the longitudinal dynamics and powertrain operation of hybrid electric vehicles. Typically, a sequential optimization with the vehicle dynamics optimized followed by powertrain optimization is adopted to manage a number of complexities such as the inherent mixed-integer nature of the hybrid powertrain, the numerous state and control variables, the differing time scales of vehicle and powertrain subsystems, time-varying state constraints, and large horizon lengths. Instead, we solve the offline optimization problem in a centralize manner assuming exact knowledge of the lead vehicle's position over the entire trip by applying a discrete-time single shooting-based numerical approach, Discrete Mixed-Integer Shooting (DMIS), including a linearly increasing computational complexity to the problem horizon. In particular, the hierarchical problem structure is exploited to decompose the computationally intensive Hamiltonian minimization step into a set of low-dimensional optimizations. DMIS allows us to compute the direct fuel minimization problem including the vehicle and powertrain dynamics in a centralized manner to its full horizon while systematically tuning weighting factors that penalize passenger discomfort. For the first time, this study reveals that practically implemented sequential optimization exhibits similar fuel optimality as co-optimization when a certain level of passenger comfort is required.

Automation & Control Systems↗
DOE OSTI2020

A Real-Time Optimization with Warm-Start of Multiperiod AC Optimal Power Flows

We present a real-time optimization strategy based on warm-start for solving a moving horizon of multi period AC optimal power flow (ACOPF) problems. In each horizon, ACOPFs are temporally interlinked via generator ramp constraints, and we assume that each horizon needs to be solved every few seconds or minutes. We introduce two approximate tracking schemes that closely follow a solution path consisting of strongly regular points. We present theoretical results bounding the tracking error by the square of the parameter changes between time periods. Experimental results for networks of sizes up to 9K buses show a fast computation time while maintaining a good solution quality, thus making our approach well suited for real-time circumstances.

moving horizon↗
DOE OSTI2024

Parallel expansion of a fuel pellet plasmoid

The problem of the assimilation of a cryogenic fuel pellet injected into a hot plasma is considered. Due to the transparency to ambient particles of the plasmoid, the localised region of high-density plasma created by ionisation of the ablated pellet material, electrons reach a ‘quasiequilibrium’ (QE) state which is characterised by a steady-state on the fastest collisional time scale. The simplified electron kinetic equation of the QE state is solved. Taking a velocity moment of the higher-order electron kinetic equation, which is valid on the expansion time scale, permits a fluid closure, yielding an evolution equation for the macroscopic parameters describing the QE distribution function. In contrast to the Braginskii equations, the closure does not require that electrons have a short mean free path compared with the size of density perturbations, and permits an anisotropic and highly non-Maxwellian distribution function. As the QE distribution function accounts for both trapped and passing electrons, the self-consistent electric potential that causes the expansion can be properly described, in contrast to earlier models of pellet plasmoid expansion with an unbounded potential. The plasmoid expansion is simulated using both a Vlasov model and a cold-fluid model for the ions. During the expansion plasmoid ions and electrons obtain nearly equal amounts of energy; as hot ambient electrons provide this energy in the form of collisional heating of plasmoid electrons, the expansion of a pellet plasmoid is expected to be a potent mechanism for the transfer of energy from electrons to ions on a time scale shorter than that of ion–electron thermalisation.

Physics↗
DOE OSTI2021

Implicit Multirate GARK Methods

This article considers multirate generalized-structure additively partitioned Runge–Kutta methods for solving stiff systems of ordinary differential equations with multiple time scales. These methods treat different partitions of the system with different timesteps for a more targeted and efficient solution compared to monolithic single rate approaches. With implicit methods used across all partitions, methods must find a balance between stability and the cost of solving nonlinear equations for the stages. In order to characterize this important trade-off, we explore multirate coupling strategies, problems for assessing linear stability, and techniques to efficiently implement Newton iterations for stage equations. Unlike much of the existing multirate stability analysis which is limited in scope to particular methods, we present general statements on stability and describe fundamental limitations for certain types of multirate schemes. New implicit multirate methods up to fourth order are derived, and their accuracy and efficiency properties are verified with numerical tests.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Knowledge-based Framework for Building Energy Model Performance Verification

Building energy modeling (BEM) has been widely used by researchers, regulators, and engineers to quantify building energy performance. Quality assurance (QA) and quality control (QC) of the model's performance are essential parts of such analysis. Currently, QA/QC is done in a manual and ad-hoc manner, which is tedious, error-prone, and time-consuming when QA/QC a large number of models. To solve these challenges, we propose a a dAta-driveN buIlding perforMance verificATion framEwork (ANIMATE), which conducts automated output-based verification of building operations requirements (especially for time-series output-based verification of control requirements). While this framework was developed for verifying energy model performance, it can be extended for other applications such as BEM software testing and performance verification of real buildings in the field.

Chen, Yan↗
DOE OSTI2024

Neural units with time-dependent functionality

We show that the time-resolved dynamics of an underdamped harmonic oscillator can be used to do multifunctional computation, performing distinct computations at distinct times within a single dynamical trajectory. We consider the amplitude of an oscillator whose inputs influence its frequency. The activity of the oscillator at fixed times is a nonmonotonic function of its inputs, so it can solve problems such as XOR that are not linearly separable. The activity of the oscillator at fixed input is a nonmonotonic function of time, so it is multifunctional in a temporal sense, and able to carry out distinct nonlinear computations at distinct times within the same dynamical trajectory. We show that a single oscillator, observed at different times, can act as all of the elementary logic gates and perform binary addition, the latter usually implemented in hardware using five logic gates. We show that a set of n oscillators, observed at different times, can perform an arbitrary number of analog-to-n-bit digital conversions. We also show that oscillators can be trained by gradient descent to perform distinct classification tasks at distinct times. Computing with time-dependent functionality can be done in or out of equilibrium, and suggests a way of reducing the number of parameters or devices required to do nonlinear computations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Sequentially coupled flow and geomechanical simulation with a discrete fracture model for analyzing fracturing fluid recovery and distribution in fractured ultra-low permeability gas reservoirs

More accurate characterization and prediction of the in-situ distribution of fracturing fluid in fractured reservoirs are needed for enhancing well productivity. In this study, an implicit-sequentially coupled flow/geomechanics simulator incorporating an efficient discrete fracture model is developed to model fluid distribution and recovery performance of ultra-low permeability gas reservoirs. The finite-volume and finite-element methods are used for space discretization of the flow and geomechanics equations, respectively, while the backward Euler method is employed for time discretization. The flow and geomechanics equations are solved sequentially based on fixed-stress splitting. An efficient discrete-fracture model is used to explicitly model the fractured system. Flexible unstructured gridding is employed to model arbitrarily-oriented fractures. The interrelations among pore volume, permeability and geomechanical conditions are considered dynamically using two-way coupled flow and geomechanics computations. The geometry of fracture (networks) due to hydraulic fracturing has significant impacts on the fracturing fluid recovery efficiency and ensuing fluid distribution. Under the same injection volume, the fracturing fluid recovery is higher when the fracture geometry is planar. Fluid recovery is relatively lower whenever natural fractures are activated during fracturing treatments; flowback time is also shortened when complex fracture network with enlarged fracture interface is present. Fracturing fluid in hydraulic fractures may leak off into the natural fractures and subsequently imbibes into the surrounding matrix due to capillarity effects. The fracturing fluid recovery and in-situ fluid distribution are sensitive to the shut-in duration and fracture closure behavior. This study analyzes the coupled flow-geomechanical responses of fractured gas reservoirs during the post-fracturing periods. Understanding the fate of the fracturing fluid can provide insights on, to some extent, the stimulated fracture volume, size of the water invasion zone, and efficiency of the fracturing design. The simulation predictions can also provide more accurate initial reservoir conditions (e.g. distributions of different phases and pressure) for long-term well performance estimation.

42 ENGINEERING↗
DOE OSTI2021

A solution framework for linear PDE-constrained mixed-integer problems

Abstract We present a general numerical solution method for control problems with state variables defined by a linear PDE over a finite set of binary or continuous control variables. We show empirically that a naive approach that applies a numerical discretization scheme to the PDEs to derive constraints for a mixed-integer linear program (MILP) leads to systems that are too large to be solved with state-of-the-art solvers for MILPs, especially if we desire an accurate approximation of the state variables. Our framework comprises two techniques to mitigate the rise of computation times with increasing discretization level: First, the linear system is solved for a basis of the control space in a preprocessing step. Second, certain constraints are just imposed on demand via the IBM ILOG CPLEX feature of a lazy constraint callback. These techniques are compared with an approach where the relations obtained by the discretization of the continuous constraints are directly included in the MILP. We demonstrate our approach on two examples: modeling of the spread of wildfire and the mitigation of water contamination. In both examples the computational results demonstrate that the solution time is significantly reduced by our methods. In particular, the dependence of the computation time on the size of the spatial discretization of the PDE is significantly reduced.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Quantal diffusion approach for multinucleon transfer processes in the 58,64 Ni + 208 Pb reactions: Toward the production of unknown neutron-rich nuclei

In recent years, substantial efforts have been made for the study of multinucleon transfer reactions at energies around the Coulomb barrier both experimentally and theoretically, aiming at the production of unknown neutron-rich heavy nuclei. It is crucial to provide reliable theoretical predictions based on microscopic theories with sufficient predictive power. Purpose: This article aims to clarify the applicability of the quantal diffusion approach based on the stochastic mean-field (SMF) theory for multinucleon transfer processes. Isotope production cross sections are evaluated for the reactions of 64 Ni + 208 Pb at E c.m. = 268 MeV and 58 Ni + 208 Pb at E c.m. = 270 MeV and are compared with available experimental data. Methods: Three-dimensional time-dependent Hartree-Fock (TDHF) calculations are carried out for a range of initial orbital angular momenta with Skyrme SLy4d functional. Quantal diffusion equations, derived based on the SMF theory, for variances and covariance of neutron and proton numbers of reaction products are solved, with microscopic drift and diffusion coefficients obtained from time evolution of occupied single-particle orbitals in TDHF. Secondary de-excitation processes, both particle evaporation and fission, are simulated by a statistical compound-nucleus de-excitation model, gemini++. Dynamics of a fast isospin equilibration process followed by a slow drift toward the mass symmetry are commonly observed, as expected. Various reaction outcomes are evaluated, including average mass and charge numbers of reaction products, total kinetic energy loss (TKEL), scattering angle, contact time, and production cross sections for primary and secondary products. By comparing with the experimental data, we find that SMF and TDHF quantitatively reproduce experimental data for few-nucleon-transfer channels around the average values. In contrast, for many-nucleon-transfer channels, we find that the SMF approach provides much better description of the experimentally measured isotopic distributions. The results underline the importance of beyond-mean-field effects, especially one-body (mean-field) fluctuations and correlations, in describing multinucleon transfer processes. Moreover, through a combined analysis of SMF with a statistical model, gemini++, we find a significant contribution of transfer-induced fission, which is consistent with the experimental observation. In some cases, the SMF approach overestimates the isotopic width, requiring further improvements of the theoretical description. Possible ways to improve the description are discussed. The SMF approach is designed to describe the quantum many-body problem according to an ensemble of mean-field trajectories, taking into account part of many-body correlations in the description. As it requires feasible computational costs comparable to the ordinary TDHF approach, together with further model improvements, it will be a promising tool in the search for optimal reaction conditions to produce yet-unknown neutron-rich heavy nuclei through the multinucleon transfer reaction.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

A meshless stochastic method for Poisson–Nernst–Planck equations

A plethora of biological, physical, and chemical phenomena involve transport of charged particles (ions). Its continuum-scale description relies on the Poisson–Nernst–Planck (PNP) system, which encapsulates the conservation of mass and charge. The numerical solution of these coupled partial differential equations is challenging and suffers from both the curse of dimensionality and difficulty in efficiently parallelizing. We present a novel particle-based framework to solve the full PNP system by simulating a drift–diffusion process with time- and space-varying drift. We leverage Green’s functions, kernel-independent fast multipole methods, and kernel density estimation to solve the PNP system in a meshless manner, capable of handling discontinuous initial states. The method is embarrassingly parallel, and the computational cost scales linearly with the number of particles and dimension. We use a series of numerical experiments to demonstrate both the method’s convergence with respect to the number of particles and computational cost vis-à-vis a traditional partial differential equation solver.

Chemistry↗
DOE OSTI2023

Benchmarking for AI for Science

AI has been instrumental for recent developments in a number of domains of the sciences. With several hundred machine learning (ML) algorithms and models, and numerous AI-specific hardware platforms, a common quest for all scientists working on AI for Science is around the selection of machine learning algorithm(s) to solve their domain-specific scientific problems. A number of different initiatives around AI Benchmarking have been set up and have been useful in understanding the benefits of different ML algorithms for different tasks.However, with the majority of these AI Benchmarking initiatives focusing on the conventional notions of benchmarking, where the focus is purely runtime performance (such as training time or inference time), their suitability for benchmarking different ML algorithms for solving scientific problems has been viewed as a performance problem even though both are hardly the same. To make reasonable, explainable, and justifiable advancements in science using AI, it is critical to focus on the merits of these algorithms in handling different domain science problems. In other words, more emphasis must be given on Benchmarking for AI for Science than AI Benchmarking. The vision of the former is not only to assess the performance of ML algorithms, but also to assess, and understand the benefits and merits of different ML algorithms in handling scientific problems. Benchmarking for AI for Science, instead of pure performance focused AI Benchmarking, has several benefits: (i) it has the potential to offer advances in the sciences, much more rapidly than through pure performance-based AI methods, (ii) it will encourage the community to focus on developing better domain-specific AI techniques, particularly given the provision for being able to benchmark different techniques, and (iii) it will encourage hardware manufacturers to focus on developing science-specific hardware subsystems.

Thiyagalingam, Jeyan↗
DOE OSTI2023

Hydro-Code Implementation and Testing of a Kinetic Phase Transition Framework

In this report we describe the Kinetic Phase Transition (KPT) framework that has been worked out over the last 10 years (from around 2014) and the implementation of it into three different codes, the one-dimensional hydro- LASLO and the three-dimensional magneto-hydro- ALEGRA, Sandia codes, via subroutines in the LAMBDA Equations of State and constitutive models package, and Flag, an arbitrary Lagrangian-Eulerian multiphysics code developed within the Lagrangian Applications project (LAP) at LANL. We discuss the introduction of phase mass (and/or volume) fractions that are needed in a code for it to be ‘phase aware’, that is, not only the thermodynamic state is known in each point but also the mixture of the materials’ phases in that point. Further we point to the need of a full Equations of State for each phase in a material to achieve phase awareness and we review the equilibrium phase model, where a phase mixture is at its lowest Gibbs free energy state, to make this point clear. Contrasting the kinetic phase transition to this equilibrium model seamlessly introduce us to the KPT framework that is subsequently thoroughly discussed. While the determination of the total state and the states and mass fractions of phases in each point is a problem that can borrow many of its numerical details from Eulerian codes and mixture of materials (not phases), the update of mass fractions with time in a KPT framework needs a new set of considerations. General for any update model is that we need to prevent mass fractions from becoming unphysical (negative or their sum to be larger than one). We have solved this problem by implementing a subdivision of the hydro time step that prevents the phase from being fully present to not present at all in one subdivided time step by limiting the size of the subdivided time step. This scheme also corrects numerical problems from abrupt changes in parameter values, the so called Gibbs phenomena, that gives rise to slushing between phases in the KPT framework. Interspersed throughout the report are discussions on different thermodynamics considerations. EOS validity windows, limitations on the EOS phase space, are needed for the KPT framework and are discussed separately and exemplified. The KPT framework described in this report has been verified by code comparison, but validation is still an active area of research. There is room for improvement in the update model, both in the model for determination of rates and in how to prevent the mass fractions from becoming unphysical. In addition, the parameters in the KPT update model and the placement of the phase boundary in the EOS phase space, and interactions with other constitutive models, are closely related and interfering with each other. One possible way forward is to simultaneously develop KPT parameters, EOS, and constitutive models for each material.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Dynamic Ride-Matching for Large-Scale Transportation Systems

Efficient dynamic ride-matching (DRM) in large-scale transportation systems is a key driver in transport simulations to yield answers to challenging problems. Although the DRM problem is simple to solve, it quickly becomes a computationally challenging problem in large-scale transportation system simulations. Therefore, this study thoroughly examines the DRM problem dynamics and proposes an optimization-based solution framework to solve the problem efficiently. To benefit from parallel computing and reduce computational times, the problem’s network is divided into clusters utilizing a commonly used unsupervised machine learning algorithm along with a linear programming model. Then, these sub-problems are solved using another linear program to finalize the ride-matching. At the clustering level, the framework allows users adjusting cluster sizes to balance the trade-off between the computational time savings and the solution quality deviation. A case study in the Chicago Metropolitan Area, U.S., illustrates that the framework can reduce the average computational time by 58% at the cost of increasing the average pick up time by 26% compared with a system optimum, that is, non-clustered, approach. Another case study in a relatively small city, Bloomington, Illinois, U.S., shows that the framework provides quite similar results to the system-optimum approach in approximately 62% less computational time.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2025

LuGo: An enhanced quantum phase estimation implementation

Quantum Phase Estimation (QPE) is a cardinal algorithm in quantum computing that plays a crucial role in various applications, including cryptography, molecular simulation, and solving systems of linear equations. However, the standard implementation of QPE faces challenges related to time complexity and circuit depth, which limit its practicality for large-scale computations. We introduce LuGo, a novel framework designed to enhance the performance of QPE by reducing circuit duplication, as well as using parallelization techniques to achieve faster generation of the QPE circuit and gate reduction. We validate the effectiveness of our framework by generating quantum linear solver circuits, which require both QPE and inverse QPE, to solve linear systems of equations. LuGo achieves significant improvements in both computational efficiency and hardware requirements without compromising on accuracy. Compared to a standard QPE implementation, LuGo reduces time consumption to generate a circuit that solves a 2 6 × 2 6 system matrix by a factor of 50.68 and over 31× reduction of quantum gates and circuit depth, with no fidelity loss on an ideal quantum simulator. Furthermore, we demonstrated the versatility and scalability of LuGo enabled HHL algorithm by simulating a canonical Hele-Shaw fluid problem using a quantum simulator. With these advantages, LuGo paves the way for more efficient implementations of QPE, enabling broader applications across several quantum computing domains.

Quantum algorithm↗