Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Polynomial models”

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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Bayesian Estimation of the D(p,γ) 3 He Thermonuclear Reaction Rate

Big bang nucleosynthesis (BBN) is the standard model theory for the production of the light nuclides during the early stages of the universe, taking place for a period of about 20 minutes after the big bang. Deuterium production, in particular, is highly sensitive to the primordial baryon density and the number of neutrino species, and its abundance serves as a sensitive test for the conditions in the early universe. The comparison of observed deuterium abundances with predicted ones requires reliable knowledge of the relevant thermonuclear reaction rates, and their corresponding uncertainties. Recent observations reported the primordial deuterium abundance with percent accuracy, but some theoretical predictions based on BBN are at tension with the measured values because of uncertainties in the cross section of the deuterium-burning reactions. In this work, we analyze the S-factor of the D(p,γ) 3 He reaction using a hierarchical Bayesian model. We take into account the results of eleven experiments, spanning the period of 1955--2021; more than any other study. We also present results for two different fitting functions, a two-parameter function based on microscopic nuclear theory and a four-parameter polynomial. Furthermore, our recommended reaction rates have a 2.2\% uncertainty at 0.8~GK, which is the temperature most important for deuterium BBN. Differences between our rates and previous results are discussed.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Exponential acceleration of macroscopic quantum tunneling in a Floquet Ising model

The exponential suppression of macroscopic quantum tunneling (MQT) in the number of elements to be reconfigured is an essential element of broken symmetry phases. This suppression is also a core bottleneck in quantum algorithms, such as traversing an energy landscape in optimization, and adiabatic state preparation more generally. In this work, we demonstrate exponential acceleration of MQT through Floquet engineering with the application of a uniform, high frequency transverse drive field. Using the ferromagnetic phase of the transverse field Ising model in one and two dimensions as a prototypical example, we identify three phenomenological regimes as a function of drive strength. For weak drives, the system exhibits exponentially decaying tunneling rates but robust magnetic order; in the crossover regime at intermediate drive strength, we find polynomial decay of tunnelling alongside vanishing magnetic order; and at very strong drive strengths both the Rabi frequency and time-averaged magnetic order are approximately constant with increasing system size. We support these claims with extensive full wavefunction and tensor network numerical simulations, and theoretical analysis. An experimental test of these results presents a technologically important and novel scientific question accessible on NISQ-era quantum computers.

Grattan, George↗
DOE OSTI2022

Alternative approach to quantum imaginary time evolution

There is increasing interest in quantum algorithms (QAs) that are based on the imaginary time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy postprocessing computational steps on a classical computer, such as solving linear equations. Here we provide an alternative approach to implement ITE. A key feature in our approach is the use of an orthogonal basis set: the propagated state is efficiently expressed in terms of orthogonal basis states at every step of the evolution. We argue that the number of basis states needed at those steps to achieve an accurate solution can be kept on the order of n , the number of qubits, by controlling the precision (number of significant digits) and the imaginary time increment. The number of quantum gates per imaginary time step is estimated to be polynomial in n . Additionally, while in many QAs the locality of the Hamiltonian is a key assumption, in our algorithm this restriction is not required. This characteristic of our algorithm renders it useful for studying highly nonlocal systems, such as the occupation-representation nuclear shell model. Here, we illustrate our algorithm through numerical implementation on an IBM quantum simulator.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Projective Integral Updates for High-Dimensional Variational Inference

