Search NASA⌕ Search

SEARCH · Search NASA

Results for “Orthogonal polynomials”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

To the Theory of C{sub 0}-Operator Orthogonal Polynomials

Operator orthogonal polynomials are considered whose arguments are generators of strongly continuous semigroups of transformations of class C{sub 0} acting in a Banach space. Earlier such polynomials were considered by the authors in the case of the Chebyshev polynomials of the first and second kind. In this paper, more general classes of operator orthogonal polynomials are considered, which include the Jacobi and Aptekarev polynomials. Integral representations of operator fractional-rational functions and also of Bessel operator-valued functions of an imaginary argument are presented.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Orthogonal Polynomials Defined by Self-Similar Measures with Overlaps

Here, we study orthogonal polynomials with respect to self-similar measures, focusing on the class of infinite Bernoulli convolutions, which are defined by iterated function systems with overlaps, especially those defined by the Pisot, Garsia, and Salem numbers. By using an algorithm of Mantica, we obtain graphs of the coefficients of the 3-term recursion relation defining the orthogonal polynomials. We use these graphs to predict whether the singular infinite Bernoulli convolutions belong to the Nevai class. Based on our numerical results, we conjecture that all infinite Bernoulli convolutions with contraction ratios greater than or equal to 1/2 belong to Nevai’s class, regardless of the probability weights assigned to the self-similar measures.

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 OSTI2018

The Basics of Orthogonal Polynomials

To understand the mathematics behind Uncertainty Quantification (UQ), one first needs to understand the basics of orthogonal polynomials, which this report covers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Floquet operator dynamics and orthogonal polynomials on the unit circle

Operator spreading under stroboscopic time evolution under a unitary is studied. An operator Krylov space is constructed and mapped to orthogonal polynomials on a unit circle (OPUC), as well as to the Krylov space of the edge operator of the Floquet transverse field Ising model with inhomogeneous couplings (ITFIM). The Verblunsky coefficients in the OPUC representation are related to the Krylov angles parametrizing the ITFIM. The relations between the OPUC and spectral functions are summarized and several applications are presented. These include derivation of analytic expressions for the OPUC under persistent m-periodic dynamics, and the numerical construction of the OPUC for autocorrelations of the homogeneous Floquet-Ising model as well as the Z 3 clock model. The numerically obtained Krylov angles of the Z 3 clock model with long-lived period tripled autocorrelations show a spatial periodicity of six, and this observation is used to develop an analytically solvable model for the ITFIM that mimics this behavior.

Floquet systems↗
DOE OSTI2018

Algebraic calculations for spectrum of superintegrable system from exceptional orthogonal polynomials

We introduce an extended Kepler–Coulomb quantum model in spherical coordinates. The Schrödinger equation of this Hamiltonian is solved in these coordinates and it is shown that the wave functions of the system can be expressed in terms of Laguerre, Legendre and exceptional Jacobi polynomials (of hypergeometric type). We construct ladder and shift operators based on the corresponding wave functions and obtain their recurrence formulas. These recurrence relations are used to construct higher-order, algebraically independent integrals of motion to prove superintegrability of the Hamiltonian. The integrals form a higher rank polynomial algebra. By constructing the structure functions of the associated deformed oscillator algebras we derive the degeneracy of energy spectrum of the superintegrable system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

The CMV Matrix and the Generalized Lanczos Process

The CMV matrix is the five-diagonal matrix that represents the operator of multiplication by the independent variable in a special basis formed of Laurent polynomials orthogonal on the unit circle C. The article by Cantero, Moral, and Velázquez, published in 2003 and describing this matrix, has attracted much attention because it implies that the conventional orthogonal polynomials on C can be interpreted as the characteristic polynomials of the leading principal submatrices of a certain five-diagonal matrix. The present paper recalls that finite-dimensional sections of the CMV matrix appeared in papers on the unitary eigenvalue problem long before the article by Cantero et al. was published. Moreover, band forms were also found for a number of other situations in the normal eigenvalue problem.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2017

A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions

