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 1,009 records · Page 56
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

A positivity-preserving and conservative intersection-distribution-based remapping algorithm for staggered ALE hydrodynamics on arbitrary meshes

In this study, we introduce new intersection-distribution-based remapping tools for indirect staggered arbitrary Lagrangian-Eulerian (ALE) simulations of multi-material shock hydrodynamics on arbitrary meshes. In addition to conserving momentum and total energy, the three-stage remapper proposed in this work preserves non-negativity of the internal energy. At the first stage, we construct slope-limited piecewise-linear reconstructions of all conserved quantities on zones of the source mesh and perform intersection-based remap to obtain bound-preserving zonal quantities on the target mesh. At the second stage, we define bound-preserving nodal quantities of the staggered ALE discretization as convex combinations of corner quantities. The nodal internal energy is corrected in a way which keeps it non-negative, while providing exact conservation of total energy. At the final stage, we distribute the non-negative nodal internal energy to corners, zones and materials using non-negative weights. Proofs of positivity preservation are provided for each stage. This work is a natural extension of our paper [14] in which a similar intersection-distribution-based remapping procedure was employed. The original version used a nodal kinetic energy fix which did not provably ensure positivity preservation for the zonal internal energy after the final distribution stage. The new algorithm cures this potential drawback by using ‘coordinated’ limiters for piecewise-linear reconstructions, remapping the internal energy to nodes and correcting it before redistribution. The effectiveness of the new nodal fix is illustrated by numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Misaligned Wind‐Waves Behind Atmospheric Cold Fronts

Abstract Atmospheric fronts embedded in extratropical cyclones are high‐impact weather phenomena, contributing significantly to mid‐latitude winter precipitation. The three vital characteristics of the atmospheric fronts, high wind speeds, abrupt change in wind direction, and rapid translation, force the induced surface waves to be misaligned with winds exclusively behind the cold fronts. The effects of the misaligned waves under atmospheric cold fronts on air‐sea fluxes remain undocumented. Using the multi‐year in situ near‐surface observations and direct covariance flux measurements from the Pioneer Array off the coast of New England, we find that the majority of the passing cold fronts generate misaligned waves behind the cold front. Once generated, the waves remain misaligned, on average, for about 8 hr. The parameterized effect of misaligned waves in a fully coupled model significantly increases the roughness length (185%), drag coefficient (19%), and air‐sea momentum flux (11%). The increased surface drag reduces the wind speeds in the surface layer. The upward turbulent heat flux is weakly decreased by the misaligned waves because of the decrease in temperature and humidity scaling parameters being greater than the increase in friction velocity. The misaligned wave effect is not accurately represented in a commonly used wave‐based bulk flux algorithm. Yet, considering this effect in the current formulation improves the overall accuracy of parameterized momentum flux estimates. The results imply that better representing a directional wind‐wave coupling in the bulk formula of the numerical models may help improve the air‐sea interaction simulations under the passing atmospheric fronts in the mid‐latitudes.

Oceanography↗
DOE OSTI2022

Bounds on Optimal Revisit Times in Persistent Monitoring Missions With a Distinct and Remote Service Station</strong

We report persistent monitoring missions require an up-to-date knowledge of the changing state of the underlying environment. Unmannned aerial vehicles (UAVs) can be gainfully employed to continually visit a set of targets representing tasks (and locations) in the environment and collect data therein for long time periods. The enduring nature of these missions requires the UAV to be regularly recharged at a service station. In this article, we consider the case in which the service station is not colocated with any of the targets. An efficient monitoring requires the revisit time, defined as the maximum of the time elapsed between successive revisits to targets, to be minimized. Here, we consider the problem of determining UAV routes that lead to the minimum revisit time. The problem is NP-hard, and its computational difficulty increases with the fuel capacity of the UAV. We develop an algorithm to construct near-optimal solutions to the problem quickly when the fuel capacity exceeds a threshold. We also develop lower bounds to the optimal revisit time and use these bounds to demonstrate (through numerical simulations) that the constructed solutions are, on an average, at most 0.01% away from the optimum.