Variational inference is an approximation framework for Bayesian inference that seeks to improve quantified uncertainty in predictions by optimizing a simplified distribution over parameters to stand in for the full posterior. Capturing model variations that remain consistent with training data enables more robust predictions by reducing parameter sensitivity. This work introduces a fixed-point optimization for variational inference that is applicable when every feasible log density can be expressed as a linear combination of functions from a given basis. In such cases, the optimizer becomes a fixed-point of projective integral updates. When the basis spans univariate quadratics in each parameter, the feasible distributions are Gaussian mean-fields and the projective integral updates yield quasi-Newton variational Bayes (QNVB). Other bases and updates are also possible. Since these updates require high-dimensional integration, this work begins by proposing an efficient quasirandom sequence of quadratures for mean-field distributions. Each iterate of the sequence contains two evaluation points that combine to correctly integrate all univariate quadratic functions and, if the mean-field factors are symmetric, all univariate cubics. More importantly, averaging results over short subsequences achieves periodic exactness on a much larger space of multivariate polynomials of quadratic total degree. The corresponding variational updates require four loss evaluations with standard (not second-order) backpropagation to eliminate error terms from over half of all multivariate quadratic basis functions. Furthermore, this integration technique is motivated by first proposing stochastic blocked mean-field quadratures, which may be useful in other contexts. A PyTorch implementation of QNVB allows for better control over model uncertainty during training than competing methods. Experiments demonstrate superior generalizability for multiple learning problems and architectures.

Gaussian mean-field↗
DOE OSTI2022

Cutting Corners: Curvilinear-Surface-Based Gravity Models for Asteroids and Comets

We report that asteroids and comets are often highly irregular in shape and can contain large density inhomogenities. For such bodies, the simple point-mass gravity model does not capture the dynamics of the environment and this has driven a need for higher fidelity alternatives. A number of approaches have been developed with one of the most popular being the analytic polyhedral model. The analytic polyhedral model approximates the irregular shaped body as a polyhedron, typically consisting of triangular facets, with some assumed internal density distribution. Several analytic formulations have been derived for the gravitational fields of a constant-density polyhedron. A thorough history of the model is provided in Ref. [6] as well as a comparison of the implementations of Refs. [2–4]. The three versions provide near identical accuracy with the implementation of Werner requiring the fewest transcendental function evaluations suggesting its superior efficiency. Implementations with linear density contrasts and arbitrary polynomial density contrasts have also been developed.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Time-Resolved X-ray Operando Observations of Lithiation Gradients across the Cathode Matrix and Individual Oxide Particles during Fast Cycling of a Li-Ion Cell

Lithiated transition metal oxides serve as active materials in the positive electrode (cathode) of lithium-ion cells. During electrochemical cycling, lithium ions intercalate and deintercalate into these oxide particles. This behavior causes two types of lithiation gradients to emerge: (i) a bulk gradient across the depth of the cathode matrix (averaged over individual oxide particles) and (ii) a microscopic gradient across the particles themselves, which also depends on their location in the electrode. Here we show how both gradients can be studied using operando X-ray diffraction during 4C charge and 4C discharge. The oxide (de)lithiation is estimated from the unit cell parameters by indexing the X-ray diffraction spectra. By fitting the lithiation profiles with orthogonal polynomials, the bulk gradients across the electrode thickness are quantified. These gradients develop as the current flows through the cell and dissipate during open-circuit and potentiostatic-hold periods. Further details of lithiation dynamics can be obtained through shape analysis of the Bragg peaks. In particular, from electrochemical model simulations, we show that the width and skewness of the (003) peak track (de)lithiation fronts moving across the individual oxide particles.

(003) peak↗
DOE OSTI2023

Applying Quantum Computing to Simulate Power System Dynamics

Power system dynamics are generally modeled by high dimensional nonlinear differential-algebraic equations due to a large number of generators, loads, and transmission lines. Thus, its computational complexity grows exponentially with the system size. This paper demonstrates the potential use of quantum computing algorithms to model the power system dynamics. Leveraging a symbolic programming framework, we equivalently convert the power system dynamics’ differential algebraic equations (DAEs) into ordinary differential equations (ODEs), where the data of the state vector can be encoded into quantum computers via amplitude encoding. The system's nonlinearity is captured by Taylor polynomial expansion, the quantum state tensor, and Hamiltonian simulation, whereas state variables can be updated by a quantum linear equation solver. Our results show that quantum computing can simulate the dynamics of the power system with high accuracy, whereas its complexity is polynomial in the logarithm of the system dimension. Our work also illustrates the use of scientific machine learning tools for implementing scientific computing concepts, e.g., Taylor expansion, DAEs/ODEs transform, and quantum computing solver, in the field of power engineering.

