Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “POLYNOMIAL”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
NASA NTRS2013

Trajectory Optimization Using Adjoint Method and Chebyshev Polynomial Approximation for Minimizing Fuel Consumption During Climb

This paper describes two methods of trajectory optimization to obtain an optimal trajectory of minimum-fuel- to-climb for an aircraft. The first method is based on the adjoint method, and the second method is based on a direct trajectory optimization method using a Chebyshev polynomial approximation and cubic spine approximation. The approximate optimal trajectory will be compared with the adjoint-based optimal trajectory which is considered as the true optimal solution of the trajectory optimization problem. The adjoint-based optimization problem leads to a singular optimal control solution which results in a bang-singular-bang optimal control.

Chebyshev Polynomial↗
NASA NTRSDate not supplied

Field Reconstruction from PIV Measurements Employing Bernstein Polynomial Derived Operators

A fluid-dynamic reconstruction algorithm is presented that generates a least-squares best-fit, two-dimensional density field from a prespecified two-dimensional velocity field. This method recasts the mass-conservation equation as a modified Sylvester equation employing high-order operators derived from modified Bernstein polynomial expansions. To demonstrate its practical utility, this analytic methodology is applied to two canonical cases and a Particle Image Velocimetry dataset obtained from a Mach-2, mechanically back-pressured, isolator experiment. This methodology is envisioned to be used in conjunction with hypersonic-diagnostic techniques to aid in the quantification of isolator flow fields. However, also note that this reconstruction technique is well suited to other applications relevant to fluid dynamics, such as obtaining three-dimensional flow field reconstructions.

Bernstein Polynomials↗
NASA NTRS2023

On Hermite Interpolation using Bernstein Polynomials for Trajectory Generation

This work presents a solution to the two-point Hermite interpolation problem using Bernstein polynomials. The Hermite interpolation problem is of particular interest in aerospace applications where boundary conditions for trajectories often specify derivative constraints. In the examples shown, a trajectory will be generated between an initial condition and a final condition. For example, a trajectory is generated that connects an aircraft’s current position and velocity with a point on the runway at a desired landing velocity. The numerical stability of the proposed algorithms is analyzed empirically.

Bezier curves↗
DOE OSTI2016

Inverse Uncertainty Quantification of Reactor Simulation with Polynomial Chaos Surrogate Model

Reliable uncertainty quantification (UQ) and sensitivity analysis (SA) is significant part of modelling and simulation. This is particularly important in the nuclear community due to the fact that the licensing of nuclear installations has shifted from conservative to Best Estimate plus Uncertainty (BEPU) methodologies. UQ can be broadly classified as forward UQ and inverse UQ. Forward UQ is the process of quantifying the uncertainties in simulation outputs by propagating the uncertainties in input parameters. It requires knowledge in the input uncertainty, which is often specified by ad-hoc expert judgment which lacks mathematical rigor. The inverse UQ is the process to determine the uncertainty in input parameters given observations of the output. The purpose of this paper is to replace such ad-hoc expert judgment of the statistical properties of input model parameters in nuclear reactor simulation. This summary presents work on inverse UQ of a nonlinear Point Reactor Kinetics Equations - lumped thermal-hydraulics parameter coupled problem. Bayesian inference and Markov Chain Monte Carlo (MCMC) are used for the inverse UQ. Because MCMC requires a large number of simulations which is impractical for models that are computationally expensive, surrogate models is constructed by generalized Polynomial Chaos (PC) expansion technique. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2017

Application of Polynomial Chaos Expansion in One-Dimensional Inverse Transport Problems

In the problem of inverse radiation transport, measurements of particle leakages from radioactive source/shield systems are used to infer unknown parameters within the systems. This reconstruction can be accomplished by finding the physical parameters of the unknown system that minimize the difference between calculated detector responses and measured detector responses. The inverse transport solver should also propagate uncertainties from the detector responses to the reconstructed parameter values. Recently, the Differential Evolution Adaptive Metropolis (DREAM) method was shown to be a robust method for uncertainty quantification in inverse problems. The DREAM method uses the differential evolution algorithm to choose efficient steps in a Markov chain Monte Carlo (MCMC) simulation. Although the DREAM method has been shown to be more efficient than traditional MCMC approaches, it still requires thousands of transport computations to accurately quantify uncertainty. For the simple ray-tracing model, it was possible to perform these calculations in a reasonable amount of time (under an hour). However, inverse transport problems that require computationally-intensive transport solvers will need prohibitively long run times when using the DREAM method. A way to overcome the computational burden of the DREAM method is to perform surrogate modeling using the polynomial chaos expansion (PCE) approach. It was recently shown that the PCE method provides both accurate and computationally inexpensive uncertainty quantification in forward radiation source/shield problems. PCE was also recently applied to an inverse problem in nonlinear point reactor kinetics within a standard MCMC approach. PCE was first used with the DREAM method where it was applied to inverse problems in groundwater modeling.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2018