42 ENGINEERING↗
DOE OSTI2023

Role of reinforcement learning for risk-based robust control of cyber-physical energy systems

Critical infrastructures such as cyber-physical energy systems (CPS-E) integrate information flow and physical operations that are vulnerable to natural and targeted failures. Safe, secure, and reliable operation and control of CPS-E is critical to ensure societal well-being and economic prosperity. Automated control is key for real-time operations and may be mathematically cast as a sequential decision-making problem under uncertainty. Emergence of data-driven techniques for decision making under uncertainty, such as reinforcement learning (RL), have led to promising advances for addressing sequential decision-making problems for risk-based robust CPS-E control. However, existing research challenges include understanding the applicability of RL methods across diverse CPS-E applications, addressing the effect of risk preferences across multiple RL methods, and development of open-source domain-aware simulation environments for RL experimentation within a CPS-E context. This article systematically analyzes the applicability of four types of RL methods (model-free, model-based, hybrid model-free and model-based, and hierarchical) for risk-based robust CPS-E control. Problem features and solution stability for the RL methods are also discussed. We demonstrate and compare the performance of multiple RL methods under different risk specifications (risk-averse, risk-neutral, and risk-seeking) through the development and application of an open-source simulation environment. Motivating numerical simulation examples include representative single-zone and multizone building control use cases. Finally, six key insights for future research and broader adoption of RL methods are identified, with specific emphasis on problem features, algorithmic explainability, and solution stability.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Emulating the Deutsch-Josza algorithm with an inverse-designed terahertz gradient-index lens

An all-dielectric photonic metastructure is investigated for application as a quantum algorithm emulator (QAE) in the terahertz frequency regime; specifically, we show implementation of the Deustsh-Josza algorithm. The design for the QAE consists of a gradient-index (GRIN) lens as the Fourier transform subblock and patterned silicon as the oracle subblock. First, we detail optimization of the GRIN lens through numerical analysis. Then, we employed inverse design through a machine learning approach to further optimize the structural geometry. Through this optimization, we enhance the interaction of the incident light with the metamaterial via spectral improvements of the outgoing wave.

Blackwell, Ashley N.↗
DOE OSTI2022

Elastic Solutions to 2D Plane Strain Problems: Nonlinear Contact and Settlement Analysis for Shallow Foundations

The classical Neumann boundary value problem of an isotropic, homogeneous elastic half-plane under plane strain conditions is readdressed as the limiting case of the fully three-dimensional problem. Analytical solutions of the stress and strain tensors are obtained by taking the limit from known three-dimensional solutions. It is shown that the displacement fields for the plane strain problem are not well defined. A small number of simple expressions are developed, which provide a general solution for linearly-varying traction over arbitrary regions on the boundary. A simple, efficient, and rapidly convergent algorithm is developed which uses these solutions as analytic elements and provides a solution approach to the general boundary value problem. The method is verified against known solutions for Hertzian contact between parallel cylinders. Two numerical examples are presented for the analysis of shallow foundation systems. In the first, the boundary conditions are informed by analytical elastoplastic calculations and a strain influence analysis is performed and compared with the Schmertmann method. Subsequently, empirical laboratory contact traction distributions measured by Bauer et al., in both the normal and tangential directions are employed as boundary conditions for an analysis of the underlying stress field.

42 ENGINEERING↗
DOE OSTI2026

An implicit-explicit time splitting strategy for the far SOL plasma fluid model with DG-FEM discretization

