Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “polynomial expansions”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Spectral density reconstruction with Chebyshev polynomials

Accurate calculations of the spectral density in a strongly correlated quantum many-body system are of fundamental importance to study its dynamics in the linear response regime. Typical examples are the calculation of inclusive and semiexclusive scattering cross sections in atomic nuclei and transport properties of nuclear and neutron star matter. Integral transform techniques play an important role in accessing the spectral density in a variety of nuclear systems. However, their accuracy is in practice limited by the need to perform a numerical inversion which is often ill-conditioned. Here, in the present work we extend a recently proposed quantum algorithm which circumvents this problem. We show how to perform controllable reconstructions of the spectral density over a finite energy resolution with rigorous error estimates. An appropriate expansion in Chebyshev polynomials allows for efficient simulations also on classical computers. We apply our idea to obtain the local density of states for graphene in a magnetic field as a proof of principle. This paves the way for future applications in nuclear and condensed matter physics.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

The effective number of parameters in kernel density estimation

We devise a new formula for measuring the effective degrees of freedom (EDoF) in kernel density estimation (KDE). Starting from the orthogonal polynomial sequence (OPS) expansion for the ratio of the empirical to the oracle density, we show how convolution with the kernel leads to a new OPS with respect to which one may express the resulting KDE. The expansion coefficients of the two OPS systems can then be related via a kernel sensitivity matrix, which leads to a natural oracle definition of EDoF through the trace operator. Asymptotic properties of the (empirical) plug-in EDoF are worked out through influence functions, and connections with other empirical EDoFs are established. Minimization of Kullback-Leibler divergence is investigated as an alternative to integrated squared error based bandwidth selection rules, yielding a new normal scale rule. The methodology, which arises from a proper oracle formulation and is not restricted to convolution kernels, suggests the possibility of a new bandwidth selection rule based on an information criterion such as AIC.

bandwidth selection↗
DOE OSTI2022

Real-space density kernel method for Kohn–Sham density functional theory calculations at high temperature

Kohn–Sham density functional theory calculations using conventional diagonalization based methods become increasingly expensive as temperature increases due to the need to compute increasing numbers of partially occupied states. In this work, we present a density matrix based method for Kohn–Sham calculations at high temperatures that eliminates the need for diagonalization entirely, thus reducing the cost of such calculations significantly. Specifically, we develop real-space expressions for the electron density, electronic free energy, Hellmann–Feynman forces, and Hellmann–Feynman stress tensor in terms of an orthonormal auxiliary orbital basis and its density kernel transform, the density kernel being the matrix representation of the density operator in the auxiliary basis. Using Chebyshev filtering to generate the auxiliary basis, we next develop an approach akin to Clenshaw–Curtis spectral quadrature to calculate the individual columns of the density kernel based on the Fermi operator expansion in Chebyshev polynomials and employ a similar approach to evaluate band structure and entropic energy components. We implement the proposed formulation in the SPARC electronic structure code, using which we show systematic convergence of the aforementioned quantities to exact diagonalization results, and obtain significant speedups relative to conventional diagonalization based methods. Finally, we employ the new method to compute the self-diffusion coefficient and viscosity of aluminum at 116 045 K from Kohn–Sham quantum molecular dynamics, where we find agreement with previous more approximate orbital-free density functional methods.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Physics-Informed Sparse Gaussian Process for Probabilistic Stability Analysis of Large-Scale Power System with Dynamic PVs and Loads