Tran, Huynh↗
DOE OSTI2021

Complexity growth in integrable and chaotic models

We use the SYK family of models with N Majorana fermions to study the complexity of time evolution, formulated as the shortest geodesic length on the unitary group manifold between the identity and the time evolution operator, in free, integrable, and chaotic systems. Initially, the shortest geodesic follows the time evolution trajectory, and hence complexity grows linearly in time. We study how this linear growth is eventually truncated by the appearance and accumulation of conjugate points, which signal the presence of shorter geodesics intersecting the time evolution trajectory. By explicitly locating such “shortcuts” through analytical and numerical methods, we demonstrate that: (a) in the free theory, time evolution encounters conjugate points at a polynomial time; consequently complexity growth truncates at O($\sqrt{N}$), and we find an explicit operator which “fast-forwards” the free N-fermion time evolution with this complexity, (b) in a class of interacting integrable theories, the complexity is upper bounded by O(poly(N)), and (c) in chaotic theories, we argue that conjugate points do not occur until exponential times O(e N ), after which it becomes possible to find infinitesimally nearby geodesics which approximate the time evolution operator. Finally, we explore the notion of eigenstate complexity in free, integrable, and chaotic models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Results on elastic cross sections in proton–proton collisions at $\sqrt{s}$ = 510 GeV with the STAR detector at RHIC

We report results on an elastic cross section measurement in proton–proton collisions at a center-of-mass energy $\sqrt{s}$ = 510 GeV, obtained with the Roman Pot setup of the STAR experiment at the Relativistic Heavy Ion Collider (RHIC). The elastic differential cross section is measured in the four-momentum transfer squared range 0.23 ≤ −t ≤ 0.67 GeV 2 . This is the only measurement of the proton-proton elastic cross section in this t range for collision energies above the Intersecting Storage Rings (ISR) and below the Large Hadron Collider (LHC) colliders. We find that a constant slope B does not fit the data in the aforementioned t range, and we obtain a much better fit using a second-order polynomial for B(t). This is the first measurement below the LHC energies for which the non-constant behavior B(t) is observed. The t dependence of B is also determined using six subintervals of t in the STAR measured t range, and is in good agreement with the phenomenological models. The measured elastic differential cross section dσ/dt agrees well with the results obtained at $\sqrt{s}$ = 540 GeV for proton–antiproton collisions by the UA4 experiment. We also determine that the integrated elastic cross section within the STAR t-range is σ$^{fid}_{el}$ = 462.1 ± 0.9(stat.) ± 1.1(syst.) ± 11.6(scale) μb.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Coherency-Constrained Spectral Clustering for Power Network Reduction

This paper presents a methodology for reducing the complexity of large-scale power network models using spectral clustering, aggregation of electrical components, and cost function approximation. Two approaches are explored using unconstrained and constrained spectral clustering to determine areas for effective system reduction. Once the system areas are determined, both loads and generators by type are aggregated, and their new cost function is approximated through polynomial curve-fitting or statistical methods. The performance of reduced networks is evaluated in terms of their ability to follow the true daily cost of the original system over a 24-hour period considering a set of several days. Two test systems are taken as test beds. Application of the methodology to a modified version of the IEEE 39-bus system reduces it from 17 generators to a 4-bus system and 9 generators with about 93% of accuracy. Similarly, the IEEE 118-bus system is reduced from 19 generators to a 3-bus system with three aggregated units achieving over 99% of accuracy. These findings address scalability challenges and enhance accuracy for high and mid-loading level conditions, and by aggregating thermal units with similar cost functions.

42 ENGINEERING↗
DOE OSTI2021

Comprehensive Material Characterization and Simultaneous Model Calibration for Improved Computational Simulation Credibility

