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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Adaptive surrogate modeling by ANOVA and sparse polynomial dimensional decomposition for global sensitivity analysis in fluid simulation

The Polynomial Dimensional Decomposition (PDD) is employed in this work for the global sensitivity analysis and uncertainty quantification (UQ) of stochastic systems subject to a moderate to large number of input random variables. Due to the intimate connection between the PDD and the Analysis of Variance (ANOVA) approaches, PDD is able to provide a simpler and more direct evaluation of the Sobol' sensitivity indices, when compared to the Polynomial Chaos expansion (PC). Unfortunately, the number of PDD terms grows exponentially with respect to the size of the input random vector, which makes the computational cost of standard methods unaffordable for real engineering applications. In order to address the problem of the curse of dimensionality, this work proposes essentially variance-based adaptive strategies aiming to build a cheap meta-model (i.e. surrogate model) by employing the sparse PDD approach with its coefficients computed by regression. Three levels of adaptivity are carried out in this paper: 1) the truncated dimensionality for ANOVA component functions, 2) the active dimension technique especially for second- and higher-order parameter interactions, and 3) the stepwise regression approach designed to retain only the most influential polynomials in the PDD expansion. During this adaptive procedure featuring stepwise regressions, the surrogate model representation keeps containing few terms, so that the cost to resolve repeatedly the linear systems of the least-squares regression problem is negligible. The size of the finally obtained sparse PDD representation is much smaller than the one of the full expansion, since only significant terms are eventually retained. Consequently, a much smaller number of calls to the deterministic model is required to compute the final PDD coefficients.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Generic expansion of the Jastrow correlation factor in polynomials satisfying symmetry and cusp conditions

Jastrow correlation factors play an important role in quantum Monte Carlo calculations. Together with an orbital based antisymmetric function, they allow the construction of highly accurate correlation wave functions. In this paper, a generic expansion of the Jastrow correlation function in terms of polynomials that satisfy both the electron exchange symmetry constraint and the cusp conditions is presented. In particular, an expansion of the three-body electron-electron-nucleus contribution in terms of cuspless homogeneous symmetric polynomials is proposed. The polynomials can be expressed in fairly arbitrary scaling function allowing a generic implementation of the Jastrow factor. It is demonstrated with a few examples that the new Jastrow factor achieves 85%–90% of the total correlation energy in a variational quantum Monte Carlo calculation and more than 90% of the diffusion Monte Carlo correlation energy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

More on rotations as spin matrix polynomials

Any nonsingular function of spin j matrices always reduces to a matrix polynomial of order 2j. The challenge is to find a convenient form for the coefficients of the matrix polynomial. The theory of biorthogonal systems is a useful framework to meet this challenge. Central factorial numbers play a key role in the theoretical development. Explicit polynomial coefficients for rotations expressed either as exponentials or as rational Cayley transforms are considered here. Structural features of the results are discussed and compared, and large j limits of the coefficients are examined.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

An asymptotic formula for polynomials orthonormal with respect to a varying weight. II