Entanglement entropy and the colored Jones polynomial

We study the multi-party entanglement structure of states in Chern-Simons theory created by performing the path integral on 3-manifolds with linked torus boundaries, called link complements. For gauge group SU(2), the wavefunctions of these states (in a particular basis) are the colored Jones polynomials of the corresponding links. We first review the case of U(1) Chern-Simons theory where these are stabilizer states, a fact we use to re-derive an explicit formula for the entanglement entropy across a general link bipartition. We then present the following results for SU(2) Chern-Simons theory: (i) The entanglement entropy for a bipartition of a link gives a lower bound on the genus of surfaces in the ambient S3 separating the two sublinks. (ii) All torus links (namely, links which can be drawn on the surface of a torus) have a GHZ-like entanglement structure — i.e., partial traces leave a separable state. By contrast, through explicit computation, we test in many examples that hyperbolic links (namely, links whose complements admit hyperbolic structures) have W-like entanglement — i.e., partial traces leave a non-separable state. (iii) Finally, we consider hyperbolic links in the complexified SL(2,C) Chern-Simons theory, which is closely related to 3d Einstein gravity with a negative cosmological constant. In the limit of small Newton constant, we discuss how the entanglement structure is controlled by the Neumann-Zagier potential on the moduli space of hyperbolic structures on the link complement.

't Hooft and Polyakov loops↗
DOE OSTI2025

Dirac traces and the Tutte polynomial

Perturbative calculations involving fermion loops in quantum field theories require tracing over Dirac matrices. A simple way to regulate the divergences that generically appear in these calculations is dimensional regularisation, which has the consequence of replacing 4-dimensional Dirac matrices with d-dimensional counterparts for arbitrary complex values of d. In this work, a connection between traces of d-dimensional Dirac matrices and computations of the Tutte polynomial of associated graphs is proven. The time complexity of computing Dirac traces is analysed by this connection, and improvements to algorithms for computing Dirac traces are proposed.

Renormalization and Regularization↗
DOE OSTI2022

Power counting energy flow polynomials

Power counting is a systematic strategy for organizing collider observables and their associated theoretical calculations. In this paper, we use power counting to characterize a class of jet substructure observables called energy flow polynomials (EFPs). EFPs provide an overcomplete linear basis for infrared-and-collinear safe jet observables, but it is known that in practice, a small subset of EFPs is often sufficient for specific jet analysis tasks. By applying power counting arguments, we obtain linear relationships between EFPs that hold for quark and gluon jets to a specific order in the power counting. We test these relations in the parton shower generator Pythia, finding excellent agreement. Power counting allows us to truncate the basis of EFPs without affecting performance, which we corroborate through a study of quark-gluon tagging and regression.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Exponential and Polynomial Decay in a Thermoelastic-Bresse System with Second Sound

In this paper we study the well-posedness and the asymptotic stability of a one-dimensional thermoelastic Bresse system, where the heat conduction is given by Cattaneo’s law effective in the shear angle displacements. We establish the well-posedness of the system and prove that the system is exponentially stable depending on the parameters of the system. Furthermore, we show that in general, the system is not exponential stable. In this regards, we prove that the solution decays polynomially.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

A discontinuous piecewise polynomial generalized moving least squares scheme for robust finite element analysis on arbitrary grids

A variational approach is developed with a meshless discretization to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. Here, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality, which we call discontinuous piecewise polynomial generalized moving least squares (DPP-GMLS). At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework, providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5 x improvement in accuracy and allows for taking an 8 x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Distributionally robust polynomial chance-constraints under mixture ambiguity sets