We consider a far scrape-off layer (SOL) plasma fluid model of ions that is governed by a Braginskiitype model: a one-dimensional, nonlinear system of advection-diffusion equations coupled with a diffusion equation for neutral particles. Our motivation for studying this system arises from the coupling between the edge plasma and radio-frequency (RF) heating, where solving a far SOL plasma fluid model provides critical insights into edge plasma dynamics. Numerical simulations of plasma fluid models require advanced computational techniques to achieve both efficiency and accuracy, especially when resolving the boundary layer in magnetically confined plasmas. In this work, we propose an implicit-explicit time operator splitting strategy that allows for an efficient solution algorithm, where the diffusive terms are treated semi-implicitly requiring only a linear solve, while the advection part is handled explicitly using a strong-stability-preserving Runge-Kutta (SSP-RK3) scheme. This leads to a fully decoupled system in which the diffusion and advection sub-problems can be solved separately, simplifying the overall solution procedure and allowing for efficient parallelization, which is particularly relevant for exploring the impact of RF heating on the SOL plasma. The main challenge of the discretization is due to the strong coupling between diffusion and advection, particularly through the boundary conditions. This makes implementation of such a scheme in an accurate and stable manner nontrivial. We discuss in detail how to split the equations and manage boundary conditions to maintain stability and well-posedness for each subsystem. We also describe a spatial discretization approach, based on the discontinuous Galerkin finite element method (DG-FEM) and present numerical results for a one-dimensional system.

Burkovska, Olena [ORNL] (ORCID:0000000163101130)↗
DOE OSTI2024

Real-time dynamics of the Schwinger model as an open quantum system with Neural Density Operators

Ab-initio simulations of multiple heavy quarks propagating in a Quark-Gluon Plasma are computationally difficult to perform due to the large dimension of the space of density matrices. This work develops machine learning algorithms to overcome this difficulty by approximating exact quantum states with neural network parametrisations, specifically Neural Density Operators. As a proof of principle demonstration in a QCD-like theory, the approach is applied to solve the Lindblad master equation in the 1 + 1d lattice Schwinger Model as an open quantum system. Neural Density Operators enable the study of in-medium dynamics on large lattice volumes, where multiple-string interactions and their effects on string-breaking and recombination phenomena can be studied. Thermal properties of the system at equilibrium can also be probed with these methods by variationally constructing the steady state of the Lindblad master equation. Scaling of this approach with system size is studied, and numerical demonstrations on up to 32 spatial lattice sites and with up to 3 interacting strings are performed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Calibrating uncertain parameters in melt pool simulations of additive manufacturing

Melt pool scale numerical modeling of additive manufacturing (AM) processes can provide predictive capabilities and theoretical insight into the process-property-structure-performance relationships for AM parts. Despite capabilities of numerical models to solve complex multi-physics problems, it is often important to consider a tradeoff between detailed physics and computational cost. Therefore, sources of uncertainty in both experimental conditions and the parameters needed for modeling require models to be validated against empirical evidence. Here, a method is proposed to calibrate uncertain parameters used in continuum-scale melt pool models for powder bed fusion (PBF) AM. Both a simplified heat transfer model and a heat transfer and fluid flow model were investigated. A surrogate model and Markov chain-based optimization algorithm calibrated melt pool geometry for models within experimental variation of the target melt pool width and depth from the NIST AM-Bench 2018-02 dataset. The melt pool temperature distributions, solidification parameters, and simulated multi-layer solidification microstructures were compared between the two models. Similar results from both models indicate that calibrated, lower fidelity numerical models may be used in place of higher fidelity models to generate melt pool solidification data. Finally, these calibrated models therefore enable lower computational cost melt pool simulations without a noticeable decrease in simulation accuracy for grain-scale microstructure simulations.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Strategies for simulating the time evolution of Hamiltonian lattice field theories