This paper gives a proof of the theorem announced by the authors in the preceding paper with the same title. The theorem states that asymptotically the behaviour of the polynomials which are orthonormal with respect to the varying weight e{sup −2nQ(x)}p{sub g}(x)/√(∏{sub j=1}{sup 2p}(x−e{sub j})) coincides with the asymptotic behaviour of the Nuttall psi-function, which solves a special boundary-value problem on the relevant hyperelliptic Riemann surface of genus g=p−1. Here e{sub 1}<e{sub 2}<⋯<e{sub 2p}, Q(x)=x{sup 2m}+⋯ is a monic polynomial of even degree 2m and p{sub g} is a certain auxiliary polynomial of degree p−1. Bibliography: 23 titles.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Gauges, loops, and polynomials for partition functions of graphical models

Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and optimization applications. The problem is #P-hard that is of an exponential complexity with respect to the number of variables. Here, aimed at approximating the partition function, we consider multi-graph models where binary variables and multivariable factors are associated with edges and nodes, respectively, of an undirected multi-graph. We suggest a new methodology for analysis and computations that combines the Gauge function technique from Chertkov and Chernyak with the technique developed in Anari and Oveis Gharan 2017 arXiv:1702.02937; Gurvits 2011 arXiv:1106.2844; Straszak and Vishnoi 2017 55th Annual Allerton Conf. on Communication, Control, and Computing, based on the recent progress in the field of real stable polynomials. We show that the Gauge function, representing a single-out term in a finite sum expression for the partition function which achieves extremum at the so-called belief-propagation gauge, has a natural polynomial representation in terms of gauges/variables associated with edges of the multi-graph. Moreover, Gauge function can be used to recover the partition function through a sequence of transformations allowing appealing algebraic and graphical interpretations. Algebraically, one step in the sequence consists of the application of a differential operator over gauges associated with an edge. Graphically, the sequence is interpreted as a repetitive elimination/contraction of edges resulting in multi-graph models on decreasing in size (number of edges) graphs with the same partition function as in the original multi-graph model. Even though the complexity of computing factors in the sequence of the derived multi-graph models and respective Gauge functions grow exponentially with the number of eliminated edges, polynomials associated with the new factors remain bi-stable if the original factors have this property. Moreover, we show that BP estimations in the sequence do not decrease, each low-bounding the partition function.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

SU-E-T-614: Derivation of Equations to Define Inflection Points and Its Analysis in Flattening Filter Free Photon Beams Based On the Principle of Polynomial function

Purpose: The objective of this work is to present a mechanism for calculating inflection points on profiles at various depths and field sizes and also a significant study on the percentage of doses at the inflection points for various field sizes and depths for 6XFFF and 10XFFF energy profiles. Methods: Graphical representation was done on Percentage of dose versus Inflection points. Also using the polynomial function, the authors formulated equations for calculating spot-on inflection point on the profiles for 6X FFF and 10X FFF energies for all field sizes and at various depths. Results: In a flattening filter free radiation beam which is not like in Flattened beams, the dose at inflection point of the profile decreases as field size increases for 10XFFF. Whereas in 6XFFF, the dose at the inflection point initially increases up to 10x10cm2 and then decreases. The polynomial function was fitted for both FFF beams for all field sizes and depths. For small fields less than 5x5 cm2 the inflection point and FWHM are almost same and hence analysis can be done just like in FF beams. A change in 10% of dose can change the field width by 1mm. Conclusion: The present study, Derivative of equations based on the polynomial equation to define inflection point concept is precise and accurate way to derive the inflection point dose on any FFF beam profile at any depth with less than 1% accuracy. Corrections can be done in future studies based on the multiple number of machine data. Also a brief study was done to evaluate the inflection point positions with respect to dose in FFF energies for various field sizes and depths for 6XFFF and 10XFFF energy profiles.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2019

Polynomial chaos expansions for dependent random variables

Polynomial chaos expansions (PCE) are well-suited to quantifying uncertainty in models parameterized by independent random variables. The assumption of independence leads to simple strategies for building multivariate orthonormal bases and for sampling strategies to evaluate PCE coefficients. In contrast, the application of PCE to models of dependent variables is much more challenging. Three approaches can be used to construct PCE of models of dependent variables. The first approach uses mapping methods where measure transformations, such as the Nataf and Rosenblatt transformation, can be used to map dependent random variables to independent ones; however we show that this can significantly degrade performance since the Jacobian of the map must be approximated. A second strategy is the class of dominating support methods. In these approaches a PCE is built using independent random variables whose distributional support dominates the support of the true dependent joint density; we provide evidence that this approach appears to produce approximations with suboptimal accuracy. A third approach, the novel method proposed here, uses Gram-Schmidt orthogonalization (GSO) to numerically compute orthonormal polynomials for the dependent random variables. This approach has been used successfully when solving differential equations using the intrusive stochastic Galerkin method, and in this paper we use GSO to build PCE using a non-intrusive stochastic collocation method. The stochastic collocation method treats the model as a black box and builds approximations of the input-output map from a set of samples. Building PCE from samples can introduce ill-conditioning which does not plague stochastic Galerkin methods. To mitigate this ill-conditioning we generate weighted Leja sequences, which are nested sample sets, to build accurate polynomial interpolants. We show that our proposed approach, GSO with weighted Leja sequences, produces PCE which are orders of magnitude more accurate than PCE constructed using mapping or dominating support methods.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1989