Given $\mathrm{X}\subset\mathbb{R}^n, ε \in (0,1)$, a parametrized family of probability distributions $(μ_a)_{a\in \mathrm{A}}$ on $\mathrm{Ω}\subset \mathbb{R}^p$, we consider the feasible set $\mathrm{X}^*_ε \subset\mathrm{X}$ associated with the distributionally robust chance-constraint $\mathrm{X}^*_ε = \mathrm{x \in X : Prob}_μ[f(\mathrm{x}, ω) >0] > 1 - ε, \forall μ \in \mathscr{M}_{\mathrm{a}}$}, where $\mathscr{M}_{\mathrm{a}}$ is the set of all possibles mixtures of distributions $μ_{\mathrm{a}}, \mathrm{a \in A}$. For instance and typically, the family $\mathscr{M}_{\mathrm{a}}$ is the set of all mixtures of Gaussian distributions on $\mathbb{R}$ with mean and standard deviation $\mathrm{a}=(a,σ)$ in some compact set $\mathrm{A}\subset \mathbb{R}^2$. We provide a sequence of inner approximations $\mathrm{X}^d_ε = {\mathrm{x \in X} : w_d(\mathrm{x}) < ε}, d \in \mathbb{N}$, where $w_d$ is a polynomial of degree d whose vector of coefficients is an optimal solution of a semidefinite program. The size of the latter increases with the degree d. We also obtain the strong and highly desirable asymptotic guarantee that $λ(\mathrm{X}^*_ε$\$\mathrm{X}^d_ε$) → 0 as d increases, where λ is the Lebesgue measure on X. Same results are also obtained for the more intricated case of distributionally robust “joint” chance-constraints. Finally, there is a price to pay for this strong asymptotic guarantee which is the scalability of such a numerical scheme, and so far this important drawback makes it limited to problems of modest dimension.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Quantitative Boltzmann–Gibbs Principles via Orthogonal Polynomial Duality

We study fluctuation fields of orthogonal polynomials in the context of particle systems with duality. We thereby obtain a systematic orthogonal decomposition of the fluctuation fields of local functions, where the order of every term can be quantified. This implies a quantitative generalization of the Boltzmann–Gibbs principle. In the context of independent random walkers, we complete this program, including also fluctuation fields in non-stationary context (local equilibrium). For other interacting particle systems with duality such as the symmetric exclusion process, similar results can be obtained, under precise conditions on the n particle dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

A Semi-Lagrangian Spectral Method for the Vlasov–Poisson System Based on Fourier, Legendre and Hermite Polynomials

In this study, we apply a semi-Lagrangian spectral method for the Vlasov–Poisson system, previously designed for periodic Fourier discretizations, by implementing Legendre polynomials and Hermite functions in the approximation of the distribution function with respect to the velocity variable. We discuss second-order accurate-in-time schemes, obtained by coupling spectral techniques in the space–velocity domain with a BDF time-stepping scheme. The resulting method possesses good conservation properties, which have been assessed by a series of numerical tests conducted on some standard benchmark problems including the two-stream instability and the Landau damping test cases. In the Hermite case, we also investigate the numerical behavior in dependence of a scaling parameter in the Gaussian weight. Confirming previous results from the literature, our experiments for different representative values of this parameter, indicate that a proper choice may significantly impact on accuracy, thus suggesting that suitable strategies should be developed to automatically update the parameter during the time-advancing procedure.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Data-driven projection pursuit adaptation of polynomial chaos expansions for dependent high-dimensional parameters

Uncertainty quantification (UQ) and inference involving a large number of parameters are valuable tools for problems associated with heterogeneous and non-stationary behaviors. The difficulty with these problems is exacerbated when these parameters are statistically dependent requiring statistical characterization over joint measures. Probabilistic modeling methodologies stand as effective tools in the realms of UQ and inference. Among these, polynomial chaos expansions (PCE), when adapted to low-dimensional quantities of interest (QoI), provide effective yet accurate approximations for these QoI in terms of an adapted orthogonal basis. These adaptation techniques have been cast as projection pursuits in Gaussian Hilbert space in what has been referred to as a projection pursuit adaptation (PPA) by Xiaoshu Zeng and Roger Ghanem (2023). The PPA method efficiently identifies an optimal low-dimensional space for representing the QoI and simultaneously evaluates an optimal PCE within that space. The quality of this approximation clearly depends on the size of the training dataset, which is typically a function of the adapted reduced dimension. Here, the complexity of the problem is thus mediated by the complexity of the low-dimensional quantity of interest and not the complexity of the high-dimensional parameter space.