We propose an algorithm for recovering sparse orthogonal polynomial expansions via collocation. A standard sampling approach for recovering sparse polynomials uses Monte Carlo sampling, from the density of orthogonality, which results in poor function recovery when the polynomial degree is high. Our proposed approach aims to mitigate this limitation by sampling with respect to the weighted equilibrium measure of the parametric domain and subsequently solves a preconditioned $\ell^1$-minimization problem, where the weights of the diagonal preconditioning matrix are given by evaluations of the Christoffel function. Our algorithm can be applied to a wide class of orthogonal polynomial families on bounded and unbounded domains, including all classical families. We present theoretical analysis to motivate the algorithm and numerical results that show our method is superior to standard Monte Carlo methods in many situations of interest. In conclusion, numerical examples are also provided to demonstrate that our proposed algorithm leads to comparable or improved accuracy even when compared with Legendre- and Hermite-specific algorithms.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2018

Fifth-kind orthonormal Chebyshev polynomial solutions for fractional differential equations

The principal aim of the current paper is to present and analyze two new spectral algorithms for solving some types of linear and nonlinear fractional-order differential equations. The proposed algorithms are obtained by utilizing a certain kind of shifted Chebyshev polynomials called the shifted fifth-kind Chebyshev polynomials as basis functions along with the application of a modified spectral tau method. The class of fifth-kind Chebyshev polynomials is a special class of a basic class of symmetric orthogonal polynomials which are constructed with the aid of the extended Sturm–Liouville theorem for symmetric functions. An investigation for the convergence and error analysis of the proposed Chebyshev expansion is performed. For this purpose, a new connection formulae between Chebyshev polynomials of the first and fifth kinds are derived. The obtained numerical results ascertain that our two proposed algorithms are applicable, efficient and accurate.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

A superintegrable discrete harmonic oscillator based on bivariate Charlier polynomials

A simple discrete model of the two-dimensional isotropic harmonic oscillator is presented. It is superintegrable with su(2) as its symmetry algebra. It is constructed with the help of the algebraic properties of the bivariate Charlier polynomials. This adds to the other discrete superintegrable models of the oscillator based on Krawtchouk and Meixner orthogonal polynomials in several variables.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

A dynamical polynomial chaos approach for long-time evolution of SPDEs

We propose a Dynamical generalized Polynomial Chaos (DgPC) method to solve time-dependent stochastic partial differential equations (SPDEs) with white noise forcing. The long-time simulation of SPDE solutions by Polynomial Chaos (PC) methods is notoriously difficult as the dimension of the stochastic variables increases linearly with time. Exploiting the Markovian property of white noise, DgPC implements a restart procedure that allows us to expand solutions at future times in terms of orthogonal polynomials of the measure describing the solution at a given time and the future white noise. The dimension of the representation is kept minimal by application of a Karhunen–Loeve (KL) expansion. Using frequent restarts and low degree polynomials on sparse multi-index sets, the method allows us to perform long time simulations, including the calculation of invariant measures for systems which possess one. We apply the method to the numerical simulation of stochastic Burgers and Navier–Stokes equations with white noise forcing. Our method also allows us to incorporate time-independent random coefficients such as a random viscosity. We propose several numerical simulations and show that the algorithm compares favorably with standard Monte Carlo methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Modified GMDH-NN algorithm and its application for global sensitivity analysis

Global sensitivity analysis (GSA) is a very useful tool to evaluate the influence of input variables in the whole distribution range. Sobol' method is the most commonly used among variance-based methods, which are efficient and popular GSA techniques. High dimensional model representation (HDMR) is a popular way to compute Sobol' indices, however, its drawbacks cannot be ignored. We show that modified GMDH-NN algorithm can calculate coefficients of metamodel efficiently, so this paper aims at combining it with HDMR and proposes GMDH-HDMR method. The new method shows higher precision and faster convergent rate. Several numerical and engineering examples are used to confirm its advantages. - Highlights: • The GMDH-NN is improved to construct the explicit polynomial model of optimal complexity by self-organization. • The paper aims at combining improved GMDH-NN with HDMR expansions and using it to compute Sobol' indices directly. • The method can be applied in uniform, normal and exponential distribution by using suitable orthogonal polynomials. • Engineering examples, e.g., electronic circuit models can be solved by the presented method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Adaptive sparse polynomial dimensional decomposition for derivative-based sensitivity