This work proposes a physics-informed sparse Gaussian process (SGP) for probabilistic stability assessment of large-scale power systems in the presence of uncertain dynamic PVs and loads. The differential and algebraic equations considering uncertainties from dynamic PVs and loads are reformulated to a nonlinear mapping relationship that allows the application of SGP. Thanks to the nonparametric characteristic of Gaussian process, the proposed framework does not require distributions of uncertain inputs and this distinguishes it from existing approaches. As the original Gaussian process is not scalable to large-scale systems with high dimensional uncertain inputs, this paper develops the SGP with a stochastic variational inference technique. It leads to approximately two orders of complex reduction. A data pre-processing step is also introduced to tackle the coexistence of stable and unstable cases by sample clustering and constructing separate SGPs. The probabilistic transient stability index is analyzed to assess system stability under different uncertain dynamics loads and PVs. Comparisons are performed with the sampling-based, the polynomial chaos expansion-based, and traditional Gaussian process-based methods on the modified IEEE 118-bus and Texas 2000-bus systems under various scenarios, including different levels of uncertainties and the existence of nonlinear correlations among dynamic PVs. The impacts of data quality and quantity issues are also investigated. It is shown that the proposed SGP achieves significantly improved computational efficiency while maintaining high accuracy with a limited number of data.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Electrochemical Modeling and Experimental Verification of Lithiation Gradients in Oxide Cathodes of Lithium-Ion Cells

Lithiated nickel-cobalt-manganese oxides, such as NCM523, are used in the positive electrode (cathode) of Li-ion cells. Using operando X-ray diffraction profilometry, lithiation gradients in the cathode matrix can be observed and quantified by expansion into Legendre polynomials with time-dependent weights. These weights (referred to as gradients) increase in magnitude when electric current flows through the cell, decrease during potentiostatic hold and finally relax to zero when the current is interrupted during open circuit rest. Both physics-based electrochemical models and operando X-ray experiments suggest that the time constants for gradient growth and abatement are primarily determined by ionic diffusion in the oxide particles, which in turn depends on their lithium content. In contrast, the magnitude of gradients depends mainly on the applied current. The X-ray profilometry provides a way of directly probing the formation and disappearance of Li gradients across the cathode during fast cycling, which can help to diagnose the effects of material degradation in the cells.

25 ENERGY STORAGE↗
DOE OSTI2025

A DATA EFFICIENT SPARSE MODELING FRAMEWORK FOR POWER ESTIMATION IN WATER TREATMENT SENSING OPERATIONS

With increasing freshwater scarcity, advanced process design mechanisms such as Closed-Circuit Reverse Osmosis (CCRO) and Digital/Physical Twin systems are gaining traction in water treatment and reuse operations. While digital and physical twin models enable improved system insight and control, their development is often expensive and computationally intensive, requiring large volumes of synthetic or experimental data to characterize underlying process dynamics. This work introduces a sparse surrogate modeling framework to estimate power consumption from measured flow and pressure variables, along with their nonlinear polynomial and interaction expansions. To ensure model reliability and reduce overfitting, a two-stage pipeline is proposed. First, a dynamic data filtering algorithm is employed to remove uninformative observations and transient operational states. Second, a sparse penalized regression technique is applied to select a minimal set of parsimonious features. The proposed model achieves high sparsity, retaining only 7 out of 34 candidate features (≈79.41% sparsity) while delivering a root mean square error (RMSE) of 0.072 on the test dataset.

Mukherjee, Subrata [ORNL] (ORCID:0000000309930338)↗
DOE OSTI2022

Verification of the LOTUS code with C5G7 benchmark

In this study, the verification of the neutron transport code LOTUS through the well-known C5G7 benchmark is performed. LOTUS uses the current coupled collision probability method with the expansion of the flux by orthogonal polynomials (CCCPO) for the solution of the neutron transport equation. The expansion of the flux by orthogonal polynomials allows one to avoid discretization of the calculation regions and significantly decreases the simulation time. The results of the LOTUS calculations are compared with the results of the reference OpenMC Monte Carlo simulations. The results of the comparison demonstrate almost perfect agreement with Monte-Carlo for the second order of the flux expansion. Even though the results obtained in the presented study agree well with the results of reference Monte Carlo calculations, further investigations are necessary for a better understanding of the stability and limitations of the code.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Systems and methods for approximating musculoskeletal dynamics

