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
NASA NTRS2019

Meshless Local Petrov-Galerkin (MLPG) Method with Orthogonal Polynomials for Euler-Bernoulli Beam Problems

In this paper, the feasibility of orthogonal polynomials in the meshless local Petrov Galerkin method (MLPG) method is studied. The orthogonal polynomials, Chebyshev and Legendre polynomials, are used in this MLPG method as trial functions. The test functions used were power functions with smooth derivatives at their ends. The performance of these methods is studied by applying these methods to Euler-Bernoulli beam problems. The MLPG-Galerkin and Legendre methods passed all the patch tests for simple beam problems. Next the formulations are tested on complex beam problems such as beams with partial loadings and continuous beam problems. Problems with load discontinuities and additional supports require special attention. Near discontinuities, judicious choice of number of nodes and nodal placements are needed to obtain accurate deflections, slopes, moments and shear forces. As polynomial functions are used, the large number of nodes can create a transformation matrix that is ill-conditioned, resulting in problems with the inversion of the matrix. The conditioning worsens as the number of nodes are increased beyond 20. Quadruple precision was needed for models to obtain accurate solutions. Even with quadruple precision the accuracy of the method suffers as the number of nodes is increased beyond 20. This appears to be a drawback of the MLPG-Chebyshev and MLPG-Legendre methods.

Raju, Ivatury S.↗
NASA NTRS2011

Least-Squares Adaptive Control Using Chebyshev Orthogonal Polynomials

This paper presents a new adaptive control approach using Chebyshev orthogonal polynomials as basis functions in a least-squares functional approximation. The use of orthogonal basis functions improves the function approximation significantly and enables better convergence of parameter estimates. Flight control simulations demonstrate the effectiveness of the proposed adaptive control approach.

Nguyen, Nhan T.↗
NASA NTRS1974

Method of Characteristics Calculations and Computer Code for Materials with Arbitrary Equations of State and Using Orthogonal Polynomial Least Square Surface Fits

A numerical scheme using the method of characteristics to calculate the flow properties and pressures behind decaying shock waves for materials under hypervelocity impact is developed. Time-consuming double interpolation subroutines are replaced by a technique based on orthogonal polynomial least square surface fits. Typical calculated results are given and compared with the double interpolation results. The complete computer program is included.

Chang, T. S.↗
NASA NTRS1994

An Efficient Spectral Method for Ordinary Differential Equations with Rational Function Coefficients

We present some relations that allow the efficient approximate inversion of linear differential operators with rational function coefficients. We employ expansions in terms of a large class of orthogonal polynomial families, including all the classical orthogonal polynomials. These families obey a simple three-term recurrence relation for differentiation, which implies that on an appropriately restricted domain the differentiation operator has a unique banded inverse. The inverse is an integration operator for the family, and it is simply the tridiagonal coefficient matrix for the recurrence. Since in these families convolution operators (i.e. matrix representations of multiplication by a function) are banded for polynomials, we are able to obtain a banded representation for linear differential operators with rational coefficients. This leads to a method of solution of initial or boundary value problems that, besides having an operation count that scales linearly with the order of truncation N, is computationally well conditioned. Among the applications considered is the use of rational maps for the resolution of sharp interior layers.

Coutsias, Evangelos A.↗
NASA NTRS1989

Derivation of a Tappered p-Version Beam Finite Element

A tapered p-version beam finite element suitable for dynamic applications is derived. The taper in the element is represented by allowing the area moments of inertia to vary as quartic polynomials along the length of the beam, and the cross-sectional area to vary as a quadratic polynomial. The p-version finite-element characteristics are implemented through a set of polynomial shape functions. The lower-order shape functions are identical to the classical cubic and linear shape functions normally associated with a beam element. The higher-order shape functions are a hierarchical set of polynomials that are integrals of orthogonal polynomials. Explicit expressions for the mass and stiffness matrices are presented for an arbitrary value of p. The element has been verified to be numerically stable using shape functions through 22nd order.

Hinnant, Howard E.↗
NASA NTRS1982

A recursive algorithm for Zernike polynomials

The analysis of a function defined on a rotationally symmetric system, with either a circular or annular pupil is discussed. In order to numerically analyze such systems it is typical to expand the given function in terms of a class of orthogonal polynomials. Because of their particular properties, the Zernike polynomials are especially suited for numerical calculations. Developed is a recursive algorithm that can be used to generate the Zernike polynomials up to a given order. The algorithm is recursively defined over J where R(J,N) is the Zernike polynomial of degree N obtained by orthogonalizing the sequence R(J), R(J+2), ..., R(J+2N) over (epsilon, 1). The terms in the preceding row - the (J-1) row - up to the N+1 term is needed for generating the (J,N)th term. Thus, the algorith generates an upper left-triangular table. This algorithm was placed in the computer with the necessary support program also included.