Chebyshev Polynomials Are Not Always Optimal

The authors are concerned with the problem of finding among all polynomials of degree at most n and normalized to be 1 at c the one with minimal uniform norm on Epsilon. Here, Epsilon is a given ellipse with both foci on the real axis and c is a given real point not contained in Epsilon. Problems of this type arise in certain iterative matrix computations, and, in this context, it is generally believed and widely referenced that suitably normalized Chebyshev polynomials are optimal for such constrained approximation problems. In this note, the authors show that this is not true in general. Moreover, the authors derive sufficient conditions which guarantee that Chebyshev polynomials are optimal. Also, some numerical examples are presented.

CHEBYSHEV APPROXIMATION↗
DOE OSTI2020

An efficient method to integrate polynomials over polytopes and curved solids

Here in this paper, we present an efficient approach to compute the integral of monomials and polynomials over polyhedra and regions defined by parametric curved boundary surfaces. We use Euler's theorem for homogeneous functions in combination with Stokes's theorem to reduce the integration of a monomial over a three-dimensional solid to its boundary. If the solid is a polytope, through a recursive application of these theorems, the integral is further reduced to just the evaluation of the monomial and its derivatives at the vertices of the polytope. The present approach is simpler than existing techniques that rely on repeated use of the divergence theorem, which require the antiderivative of the monomials and the projection of these functions onto hyperplanes. For convex and nonconvex polytopes, our approach does not introduce any approximation for the integration of monomials. For curved solid regions bounded by surfaces that admit a parameterization, the same approach yields simplified formulas to compute the integral of any homogeneous function, including monomials. For surfaces parameterized by polynomial surfaces (such as Bezier surface triangles and B-spline patches), the method yields machine-precision accuracy for the volumetric integration of monomials with an appropriate quadrature rule. Numerical examples over regions bounded by polynomial surfaces and rational surfaces are presented to establish the accuracy and efficiency of the method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Generation and application of multivariate polynomial quadrature rules

The search for multivariate quadrature rules of minimal size with a specified polynomial accuracy has been the topic of many years of research. Finding such a rule allows accurate integration of moments, which play a central role in many aspects of scientific computing with complex models. The contribution of this paper is twofold. First, we provide novel mathematical analysis of the polynomial quadrature problem that provides a lower bound for the minimal possible number of nodes in a polynomial rule with specified accuracy. We give concrete but simplistic multivariate examples where a minimal quadrature rule can be designed that achieves this lower bound, along with situations that showcase when it is not possible to achieve this lower bound. Our second contribution is the formulation of an algorithm that is able to efficiently generate multivariate quadrature rules with positive weights on non-tensorial domains. Our tests show success of this procedure in up to 20 dimensions. We test our method on applications to dimension reduction and chemical kinetics problems, including comparisons against popular alternatives such as sparse grids, Monte Carlo and quasi Monte Carlo sequences, and Stroud rules. The quadrature rules computed in this paper outperform these alternatives in almost all scenarios.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

A comparison of Redlich-Kister polynomial and cubic spline representations of the chemical potential in phase field computations