An approximation method and system are provided for more quickly controlling a prosthetic or other device by reducing computational processing time in a muscle model that can be used to control the prosthetic. For a given muscle, the approximation method can quickly compute polynomial structures for a muscle length and for each associated moment arms, which may be used to generate a torque for a joint position of a physics model. The physics model, in turn, produces a next joint position and velocity data for driving a prosthetic. The approximation method expands the polynomial structures as long as expansion is possible and sufficiently beneficial. The computations can be performed quickly by expanding the polynomial structures in a way that constrains the muscle length polynomial to the moment arm polynomial structures, and vice versa.

Sobinov, Anton↗
DOE OSTI2022

Semiclassical Trajectory Studies of Reactive and Nonreactive Scattering of OH( 2 Σ + ) by H 2 Based on an Improved Full-Dimensional Ab Initio Diabatic Potential Energy Matrix

Here we present a new full-dimensional diabatic potential energy matrix (DPEM) for electronically nonadiabatic collisions of OH(A 2 Σ + ) with H 2 , and we calculate the probabilities of electronically adiabatic inelastic collisions, nonreactive quenching, and reactive quenching to form H 2 O+H. The DPEM was fitted using a many-body expansion with permutationally invariant polynomials in bond-order functions to represent the many-body part. The dynamics calculations were carried out with the fewest-switches with time uncertainty and stochastic decoherence (FSTU/SD) semiclassical trajectory method. We present results both for head-on collisions (impact parameter b equal to zero) and for a full range of impact parameters. The results are compared to experiment and to earlier FSTU/SD and quantum dynamics calculations with a previously published DPEM. The various theoretical results all agree that nonreactive quenching dominates reactive quenching, but there are quantitative differences between the two DPEMs and between the b=0 results and the all-b results, especially for the probability of reactive quenching.

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

Bi-fidelity Gradient-Based Approach for Nonlinear Well Logging Inverse Problems

Solving a non-linear inverse problem is challenging in computational science and engineering. Sampling based methods require a large number of model valuations; gradientbased methods require fewer model evaluations but only find the local minima. Multifidelity optimization combines the low fidelity model and the high-fidelity model to achieve both high accuracy and high efficiency. In this paper, we present a bi-fidelity approach to solve non-linear inverse problems. In the bi-fidelity inversion method, the low-fidelity model is used to acquire a good initial guess, and the high-fidelity model is used to locate the global minimum. Combined with a multi-start optimization scheme, the proposed approach significantly increases the possibility of finding the global minimum for nonlinear inverse problems with many local minima. The method is tested with two toy problems and then applied to an electromagnetic well logging inverse problem, which is difficult to solve using traditional gradient-based methods. The bi-fidelity method provides promising inversion results and can be easily applied to traditional gradient-based methods.

42 ENGINEERING↗
DOE OSTI2022

Microstructure-Sensitive Uncertainty Quantification for Crystal Plasticity Finite Element Constitutive Models Using Stochastic Collocation Methods

Uncertainty quantification (UQ) plays a major role in verification and validation for computational engineering models and simulations, and establishes trust in the predictive capability of computational models. In the materials science and engineering context, where the process-structure-property-performance linkage is well known to be the only road mapping from manufacturing to engineering performance, numerous integrated computational materials engineering (ICME) models have been developed across a wide spectrum of length-scales and time-scales to relieve the burden of resource-intensive experiments. Within the structure-property linkage, crystal plasticity finite element method (CPFEM) models have been widely used since they are one of a few ICME toolboxes that allows numerical predictions, providing the bridge from microstructure to materials properties and performances. Several constitutive models have been proposed in the last few decades to capture the mechanics and plasticity behavior of materials. While some UQ studies have been performed, the robustness and uncertainty of these constitutive models have not been rigorously established. In this work, we apply a stochastic collocation (SC) method, which is mathematically rigorous and has been widely used in the field of UQ, to quantify the uncertainty of three most commonly used constitutive models in CPFEM, namely phenomenological models (with and without twinning), and dislocation-density-based constitutive models, for three different types of crystal structures, namely face-centered cubic (fcc) copper (Cu), body-centered cubic (bcc) tungsten (W), and hexagonal close packing (hcp) magnesium (Mg). Our numerical results not only quantify the uncertainty of these constitutive models in stress-strain curve, but also analyze the global sensitivity of the underlying constitutive parameters with respect to the initial yield behavior, which may be helpful for robust constitutive model calibration works in the future.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Time domain probabilistic seismic risk analysis using ground motion prediction equations of Fourier amplitude spectra