Computational simulation is increasingly relied upon for high-consequence engineering decisions, and a foundational element to solid mechanics simulations is a credible material model. Our ultimate vision is to interlace material characterization and model calibration in a real-time feedback loop, where the current model calibration results will drive the experiment to load regimes that add the most useful information to reduce parameter uncertainty. The current work investigated one key step to this Interlaced Characterization and Calibration (ICC) paradigm, using a finite load-path tree to incorporate history/path dependency of nonlinear material models into a network of surrogate models that replace computationally-expensive finite-element analyses. Our reference simulation was an elastoplastic material point subject to biaxial deformation with a Hill anisotropic yield criterion. Training data was generated using either a space-filling or adaptive sampling method, and surrogates were built using either Gaussian process or polynomial chaos expansion methods. Surrogate error was evaluated to be on the order of 10 ⁻5 and 10 ⁻3 percent for the space-filling and adaptive sampling training data, respectively. Direct Bayesian inference was performed with the surrogate network and with the reference material point simulator, and results agreed to within 3 significant figures for the mean parameter values, with a reduction in computational cost over 5 orders of magnitude. These results bought down risk regarding the surrogate network and facilitated a successful FY22-24 full LDRD proposal to research and develop the complete ICC paradigm.

36 MATERIALS SCIENCE↗
DOE OSTI2021

The impacts of convex piecewise linear cost formulations on AC optimal power flow

Despite strong connections through shared application areas, research efforts on power market optimization (e.g., unit commitment) and power network optimization (e.g., optimal power flow) remain largely independent. A notable illustration of this is the treatment of power generation cost functions, where nonlinear network optimization has largely used polynomial representations and market optimization has adopted piecewise linear encodings. This work combines state-of-the-art results from both lines of research to understand the best mathematical formulations of the nonlinear AC optimal power flow problem with piecewise linear generation cost functions. An extensive numerical analysis of non-convex models, linear approximations, and convex relaxations across fifty-four realistic test cases illustrates that nonlinear optimization methods are surprisingly sensitive to the mathematical formulation of piecewise linear functions. The results indicate that a poor formulation choice can slow down algorithm performance by a factor of ten, increasing the runtime from seconds to minutes. Furthermore, these results provide valuable insights into the best formulations of nonlinear optimal power flow problems with piecewise linear cost functions, an important step towards building a new generation of energy markets that incorporate the nonlinear AC power flow model.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2023

Recent Advances in PyROS: The Pyomo Solver for Two-Stage Nonconvex Robust Optimization

The slides present recent algorithmic and implementation advances of the two-stage robust optimization (RO) solver PyROS, and a benchmarking study which demonstrates the utility of PyROS for two-stage RO problems. The advances include extensions of the scope of PyROS to models with uncertain variable bounds, improvements to the initializations of the subproblems used by the underlying cutting set algorithm, and extensions of the uncertainty set interfaces. The benchmarking study is performed on a library of over 8,500 instances, with variations in the nonlinearities, degree-of-freedom partitioning, uncertainty sets, and polynomial decision rule approximations. Overall, the results highlight the effectiveness of PyROS for obtaining robust solutions to optimization problems with uncertain equality constraints.

Sherman, Jason↗
DOE OSTI2023

Recent Advances in PyROS: The Pyomo Solver for Two-Stage Nonconvex Robust Optimization

The slides present recent algorithmic and implementation advances of the two-stage robust optimization (RO) solver PyROS, and a benchmarking study which demonstrates the utility of PyROS for two-stage RO problems. The advances include extensions of the scope of PyROS to models with uncertain variable bounds, improvements to the initializations of the subproblems used by the underlying cutting set algorithm, and extensions of the uncertainty set interfaces. The benchmarking study is performed on a library of over 8,500 instances, with variations in the nonlinearities, degree-of-freedom partitioning, uncertainty sets, and polynomial decision rule approximations. Overall, the results highlight the effectiveness of PyROS for obtaining robust solutions to optimization problems with uncertain equality constraints.

Sherman, Jason↗
DOE OSTI2024

Verification of EvaluateFLux Utility Program