Free energies play a central role in many descriptions of equilibrium and non-equilibrium properties of solids. Continuum partial differential equations (PDEs) of atomic transport, phase transformations and mechanics often rely on first and second derivatives of a free energy function. The stability, accuracy and robustness of numerical methods to solve these PDEs are sensitive to the particular functional representations of the free energy. In this communication we investigate the influence of different representations of thermodynamic data on phase field computations of diffusion and two-phase reactions in the solid state. First-principles statistical mechanics methods were used to generate realistic free energy data for HCP titanium with interstitially dissolved oxygen. While Redlich-Kister polynomials have formed the mainstay of thermodynamic descriptions of multi-component solids, they require high order terms to fit oscillations in chemical potentials around phase transitions. Here, we demonstrate that high fidelity fits to rapidly fluctuating free energy functions are obtained with spline functions. As a result, spline functions that are many degrees lower than Redlich-Kister polynomials provide equal or superior fits to chemical potential data and, when used in phase field computations, result in solution times approaching an order of magnitude speed up relative to the use of Redlich-Kister polynomials.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Quantum annealing for systems of polynomial equations

Abstract Numerous scientific and engineering applications require numerically solving systems of equations. Classically solving a general set of polynomial equations requires iterative solvers, while linear equations may be solved either by direct matrix inversion or iteratively with judicious preconditioning. However, the convergence of iterative algorithms is highly variable and depends, in part, on the condition number. We present a direct method for solving general systems of polynomial equations based on quantum annealing, and we validate this method using a system of second-order polynomial equations solved on a commercially available quantum annealer. We then demonstrate applications for linear regression, and discuss in more detail the scaling behavior for general systems of linear equations with respect to problem size, condition number, and search precision. Finally, we define an iterative annealing process and demonstrate its efficacy in solving a linear system to a tolerance of 10 −8 .

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Permutation invariant polynomial neural network based diabatic ansatz for the ( E + A ) × ( e + a ) Jahn–Teller and Pseudo-Jahn–Teller systems

In this work, the permutation invariant polynomial neural network (PIP-NN) approach is employed to construct a quasi-diabatic Hamiltonian for system with non-Abelian symmetries. It provides a flexible and compact NN-based diabatic ansatz from the related approach of Williams, Eisfeld, and co-workers. The example of $H^3_+$ is studied, which is an (E + A) × (e + a) Jahn–Teller and Pseudo-Jahn–Teller system. The PIP-NN diabatic ansatz is based on the symmetric polynomial expansion of Viel and Eisfeld, the coefficients of which are expressed with neural network functions that take permutation-invariant polynomials as input. This PIP-NN-based diabatic ansatz not only preserves the correct symmetry but also provides functional flexibility to accurately reproduce ab initio electronic structure data, thus resulting in excellent fits. Further, the adiabatic energies, energy gradients, and derivative couplings are well reproduced. A good description of the local topology of the conical intersection seam is also achieved. Therefore, this diabatic ansatz completes the PIP-NN based representation of DPEM with correct symmetries and will enable us to diabatize even more complicated systems with complex symmetries.

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

Spin-projected generalized Hartree-Fock method as a polynomial of particle-hole excitations

The past several years have seen renewed interest in the use of symmetry-projected Hartree-Fock for the description of strong correlations. Unfortunately, these symmetry-projected mean-field methods do not adequately account for dynamic correlation. Presumably, this shortcoming could be addressed if one could combine symmetry-projected Hartree-Fock with a many-body method such as coupled-cluster theory, but this is by no means straightforward because the two techniques are formulated in very different ways. However, we have recently shown that the singlet S 2 -projected unrestricted Hartree-Fock wave function can in fact be written in a coupled-cluster-like wave function. That is, the spin-projected unrestricted Hartree-Fock wave function can be written as a polynomial of a double-excitation operator acting on some closed-shell reference determinant. Here, we extend this result and show that the spin-projected generalized Hartree-Fock wave function (which has both S 2 and S z projection) is likewise a polynomial of low-order excitation operators acting on a closed-shell determinant and provide a closed-form expression for the resulting polynomial coefficients. The spin projection of the generalized Hartree-Fock wave function introduces connected triple and quadruple excitations which are absent when spin-projecting an unrestricted Hartree-Fock determinant. We include a few preliminary applications of the combination of this spin-projected Hartree-Fock and coupled-cluster theory to the Hubbard Hamiltonian and comment on generalizations of the methodology. Results here are not for production level, but a similarity-transformed theory that combines the two offers the promise of being accurate for both weak and strong correlation, and may offer significant improvements in the intermediate correlation regime where neither projected Hartree-Fock nor coupled cluster is particularly accurate.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2025