Modeling of Fourier amplitude spectra (FAS) of seismic motions has gained much attention in engineering seismology. In the past few years, several ground motion prediction equations (GMPEs) and inter-frequency correlation structure of FAS have been established. Due to many preferable characteristics of FAS, probabilistic seismic hazard/risk analysis is rapidly changing from ergodic, spectrum acceleration Sa(T 0 )-based approach to non-ergodic, site-specific, FAS-based approach. This paper presents time domain intrusive framework for probabilistic seismic risk analysis using GMPE of FAS. Herein, methodology for time domain stochastic ground motion modeling based on GMPEs of FAS is presented in some detail. The simulated uncertain motions are modeled as a random process and represented by polynomial chaos Karhunen-Loève expansion. The random process excitations are further propagated into the uncertain structural system using Galerkin stochastic finite element method (SFEM). Probabilistic evolution of structural response is solved, and such solution is used to develop seismic risk for any damage state. The presented framework is illustrated through seismic risk analysis of a four-story building subjected to possible earthquakes from two strike slip faults. The influences of the epistemic uncertainties in source stress drop Δσ and site attenuation κ0 on seismic risk are investigated. The need for non-ergodic seismic risk analysis with source-specific and site specific characterizations is emphasized.

58 GEOSCIENCES↗
DOE OSTI2025

Inference of response functions with the help of machine-learning algorithms

Response functions are a key quantity to describe the near-equilibrium dynamics of strongly interacting many-body systems. Recent techniques that attempt to overcome the challenges of calculating these ab initio have employed expansions in terms of orthogonal polynomials. We employ a neural network prediction algorithm to reconstruct a response function 𝑆⁡(𝜔) defined over a range in frequencies 𝜔. Here, we represent the calculated response function as a truncated Chebyshev series whose coefficients can be optimized to reduce the representation error. We compare the quality of response functions obtained using coefficients calculated using a neural network (NN) algorithm with those computed using the Gaussian integral transform (GIT) method. In the regime where only a small number of terms in the Chebyshev series are retained, we find that the NN scheme outperforms the GIT method.