In this report applications, such as the plasma-coupled combustion system we consider, derivative-based sensitivity indices (DSI) are known to have several advantages over Sobol's total sensitivity indices, especially for small sample sizes. Several properties of derivative-based sensitivity measures are leveraged to develop a new and efficient numerical approach to estimate them. It is based on computing the DSI measures by effectively cost-free Monte Carlo sampling of an adaptively constructed orthogonal polynomial surrogate with uncertain input parameters that can have arbitrary probability distributions. The adaptivity reduces the number of necessary model evaluations, which is demonstrated both in a constructed example (the Moon function) and in two plasma-combustion systems with up to 55 uncertain parameters. Unimportant parameters are successfully identified and neglected with a low number of model evaluations, which makes it an attractive non-intrusive approach when adjoint solutions are unavailable to provide sensitivity information.

42 ENGINEERING↗
DOE OSTI2024

Perturbative unorientable JT gravity and matrix models

We consider an orthogonal polynomial formulation of the double scaling limit of multicritical matrix models in the β = 1 Dyson-Wigner class. They capture the physics of 2D quantum gravity coupled to minimal matter on unorientable surfaces, otherwise called unoriented minimal strings. We derive a formula for the density of states valid to all orders in perturbation theory. We show how to define an interpolation between the multicritical models and that a certain interpolation among an infinite number of them provides an alternative definition of unoriented JT gravity. We discuss the strengths and weaknesses of our formulation.

1/N Expansion↗
DOE OSTI2020

Spectral fluctuations in the Sachdev-Ye-Kitaev model

We present a detailed quantitative analysis of spectral correlations in the Sachdev-Ye-Kitaev (SYK) model. We find that the deviations from universal Random Matrix Theory (RMT) behavior are due to a small number of long-wavelength fluctuations (of the order of the number of Majorana fermions N ) from one realization of the ensemble to the next one. These modes can be parameterized effectively in terms of Q-Hermite orthogonal polynomials, the main contribution being due to scale fluctuations for which we give a simple analytical estimate. Our numerical results for N = 32 show that only the lowest eight polynomials are needed to eliminate the nonuniversal part of the spectral fluctuations. The covariance matrix of the coefficients of this expansion can be obtained analytically from low-order double-trace moments. We evaluate the covariance matrix of the first six moments and find that it agrees with the numerics. We also analyze the spectral correlations in terms of a nonlinear σ-model, which is derived through a Fierz transformation, and evaluate the one and two-point spectral correlation functions to two-loop order. The wide correlator is given by the sum of the universal RMT result and corrections whose lowest-order term corresponds to scale fluctuations. However, the loop expansion of the σ-model results in an ill-behaved expansion of the resolvent, and it gives universal RMT fluctuations not only for q= 4 or higher even q-body interactions, but also for the q= 2 SYK model albeit with a much smaller Thouless energy while the correct result in this case should have been Poisson statistics. In our numerical studies we analyze the number variance and spectral form factor for N = 32 and q = 4. We show that the quadratic deviation of the number variance for large energies appears as a peak for small times in the spectral form factor. After eliminating the long-wavelength fluctuations, we find quantitative agreement with RMT up to an exponentially large number of level spacings for the number variance or exponentially short times in the case of the spectral form factor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Two-Dimensional Mixed Problem of Thermoelasticity for a Semistrip

We study the stress state of a semistrip with conditions of smooth contact imposed on one of its lateral surfaces and coupling conditions given on the other surface under the action of normal loading and temperature on the end face. The original problem is reduced to a one-dimensional vector boundary-value problem by the method of integral transformations. By using the tools of matrix differential calculus and Green matrix function, we reduce the obtained problem to a singular integral equation for the derivative of displacements on the end face of the semistrip and solve this equation by the method of orthogonal polynomials. We perform the numerical analysis of fields of displacements and stresses inside the semistrip and establish the zones of tensile stresses on the lateral face of the semistrip and the conditions of their formation.

42 ENGINEERING↗