Davenport, J. W.↗
NASA NTRS1994

Viscosity estimates for the crust and upper mantle from patterns of lacustrine shoreline deformation in the Eastern Great Basin

The deformed shorelines of Lake Bonneville constitute a classic source of information on lithospheric elastic thickness and upper mantle viscosity. We describe and apply a new model to a recently augmented data set. New data better constrain both the complex spatio-temporal pattern of the lake load and the crustal deformation response to that load. The history of lake level fluctuations has been significantly refined and somewhat modified. This is due to both more radiocarbon dates from within the Bonneville basin and to an improved calibration of the radiocarbon timescale itself. The data which constrain the crustal deformation pattern consist of ages and shoreline elevations from several hundred points which sample three major levels of Lake Bonneville and corresponding elevations from the high stands of three smaller lakes situated to the west of Lake Bonneville. The geometry of the Earth model incorporates an arbitrary number of layers overlying a half-space, and the rheology of each level can accommodate an arbitrary number of Maxwell viscoelastic elements in parallel. The inverse modeling comprises three complementary approaches: for the simplest configurations, we performed a direct search of the parameter space and delineated the irregular boundary of the subspace of acceptable models. For more complex configurations, we constrained the elastic parameters to their seismically determined values and then solved for viscosity versus depth profiles by either expressing the log(viscosity) versus log(depth) profile as a series of specially constructed orhtogonal polynomials, or by allowing each of 8-10 layers (plus the half-space) to have an independently determined viscosity. We found that the data do not strongly support (nor can they conclusively exclude) a more complex rheology than simple Maxwell viscoelasticity. The orthogonal polynomial solution exhibits an essentially monotonic decrease in viscosity with depth.

Bills, Bruce G.↗
NASA NTRS1995

Fibonacci chain polynomials: Identities from self-similarity

Fibonacci chains are special diatomic, harmonic chains with uniform nearest neighbor interaction and two kinds of atoms (mass-ratio r) arranged according to the self-similar binary Fibonacci sequence ABAABABA..., which is obtained by repeated substitution of A yields AB and B yields A. The implications of the self-similarity of this sequence for the associated orthogonal polynomial systems which govern these Fibonacci chains with fixed mass-ratio r are studied.

Lang, Wolfdieter↗
NASA NTRS1975

Programs for computing abscissas and weights for classical and nonclassical Gaussian quadrature formulas

Computer programs for computing Gaussian quadrature abscissas and weights are described. For the classical case the programs use Laguerre iteration to compute abscissas as zeros of orthogonal polynomials. The polynomials are evaluated from known recursion coefficients. The nonclassical case is handled similarly except that the recursion coefficients are computed by numerical integration. A sample problem, with input and output, is presented to illustrate the use of the programs. It computes the quadrature abscissas and weights associated with the weight function over the interval (0,1) for quadrature orders from 16 to 96 in increments of 8.

Desmarais, R. N.↗
NASA NTRS1979

Integrating matrices for arbitrarily spaced grid points

Integrating matrices are derived for arbitrarily spaced grid points using either interpolating or least squares fit orthogonal polynomials. Several features of the equally spaced grid case are also discussed.

Lakin, W. D.↗
NASA NTRS1982

A numerical method for integrating the kinetic equations of droplet spectra evolution by condensation/evaporation and by coalescence/breakup processes

An extension of the method of moments is developed for the numerical integration of the kinetic equations of droplet spectra evolution by condensation/evaporation and by coalescence/breakup processes. The number density function n sub k (x,t) in each separate droplet packet between droplet mass grid points (x sub k, x sub k+1) is represented by an expansion in orthogonal polynomials with a given weighting function. In this way droplet number concentrations, liquid water contents and other moments in each droplet packet are conserved and the problem of solving the kinetic equations is replaced by one of solving a set of coupled differential equations for the number density function moments. The method is tested against analytic solutions of the corresponding kinetic equations. Numerical results are obtained for different coalescence/breakup and condensation/evaporation kernels and for different initial droplet spectra. Also droplet mass grid intervals, weighting functions, and time steps are varied.

Emukashvily, I. M.↗