Kurkcuoglu, Doga Murat [Fermi National Accelerator↗
DOE OSTI2024

Efficient Unitary Designs from Random Sums and Permutations

A unitary k-design is an ensemble of unitaries that matches the first k moments of the Haar measure. In this work, we provide two efficient constructions of k-designs on n-qubits using new random matrix theory techniques. Our first construction is based on exponentiating sums of random i.i.d. Hermitian matrices and uses O(k2n2)-many gates. In the spirit of central limit theorems, we show that this random sum approximates the Gaussian Unitary Ensemble (GUE). We then show that the product of just two exponentiated GUE matrices is already approximately Haar random. Our second construction is based on products of exponentiated sums of random permutations and uses Õ(k poly (n)) many gates. The k dependence is optimal (up to polylogarithmic factors) and is inherited from the efficiency of existing k-wise independent permutations. Furthermore, replacing random permutations with quantum-secure pseudorandom permutations (PRPs), we also obtain a pseudorandom unitary (PRU) ensemble that is secure under nonadaptive queries. A central feature of both proofs is a new connection between the polynomial method in quantum query complexity and the large-dimension (N) expansion in random matrix theory. In particular, the first construction uses the polynomial method to control high moments of certain random matrix ensembles without requiring delicate Weingarten calculations. In doing so, we define and solve a moment problem on the unit circle, asking whether a finite number of equally weighted points can reproduce a given set of moments. In our second construction, the key step is to exhibit an orthonormal basis for irreducible representations of the partition algebra that has a low-degree large-N expansion. This allows us to show that the distinguishing probability is a low-degree rational polynomial of the dimension N.

algebra↗
DOE OSTI2022

Spectral function for 4 He using the Chebyshev expansion in coupled-cluster theory

Here, we compute spectral function for 4 He by combining coupled-cluster theory with an expansion of integral transforms into Chebyshev polynomials. Our method allows us to estimate the uncertainty of spectral reconstruction. The properties of the Chebyshev polynomials make the procedure numerically stable and considerably lower in memory usage than the typically employed Lanczos algorithm. We benchmark our predictions with other calculations in the literature and with electron-scattering data in the quasi-elastic peak. The spectral function formalism allows one to extend ab initio lepton-nucleus cross sections into the relativistic regime. This makes it a promising tool for modeling this process at higher-energy transfers. The results we present open the door for studies of heavier nuclei, important for the neutrino oscillation programs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Optimising HEP Simulations on 3D Architecture: Primitive Gates for BT

In this report, the first attempt for an alternative approach for the simulation of the non-abelian group BT has been done. First, we analysed why SNAP and Displacement decomposition is not feasible for this problem with the current technology, and then we explored a new approach for the optimisation of the pulses. In particular, we studied how the expansion of the pulses in Chebyshev Polynomials could affect the optimisation process. Even if the study is not conclusive, we believe that it might be worth continuing to study this approach in the future, in order to be able to efficiently implement quantum circuits on computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Learning and meta-learning of stochastic advection–diffusion–reaction systems from sparse measurements

Physics-informed neural networks (PINNs) were recently proposed in [18] as an alternative way to solve partial differential equations (PDEs). A neural network (NN) represents the solution, while a PDE-induced NN is coupled to the solution NN, and all differential operators are treated using automatic differentiation. Here, we first employ the standard PINN and a stochastic version, sPINN, to solve forward and inverse problems governed by a non-linear advection–diffusion–reaction (ADR) equation, assuming we have some sparse measurements of the concentration field at random or pre-selected locations. Subsequently, we attempt to optimise the hyper-parameters of sPINN by using the Bayesian optimisation method (meta-learning) and compare the results with the empirically selected hyper-parameters of sPINN. In particular, for the first part in solving the inverse deterministic ADR, we assume that we only have a few high-fidelity measurements, whereas the rest of the data is of lower fidelity. Hence, the PINN is trained using a composite multi-fidelity network, first introduced in [12], that learns the correlations between the multi-fidelity data and predicts the unknown values of diffusivity, transport velocity and two reaction constants as well as the concentration field. For the stochastic ADR, we employ a Karhunen–Loève (KL) expansion to represent the stochastic diffusivity, and arbitrary polynomial chaos (aPC) to represent the stochastic solution. Correspondingly, we design multiple NNs to represent the mean of the solution and learn each aPC mode separately, whereas we employ a separate NN to represent the mean of diffusivity and another NN to learn all modes of the KL expansion. For the inverse problem, in addition to stochastic diffusivity and concentration fields, we also aim to obtain the (unknown) deterministic values of transport velocity and reaction constants. The available data correspond to 7spatial points for the diffusivity and 20 space–time points for the solution, both sampled 2000 times. We obtain good accuracy for the deterministic parameters of the order of 1–2% and excellent accuracy for the mean and variance of the stochastic fields, better than three digits of accuracy. In the second part, we consider the previous stochastic inverse problem, and we use Bayesian optimisation to find five hyper-parameters of sPINN, namely the width, depth and learning rate of two NNs for learning the modes. Here, we obtain much deeper and wider optimal NNs compared to the manual tuning, leading to even better accuracy, i.e., errors less than 1% for the deterministic values, and about an order of magnitude less for the stochastic fields.

97 MATHEMATICS AND COMPUTING↗