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 217 records · Page 12

Orthogonality of spherical harmonic coefficients

Orthogonality relations are obtained for the spherical harmonic coefficients of functions defined on the surface of a sphere. Following a brief discussion of the orthogonality of Fourier series coefficients, consideration is given to the values averaged over all orientations of the coordinate system of the spherical harmonic coefficients of a function defined on the surface of a sphere that can be expressed in terms of Legendre polynomials for the special case where the function is the sum of two delta functions located at two different points on the sphere, and for the case of an essentially arbitrary function. It is noted that the orthogonality relations derived have found applications in statistical studies of the geomagnetic field.

Mcleod, M. G.↗

Lifting q-difference operators for Askey-Wilson polynomials and their weight function

We determine an explicit form of a q-difference operator that transforms the continuous q-Hermite polynomials H{sub n}(x | q) of Rogers into the Askey-Wilson polynomials p{sub n}(x; a, b, c, d | q) on the top level in the Askey q-scheme. This operator represents a special convolution-type product of four one-parameter q-difference operators of the form {epsilon}{sub q}(c{sub q}D{sub q}) (where c{sub q} are some constants), defined as Exton's q-exponential function {epsilon}{sub q}(z) in terms of the Askey-Wilson divided q-difference operator D{sub q}. We also determine another q-difference operator that lifts the orthogonality weight function for the continuous q-Hermite polynomialsH{sub n}(x | q) up to the weight function, associated with the Askey-Wilson polynomials p{sub n}(x; a, b, c, d | q).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SO(N) restricted Schur polynomials

We focus on the 1/4-BPS sector of free super Yang-Mills theory with an SO(N) gauge group. This theory has an AdS/CFT (an equivalence between a conformal field theory in d-1 dimensions and type II string theory defined on an AdS space in d-dimensions) dual in the form of type IIB string theory with AdS{sub 5}×RP{sup 5} geometry. With the aim of studying excited giant graviton dynamics, we construct an orthogonal basis for this sector of the gauge theory in this work. First, we demonstrate that the counting of states, as given by the partition function, and the counting of restricted Schur polynomials match by restricting to a particular class of Young diagram labels. We then give an explicit construction of these gauge invariant operators and evaluate their two-point function exactly. This paves the way to studying the spectral problem of these operators and their D-brane duals.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Anderson metal-insulator transitions with classical magnetic impurities

We study the effects of classical magnetic impurities on the Anderson metal-insulator transition (AMIT) numerically. In particular we find that while a finite concentration of Ising impurities lowers the critical value of the site-diagonal disorder amplitude W{sub c}, in the presence of Heisenberg impurities, W{sub c} is first increased with increasing exchange coupling strength J due to time-reversal symmetry breaking. The resulting scaling with J is compared to analytical predictions by Wegner [1]. The results are obtained numerically, based on a finite-size scaling procedure for the typical density of states [2], which is the geometric average of the local density of states. The latter can efficiently be calculated using the kernel polynomial method [3]. Although still suffering from methodical shortcomings, our method proves to deliver results close to established results for the orthogonal symmetry class [4]. We extend previous approaches [5] by combining the KPM with a finite-size scaling analysis. We also discuss the relevance of our findings for systems like phosphor-doped silicon (Si:P), which are known to exhibit a quantum phase transition from metal to insulator driven by the interplay of both interaction and disorder, accompanied by the presence of a finite concentration of magnetic moments [6].

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fermionic mean-field dynamics for spin systems beyond free fermions

We introduce the fermionized time-dependent Hartree–Fock (fTDHF), a real-time quantum dynamics method for spin-1/2 Hamiltonians following their mapping to fermions via the Jordan-Wigner transformation. fTDHF is formally equivalent to exact dynamics in the case of free fermions, and can efficiently handle non-local string operators arising from long-range interactions via transition matrix elements between non-orthogonal Slater determinants. We show that the fTDHF method can be implemented on a classical computer with a cost that scales polynomially with system size, and linearly with the time steps. We benchmark fTDHF against exact dynamics on three separate spin-1/2 models, representing adiabatic preparation of states with long-range correlations, disorder-driven observation of many-body localization, and particle production in the Schwinger model. For each of these systems, fTDHF is shown to reproduce the qualitative dynamics generated by the exact evolutions, while maintaining a simple physical picture due to its mean-field nature.