The EvaluateFlux program is a post-processing utility program for DIF3D, specifically DIF3D-VARIANT which handles Cartesian and hexagonal geometries. The EvaluateFlux program was developed to allow users to obtain flux and power traverses through the geometry domain, and its initial purpose was to facilitate foil analysis by evaluating the flux solution from DIF3D-VARIANT and combining it with foil cross section data. The EvaluateFlux program can calculate the neutron flux, as well as the reaction rates, at any user provided evaluation point. It does this by identifying the spatial mesh associated with the evaluation point and then evaluates the polynomial based neutron flux moments stored in the NHFLUX file at that point. The output of EvaluateFlux varies depending on the input setup. The maximum output includes the neutron flux and microscopic and macroscopic reaction rates at each evaluation point. The purpose of this work is to verify the outputs of EvaluateFlux. Simple models that have hand calculatable results are first defined and used to verify the EvaluateFlux outputs. More complex cases are then added where a duplicate program of EvaluateFlux that uses PrintTables outputs of the binary files is used to verify the EvaluateFlux outputs. In those complex cases, hand calculations of selected evaluation points were also displayed to confirm the software verification. For all the tests done, the hand calculations agreed well with those calculated by EvaluateFlux. For the larger complex problems, the duplicate program that can process hundreds of evaluation points was able to identify that zero points within some meshes have large errors. This aspect was attributed to the truncation error on the input provided to the duplicate program and is not a concern for the accuracy of the EvaluateFlux software.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Verification of the EvaluateFlux Utility Program

The EvaluateFlux program is a post-processing utility program for DIF3D, specifically DIF3D-VARIANT which handles Cartesian and hexagonal geometries. The EvaluateFlux program was developed to allow users to obtain flux and power traverses through the geometry domain, and its initial purpose was to facilitate foil analysis by evaluating the flux solution from DIF3D-VARIANT and combining it with foil cross section data. The EvaluateFlux program can calculate the neutron flux, as well as the reaction rates, at any user provided evaluation point. It does this by identifying the spatial mesh associated with the evaluation point and then evaluates the polynomial based neutron flux moments stored in the NHFLUX file at that point. The output of EvaluateFlux varies depending on the input setup. The maximum output includes the neutron flux and microscopic and macroscopic reaction rates at each evaluation point. The purpose of this work is to verify the outputs of EvaluateFlux. Simple models that have hand calculatable results are first defined and used to verify the EvaluateFlux outputs. More complex cases are then added where a duplicate program of EvaluateFlux that uses PrintTables outputs of the binary files is used to verify the EvaluateFlux outputs. In those complex cases, hand calculations of selected evaluation points were also displayed to confirm the software verification. For all the tests done, the hand calculations agreed well with those calculated by EvaluateFlux. For the larger complex problems, the duplicate program that can process hundreds of evaluation points was able to identify that zero points within some meshes have large errors. This aspect was attributed to the truncation error on the input provided to the duplicate program and is not a concern for the accuracy of the EvaluateFlux software.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Potential energy surfaces for high-energy N + O 2 collisions

Potential energy surfaces for high-energy collisions between an oxygen molecule and a nitrogen atom are useful for modeling chemical dynamics in shock waves. In the present work, we present doublet, quartet, and sextet potential energy surfaces that are suitable for studying collisions of O 2 ( 3 Σ$^{–}_{g}$) with N( 4 S) in the electronically adiabatic approximation. Two sets of surfaces are developed, one using neural networks (NNs) with permutationally invariant polynomials (PIPs) and one with the least-squares many-body (MB) method, where a two-body part is an accurate diatomic potential and the three-body part is expressed with connected PIPs in mixed-exponential-Gaussian bond order variables (MEGs). We find, using the same dataset for both fits, that the fitting performance of the PIP-NN method is significantly better than that of the MB-PIP-MEG method, even though the MB-PIP-MEG fit uses a higher-order PIP than those used in previous MB-PIP-MEG fits of related systems (such as N 4 and N 2 O 2 ). However, the evaluation of the PIP-NN fit in trajectory calculations requires about 5 times more computer time than is required for the MB-PIP-MEG fit.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