Simulating the time evolution of quantum field theories given some Hamiltonian H requires developing algorithms for implementing the unitary operator e -iHt . A variety of techniques exist that accomplish this task, with the most common technique used so far being Trotterization, which is a special case of the application of a product formula. However, other techniques exist that promise better asymptotic scaling in certain parameters of the theory being simulated, the most efficient of which are based on the concept of block encoding. In this work we study the performance of such algorithms in simulating lattice field theories. We derive and compare the asymptotic gate complexities of several commonly used simulation techniques in application to Hamiltonian lattice field theories. Using the scalar $\hat{φ}$ 4 theory as a test, we also perform numerical studies and compare the gate costs required by product formulas and signal-processing-based techniques to simulate time evolution. For the latter, we use the linear combination of unitaries (LCU) construction augmented with the quantum Fourier transform circuit to switch between the field and momentum eigenbases, which leads to immediate order-of-magnitude improvement in the cost of preparing the block encoding. Further, this paper also includes a pedagogical review of the techniques used, in particular product formulas, LCU, qubitization, quantum signal processing, as well as the technique for simulating geometrically-local Hamiltonians developed by Haah, Hastings, Kothari, and Low.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Quantifying the impact of precision errors on quantum approximate optimization algorithms

The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical algorithm that seeks to achieve approximate solutions to optimization problems by iteratively alternating between intervals of controlled quantum evolution. Here, we examine the effect of analog precision errors on QAOA performance from the perspective of both algorithmic training and performance guarantees. Leveraging cumulant expansions, we recast the faulty QAOA as a control problem in which precision errors are expressed as multiplicative control noise and derive bounds on the performance of QAOA. We show using both analytical techniques and numerical simulations that fixed precision implementations of QAOA circuits are subject to an exponential degradation in performance dependent upon the number of optimal QAOA layers and magnitude of the precision error. Despite this significant reduction, we show that it is possible to mitigate precision errors in QAOA via digitization of the variational parameters at the cost of increasing circuit depth.

quantum algorithms↗
DOE OSTI2023

Towards Quantum Computing Phase Diagrams of Gauge Theories with Thermal Pure Quantum States

The phase diagram of strong interactions in nature at finite temperature and chemical potential remains largely theoretically unexplored due to inadequacy of Monte-Carlo–based computational techniques in overcoming a sign problem. Quantum computing offers a sign-problem-free approach, but evaluating thermal expectation values is generally resource intensive on quantum computers. To facilitate thermodynamic studies of gauge theories, we propose a generalization of the thermal-pure-quantum-state formulation of statistical mechanics applied to constrained gauge-theory dynamics, and numerically demonstrate that the phase diagram of a simple low-dimensional gauge theory is robustly determined using this approach, including mapping a chiral phase transition in the model at finite temperature and chemical potential. Quantum algorithms, resource requirements, and algorithmic and hardware error analysis are further discussed to motivate future implementations. Thermal pure quantum states, therefore, may present a suitable candidate for efficient thermal simulations of gauge theories in the era of quantum computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Beam Spill in Downstream Transport due to Injector Faults [PowerPoint]

We have investigated injector faults with numerical experiments. For this investigation we used the nominal tune that is also being used to assess beam stability. Beam spill in the DST due to a serious injector fault was evaluated using the LSP slice algorithm. Only the most serious fault investigated (-350 keV) caused beam spill in the DST. DST transport focusing solenoids limit the beam spill. Beam spill in the DST is the result of large halo caused by betatron oscillations of the mismatched beam. Bremsstrahlung radiation from the DST beam spill was estimated from Tom Martin scaling normalized to DARHT-I. In conclusion, Scorpius is reasonably safe from beam spill radiation in the DST due to injector faults.

43 PARTICLE ACCELERATORS↗
DOE OSTI2022

Analytical Modeling of Exoplanet Transit Spectroscopy with Dimensional Analysis and Symbolic Regression

Abstract The physical characteristics and atmospheric chemical composition of newly discovered exoplanets are often inferred from their transit spectra, which are obtained from complex numerical models of radiative transfer. Alternatively, simple analytical expressions provide insightful physical intuition into the relevant atmospheric processes. The deep-learning revolution has opened the door for deriving such analytical results directly with a computer algorithm fitting to the data. As a proof of concept, we successfully demonstrate the use of symbolic regression on synthetic data for the transit radii of generic hot-Jupiter exoplanets to derive a corresponding analytical formula. As a preprocessing step, we use dimensional analysis to identify the relevant dimensionless combinations of variables and reduce the number of independent inputs, which improves the performance of the symbolic regression. The dimensional analysis also allowed us to mathematically derive and properly parameterize the most general family of degeneracies among the input atmospheric parameters that affect the characterization of an exoplanet atmosphere through transit spectroscopy.