Dutta, Rishab↗

Global Nonlinear Parametric Modeling with Application to F-16 Aerodynamics

A global nonlinear parametric modeling technique is described and demonstrated. The technique uses multivariate orthogonal modeling functions generated from the data to determine nonlinear model structure, then expands each retained modeling function into an ordinary multivariate polynomial. The final model form is a finite multivariate power series expansion for the dependent variable in terms of the independent variables. Partial derivatives of the identified models can be used to assemble globally valid linear parameter varying models. The technique is demonstrated by identifying global nonlinear parametric models for nondimensional aerodynamic force and moment coefficients from a subsonic wind tunnel database for the F-16 fighter aircraft. Results show less than 10% difference between wind tunnel aerodynamic data and the nonlinear parameterized model for a simulated doublet maneuver at moderate angle of attack. Analysis indicated that the global nonlinear parametric models adequately captured the multivariate nonlinear aerodynamic functional dependence.

Morelli, Eugene A.↗

Global Nonlinear Parametric Modeling with Application to F-16 Aerodynamics

A global nonlinear parametric modeling technique is described and demonstrated. The technique uses multivariate orthogonal modeling functions generated from the data to determine nonlinear model structure, then expands each retained modeling function into an ordinary multivariate polynomial. The final model form is a finite multivariate power series expansion for the dependent variable in terms of the independent variables. Partial derivatives of the identified models can be used to assemble globally valid linear parameter varying models. The technique is demonstrated by identifying global nonlinear parametric models for nondimensional aerodynamic force and moment coefficients from a subsonic wind tunnel database for the F-16 fighter aircraft. Results show less than 10% difference between wind tunnel aerodynamic data and the nonlinear parameterized model for a simulated doublet maneuver at moderate angle of attack. Analysis indicated that the global nonlinear parametric models adequately captured the multivariate nonlinear aerodynamic functional dependence.

Morelli, Eugene A.↗

All-electron Kohn–Sham density functional theory on hierarchic finite element spaces

In this work, a real space formulation of the Kohn–Sham equations is developed, making use of the hierarchy of finite element spaces from different polynomial order. The focus is laid on all-electron calculations, having the highest requirement onto the basis set, which must be able to represent the orthogonal eigenfunctions as well as the electrostatic potential. A careful numerical analysis is performed, which points out the numerical intricacies originating from the singularity of the nuclei and the necessity for approximations in the numerical setting, with the ambition to enable solutions within a predefined accuracy. In this context the influence of counter-charges in the Poisson equation, the requirement of a finite domain size, numerical quadratures and the mesh refinement are examined as well as the representation of the electrostatic potential in a high order finite element space. The performance and accuracy of the method is demonstrated in computations on noble gases. In addition the finite element basis proves its flexibility in the calculation of the bond-length as well as the dipole moment of the carbon monoxide molecule.

97 MATHEMATICS AND COMPUTING↗

A formulation consideration for orthogonal collocation procedures

Numerical instabilities often arise in the use of high-ordered collocation approximations for numerically solving parabolic partial differential equations. These problems may be reduced by formulations involving evaluation of collocation polynomials rather than combination of the polynomials into a power series. As an illustration, two formulations using shifted Legendre polynomials of order 26 and less are compared.

Lashmet, P. K.↗

Large Eddy Simulation of the Flow Behavior in a Simplified Helical Coil Steam Generator

Large eddy simulation (LES) is conducted for the flow over the shell side of a helical coil steam generator (HCSG) heat exchanger. Simulations are conducted on a simplified experimental test section that represents a one-column region of the helical coils using half-rods. Although the rods are wall-bounded, the flow still exhibits the turbulent characteristics and fluctuations from vortex shedding that one would expect from crossflow around a cylinder. The spectral element, computational fluid dynamics (CFD) code Nek5000, is used to capture the physics, and the results are compared with particle image velocimetry (PIV) measurements. In order to ensure that the turbulence is resolved, analysis is conducted by using the Taylor length scales and normalized wall distance. Sensitivity to the inlet boundary conditions (BCs) and the spatial discretization for different polynomial order solutions are also studied, finding only minor differences between each case. Pressure drop and velocity statistics show reasonable agreement with PIV. Proper orthogonal decomposition (POD) analysis reveals that the primary modes are similar between experiment and simulation, although the LES predicts higher turbulent kinetic energy than does PIV. Overall, the study establishes the resolution and resources required in order to conduct a high-fidelity simulation over 12 helical rods.