A Polynomial-Time Classical Algorithm for Noisy Quantum Circuits

We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g., the computational basis). Our approach is based upon the intuition that noise exponentially damps nonlocal correlations relative to local correlations. This enables one to classically simulate a noisy quantum circuit by keeping track of only the dynamics of local quantum information. Our algorithm also enables sampling from the output distribution of a circuit in quasipolynomial time, so long as the distribution anticoncentrates. A number of implications are discussed, including a fundamental limit on the efficacy of noise mitigation strategies: For constant noise rates, any quantum circuit for which error mitigation succeeds in polynomial-time on most input states can also be classically simulated in polynomial-time on most input states. Our algorithms scale exponentially in the inverse noise rate, which is fundamental and makes them impractical for current quantum devices.

decoherence↗
DOE OSTI2026

Direct Nonlinear Approximation for Security Region Boundary of Integrated Energy Systems: A Polynomial Chaos Expansion Solution

The strong interdependence of electricity, gas, and heating systems can facilitate fault propagation within integrated energy systems (IESs), posing significant challenges to secure operation. This paper proposes a polynomial chaos expansion (PCE)-based approximation method to accurately characterize the IES security region boundary (IES–SRB). By integrating the Karush-Kuhn-Tucker conditions with PCE theory, the IES-SRB approximation problem is reformulated as a set of nonlinear equations concerning the approximation coefficients. Using the Galerkin projection method, these equations are further transformed into a system of projection equations that govern the polynomial approximation coefficients in the IES-SRB approximation. To reduce computational complexity while maintaining high approximation accuracy, a piecewise polynomial approximation method is proposed. Numerical studies on the E39-G20-H6 and E118-G96-H52 IES test systems demonstrate that the proposed method can accurately and effectively construct IES security regions.

Wu, Chenghao [Northeast Electric Power University]↗
DOE OSTI2022

Uncertainty reduction in residual stress measurements by an optimised inverse solution using nonconsecutive polynomials

Many destructive methods for measuring residual stresses such as the slitting method require an inverse analysis to solve the problem. The accuracy of the result as well as an uncertainty component (the model uncertainty) depends on the basis functions used in the inverse solution. The use of a series expansion as the basis functions for the inverse solution was analysed in a previous work for the particular case where functions orders grew consecutively. The present work presents a new estimation of the model uncertainty and a new improved methodology to select the final basis functions for the case where the basis is composed of polynomials. Including nonconsecutive polynomial orders in the basis generates a larger space of possible solutions to be evaluated and allows the possibility to include higher-order polynomials. The paper includes a comparison with two other inverse analyses methodologies applied to synthetically generated data. With the new methodology, the final error is reduced and the uncertainty estimation improved.

36 MATERIALS SCIENCE↗
DOE OSTI2015

Local polynomial chaos expansion for linear differential equations with high dimensional random inputs

In this paper we present a localized polynomial chaos expansion for partial differential equations (PDE) with random inputs. In particular, we focus on time independent linear stochastic problems with high dimensional random inputs, where the traditional polynomial chaos methods, and most of the existing methods, incur prohibitively high simulation cost. Furthermore, the local polynomial chaos method employs a domain decomposition technique to approximate the stochastic solution locally. In each subdomain, a subdomain problem is solved independently and, more importantly, in a much lower dimensional random space. In a postprocesing stage, accurate samples of the original stochastic problems are obtained from the samples of the local solutions by enforcing the correct stochastic structure of the random inputs and the coupling conditions at the interfaces of the subdomains. Overall, the method is able to solve stochastic PDEs in very large dimensions by solving a collection of low dimensional local problems and can be highly efficient. In our paper we present the general mathematical framework of the methodology and use numerical examples to demonstrate the properties of the method.

97 MATHEMATICS AND COMPUTING↗