Data-driven↗
DOE OSTI2022

Model calibration of the liquid mercury spallation target using evolutionary neural networks and sparse polynomial expansions

The mercury constitutive model predicting the strain and stress in the target vessel plays a central role in improving the lifetime prediction and future target designs of the mercury targets at the Spallation Neutron Source. We leverage the experiment strain data collected over multiple years to improve the mercury constitutive model through a combination of large scale simulations of the target behavior and the use of machine learning tools for parameter estimation. We present two interdisciplinary approaches for surrogate-based model calibration of expensive simulations using evolutionary neural networks and sparse polynomial expansions. The newly calibrated simulations achieve 7% average improvement on the prediction accuracy and 8% reduction in mean absolute error compared to previously reported reference parameters, with some individual sensors experiencing up to 30% improvement. The calibrated simulations can aid in fatigue analysis to estimate the mercury target lifetime, which reduces abrupt failure and saves tremendous amount of costs.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

Dynamic security assessment of systems powered only by grid-forming power plants with uncertain dispatch using polynomial vectors

A modern challenge in power engineering is to perform the dynamic security assessment (DSA) of grids that are 100% powered by inverter-based resources (IBRs). Addressing this challenge is difficult because: (i) the dispatch of IBRs can be uncertain as a result of the variability of renewable resources and (ii) they have hard current control limits that cannot be neglected, contrasting synchronous machines. To address this problem, this paper sets forth a framework to conduct DSA of bulk power systems that are 100% powered by grid-forming IBRs. Furthermore, the framework considers that IBR operational conditions are unknown but bounded by a zonotope which is also expressed as a polynomial vector for uncertainty propagation via Dormand–Prince integration. The framework is applied to modified versions of the WSCC 9-bus and IEEE 39-bus grids.

14 SOLAR ENERGY↗
DOE OSTI2021

Semi-Automated Creation of Density Functional Tight Binding Models through Leveraging Chebyshev Polynomial-Based Force Fields

Density functional tight binding (DFTB) is an attractive method for accelerated quantum simulations of condensed matter due to its enhanced computational efficiency over standard density functional theory (DFT) approaches. However, DFTB models can be challenging to determine for individual systems of interest, especially for metallic and interfacial systems where different bonding arrangements can lead to significant changes in electronic states. In this regard, we have created a rapid-screening approach for determining systematically improvable DFTB interaction potentials that can yield transferable models for a variety of conditions. Our method leverages a recent reactive molecular dynamics force field where many-body interactions are represented by linear combinations of Chebyshev polynomials. This allows for the efficient creation of multi-center representations with relative ease, requiring only a small investment in initial DFT calculations. Here, we have focused our workflow on TiH 2 as a model system and show that a relatively small training set based on unit-cell-sized calculations yields a model accurate for both bulk and surface properties. Our approach is easy to implement and can yield reliable DFTB models over a broad range of thermodynamic conditions, where physical and chemical properties can be difficult to interrogate directly and there is historically a significant reliance on theoretical approaches for interpretation and validation of experimental results.

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

Permutationally Invariant Polynomial Expansions with Unrestricted Complexity

A general strategy is presented for constructing and validating permutationally invariant polynomial (PIP) expansions for chemical systems of any stoichiometry. Demonstrations are made for three categories of gas-phase dynamics and kinetics: collisional energy-transfer trajectories for predicting pressure-dependent kinetics, three-body collisions for describing transient van der Waals adducts relevant to atmospheric chemistry, and nonthermal reactivity via quasiclassical trajectories. In total, 30 systems are considered with up to 15 atoms and 39 degrees of freedom. Permutational invariance is enforced in PIP expansions with as many as 13 million terms and 13 permutationally distinct atom types by taking advantage of petascale computational resources. The quality of the PIP expansions is demonstrated through the systematic convergence of in-sample and out-of-sample errors with respect to both the number of training data and the order of the expansion, and these errors are shown to predict errors in the dynamics for both reactive and nonreactive applications. Here, the parallelized code distributed as part of this work enables the automation of PIP generation for complex systems with multiple channels and flexible user-defined symmetry constraints and for automatically removing unphysical unconnected terms from the basis set expansions, all of which are required for simulating complex reactive systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