Lai, Jonathan K.↗

GenMod: A generative modeling approach for spectral representation of PDEs with random inputs

Here, we propose a method for quantifying uncertainty in high-dimensional PDE systems with random parameters, where the number of solution evaluations is small. Parametric PDE solutions are often approximated using a spectral decomposition based on polynomial chaos expansions. For the class of systems we consider (i.e., high dimensional with limited solution evaluations) the coefficients are given by an underdetermined linear system in a regression formulation. This implies additional assumptions, such as sparsity of the coefficient vector, are needed to approximate the solution. Here, we present an approach where we assume the coefficients are close to the range of a generative model that maps from a low to a high dimensional space of coefficients. Our approach is inspired be recent work examining how generative models can be used for compressed sensing in systems with random Gaussian measurement matrices. Using results from PDE theory on coefficient decay rates, we construct an explicit generative model that predicts the polynomial chaos coefficient magnitudes. The algorithm we developed to find the coefficients, which we call GenMod, is composed of two main steps. First, we predict the coefficient signs using Orthogonal Matching Pursuit. Then, we assume the coefficients are within a sparse deviation from the range of a sign-adjusted generative model. This allows us to find the coefficients by solving a nonconvex optimization problem, over the input space of the generative model and the space of sparse vectors. We obtain theoretical recovery results for a Lipschitz continuous generative model and for a more specific generative model, based on coefficient decay rate bounds. We examine three high-dimensional problems and show that, for all three examples, the generative model approach outperforms sparsity promoting methods at small sample sizes.

97 MATHEMATICS AND COMPUTING↗

Parallel homotopy curve tracking on a hypercube

An investigation is conducted to find good parallel algorithms for solving systems of nonlinear equations using probability-one homotopy methods. Particular attention is paid to algorithms for the hypercube. Methods for one of the most computationally expensive steps of the homotopy approach, the computation of the kernel of the Jacobian matrix of the homotopy map, are studied. General nonlinear systems of equations with small and dense Jacobian matrices are considered, however, polynomial systems are not, since their structure leads to different strategies for parallelism. The mathematics behind the homotopy algorithm is summarized and the use of orthogonal factorizations is discussed. Parallel algorithms for orthogonal factorizations and triangular system solving are described. Computational results are presented and discussed.

Chakraborty, A.↗

Implicit application of polynomial filters in a k-step Arnoldi method

The Arnoldi process is a well known technique for approximating a few eigenvalues and corresponding eigenvectors of a general square matrix. Numerical difficulties such as loss of orthogonality and assessment of the numerical quality of the approximations as well as a potential for unbounded growth in storage have limited the applicability of the method. These issues are addressed by fixing the number of steps in the Arnoldi process at a prescribed value k and then treating the residual vector as a function of the initial Arnoldi vector. This starting vector is then updated through an iterative scheme that is designed to force convergence of the residual to zero. The iterative scheme is shown to be a truncation of the standard implicitly shifted QR-iteration for dense problems and it avoids the need to explicitly restart the Arnoldi sequence. The main emphasis of this paper is on the derivation and analysis of this scheme. However, there are obvious ways to exploit parallelism through the matrix-vector operations that comprise the majority of the work in the algorithm. Preliminary computational results are given for a few problems on some parallel and vector computers.

Sorensen, D. C.↗

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↗

On the orthogonality of the MacDonald s functions

A proof of an orthogonality relation for the MacDonald's functions with identical arguments but unequal complex lower indices is presented. The orthogonality is derived first via a heuristic approach based on the Mehler-Fock integral transform of the MacDonald's functions, and then proved rigorously using a polynomial approximation procedure.

97 MATHEMATICS AND COMPUTING↗