79 ASTRONOMY AND ASTROPHYSICS↗
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 OSTI2025

A randomized sketching trust-region secant method for low-memory dynamic optimization

The numerical solution of dynamic optimization problems is often limited by the memory required to store the state trajectory, which is used to evaluate the objective function and its derivatives. Recently, [R. Muthukumar et al., SIAM Journal on Optimization 31(2), pp. 1242–1275 (2021)] introduced a trust-region method for dynamic optimization that employs randomized sketching to compress the state trajectory, resulting in inexact derivative computations. By adaptively learning the sketch rank, the trust-region algorithm achieves rigorous convergence guarantees. Here, we extend this approach to use secant Hessian approximations. Due to the randomness introduced by the sketch, the traditional secant update formulae can produce poor Hessian approximations. In particular, the difference of two gradients, computed from two different sketches, may be inconsistent. To overcome this, we employ a sketched approximation of the Hessian application, in lieu of computing the gradient difference. We numerically demonstrate the improved stability of this approach on an example from PDE-constrained optimization.

dynamic optimization↗
DOE OSTI2022

A phase-field model for quasi-dynamic nucleation, growth, and propagation of rate-and-state faults

Despite its critical role in the study of earthquake processes, numerical simulation of the entire stages of fault rupture remains a formidable task. The main challenges in simulating a fault rupture process include the complex evolution of fault geometry, frictional contact, and off-fault damage over a wide range of spatial and temporal scales. Here, in this paper, we develop a phase-field model for quasi-dynamic fault nucleation, growth, and propagation, which features two standout advantages: (i) it does not require any sophisticated algorithms to represent fault geometry and its evolution; and (ii) it allows for modeling fault nucleation, propagation, and off-fault damage processes with a single formulation. Built on a recently developed phase-field framework for shear fractures with frictional contact, the proposed formulation incorporates rate- and state-dependent friction, radiation damping, and their impacts on fault mechanics and off-fault damage. We show that the numerical results of the phase-field model are consistent with those obtained from well-verified approaches that model the fault as a surface of discontinuity, without suffering from the mesh convergence issue in the existing continuous approaches to fault rupture (e.g., the stress glut method). Further, through numerical examples of fault propagation in various settings, we demonstrate that the phase-field approach may open new opportunities for investigating complex earthquake processes that have remained overly challenging for the existing numerical methods.

58 GEOSCIENCES↗
DOE OSTI2021

Empirical performance bounds for quantum approximate optimization

The quantum approximate optimization algorithm (QAOA) has been put forth as a method for near-term quantum computers to solve optimization problems. However, assessments of QAOA performance have mostly focused on small structured problem instances while performance on more general instances is less clear. Here, we numerically simulate QAOA pure state dynamics for every instance of MaxCut on non-isomorphic unweighted graphs with nine or fewer vertices with depth parameters p ≤ 3. We find the approximation ratios and optimized circuit parameters concentrate across graphs of a given size and empirically show increases in concentration as graph size increases. The parameter concentration leads to two median-angle heuristics that overcome difficulties in QAOA parameter optimization and obtain mean approximation ratios within 3% and 0.2% of the optimal. We also analyze the probability to measure an optimal solution and find increasing variations between graphs as depth increases, in stark contrast to the approximation ratios which concentrate as depth increases. Furthermore, the resulting benchmark data set gives empirical bounds for on-going experimental realizations and lays groundwork for theoretical extensions to greater problem sizes and depths where QAOA may prove important for practically relevant problems.

79 ASTRONOMY AND ASTROPHYSICS↗