Diffusion Synthetic Acceleration for High Order S{sub N} Transport on Meshes with Curved Surfaces

Thermal radiation transport is integral to multiphysics applications such as inertial confinement fusion and astrophysics. Materials in these problems can be exceptionally optically thick and diffusive. A transport solver must be capable of accurate and efficient solutions to such problems. Previously, Woods et al. established a proof-of-concept for high order (HO) discontinuous Galerkin finite element (DGFEM) transport on meshes with curved surfaces. They numerically demonstrated the spatial convergence is order p + 1. Remarkably, these convergence rates are relatively invariant to the amount of curvature of the spatial mesh. We present here an extension of this work that demonstrates a rapidly-convergent iterative solver for the FEM transport equations on meshes with curved sides. We use the modified interior penalty (MIP) diffusion synthetic acceleration (DSA) established by Wang and Ragusa. The partially consistent MIP equations stem from the symmetric interior penalty (IP) derivation of the diffusion equation. The IP method is not stable for optically thick cells so it was combined with the diffusion conforming form (DCF), a discretized diffusion equation derived from the discretized S N equations that is not stable for intermediate optical thicknesses. The MIP equations adapt a 'switch' to the IP method in optically thinner regions and the DCF method in optically thicker regions. The literature does not reveal any Fourier analyses performed for iterative transport on meshes with curved surfaces. Wang and Ragusa performed a Fourier analysis for orthogonal meshes and our results appear to be as expected. Previous literature has reported on some of the sensitivities that affect the spectral radius of DSA schemes: polynomial order, and scattering ratios. Presently, we focus on the sensitivity of the spectral radius to polynomial order, scattering ratio, the constant C, and mesh curvature for varying cell thicknesses. We also numerically study the behavior of the spectral radius to verify our DSA implementation. A sequence of problems is designed to exercise the acceleration. As the problems become more optically thick and diffusive, the accelerated solution continues to converge toward the analytic solution. We employ the Modular Finite Element Methods (MFEM) package, developed at Lawrence Livermore National Laboratory, to generate the linear algebraic system of equations for each angle in the discrete ordinates quadrature set, and use UMFPack to solve this system of equations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Deformations of polyhedra and polygons by the unitary group

We introduce the set of framed (convex) polyhedra with N faces as the symplectic quotient C{sup 2N}//SU(2). A framed polyhedron is then parametrized by N spinors living in C{sup 2} satisfying suitable closure constraints and defines a usual convex polyhedron plus extra U(1) phases attached to each face. We show that there is a natural action of the unitary group U(N) on this phase space, which changes the shape of faces and allows to map any (framed) polyhedron onto any other with the same total (boundary) area. This identifies the space of framed polyhedra to the Grassmannian space U(N)/ (SU(2)×U(N−2)). We show how to write averages of geometrical observables (polynomials in the faces' area and the angles between them) over the ensemble of polyhedra (distributed uniformly with respect to the Haar measure on U(N)) as polynomial integrals over the unitary group and we provide a few methods to compute these integrals systematically. We also use the Itzykson-Zuber formula from matrix models as the generating function for these averages and correlations. In the quantum case, a canonical quantization of the framed polyhedron phase space leads to the Hilbert space of SU(2) intertwiners (or, in other words, SU(2)-invariant states in tensor products of irreducible representations). The total boundary area as well as the individual face areas are quantized as half-integers (spins), and the Hilbert spaces for fixed total area form irreducible representations of U(N). We define semi-classical coherent intertwiner states peaked on classical framed polyhedra and transforming consistently under U(N) transformations. And we show how the U(N) character formula for unitary transformations is to be considered as an extension of the Itzykson-Zuber to the quantum level and generates the traces of all polynomial observables over the Hilbert space of intertwiners. We finally apply the same formalism to two dimensions and show that classical (convex) polygons can be described in a similar fashion trading the unitary group for the orthogonal group. We conclude with a discussion of the possible (deformation) dynamics that one can define on the space of polygons or polyhedra. This work is a priori useful in the context of discrete geometry but it should hopefully also be relevant to (loop) quantum gravity in 2+1 and 3+1 dimensions when the quantum geometry is defined in terms of gluing of (quantized) polygons and polyhedra.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