Search NASA⌕ Search

SEARCH · Search NASA

Results for “CHEBYSHEV APPROXIMATION”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1967

Bounds for Horner sums

Estimation of absolute values of Horner sum, using Chebyshev polynomials as maximizing polynomials

POLYNOMIAL↗
NASA NTRS1983

Preconditioners for the spectral multigrid method

The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problems preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented.

Phillips, T. N.↗
NASA NTRS1986

Preconditioners for the spectral multigrid method

The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problem preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented.

Phillips, T. N.↗
NASA NTRS1986

Numerical solution of random singular integral equation appearing in crack problems

The solution of several elasticity problems, and particularly crack problems, can be reduced to the solution of one-dimensional singular integral equations with a Cauchy-type kernel or to a system of uncoupled singular integral equations. Here a method for the numerical solution of random singular integral equations of Cauchy type is presented. The solution technique involves a Chebyshev series approximation, the coefficients of which are the solutions of a system of random linear equations. This method is applied to the problem of periodic array of straight cracks inside an infinite isotropic elastic medium and subjected to a nonuniform pressure distribution along the crack edges. The statistical properties of the random solution are evaluated numerically, and the random solution is used to determine the values of the stress-intensity factors at the crack tips. The error, expressed as the difference between the mean of the random solution and the deterministic solution, is established. Values of stress-intensity factors at the crack tip for different random input functions are presented.

Sambandham, M.↗
NASA NTRS1990

Efficient parallel solution of parabolic equations - Implicit methods on the Cedar multicluster

A class of implicit methods for the parallel solution of linear parabolic differential equations based on Pade and Chebyshev rational approximations to the matrix exponential are presented. It is pointed out that this approach incorporates both natural hierarchical parallelism, improved intrinsic efficiency, and fewer timesteps. These advantages lead to an extremely fast family of methods for the solution of certain time-dependent problems. These techniques are illustrated with numerical experiments on the University of Illinois Cedar multicluster architecture. The experiments indicate that implicit methods of very high degree offer great promise for the solution of certain parabolic problems when in computational environment with parallel resources. Hierarchically organized parallel computers, such as the Cedar multicluster, are found to be especially attractive for these schemes.

Gallopoulos, E.↗
NASA NTRS1994

A spectrally accurate boundary-layer code for infinite swept wings

This report documents the development, validation, and application of a spectrally accurate boundary-layer code, WINGBL2, which has been designed specifically for use in stability analyses of swept-wing configurations. Currently, we consider only the quasi-three-dimensional case of an infinitely long wing of constant cross section. The effects of streamwise curvature, streamwise pressure gradient, and wall suction and/or blowing are taken into account in the governing equations and boundary conditions. The boundary-layer equations are formulated both for the attachment-line flow and for the evolving boundary layer. The boundary-layer equations are solved by marching in the direction perpendicular to the leading edge, for which high-order (up to fifth) backward differencing techniques are used. In the wall-normal direction, a spectral collocation method, based upon Chebyshev polynomial approximations, is exploited. The accuracy, efficiency, and user-friendliness of WINGBL2 make it well suited for applications to linear stability theory, parabolized stability equation methodology, direct numerical simulation, and large-eddy simulation. The method is validated against existing schemes for three test cases, including incompressible swept Hiemenz flow and Mach 2.4 flow over an airfoil swept at 70 deg to the free stream.

Pruett, C. David↗
NASA NTRS2012

Algorithm for Compressing Time-Series Data

An algorithm based on Chebyshev polynomials effects lossy compression of time-series data or other one-dimensional data streams (e.g., spectral data) that are arranged in blocks for sequential transmission. The algorithm was developed for use in transmitting data from spacecraft scientific instruments to Earth stations. In spite of its lossy nature, the algorithm preserves the information needed for scientific analysis. The algorithm is computationally simple, yet compresses data streams by factors much greater than two. The algorithm is not restricted to spacecraft or scientific uses: it is applicable to time-series data in general. The algorithm can also be applied to general multidimensional data that have been converted to time-series data, a typical example being image data acquired by raster scanning. However, unlike most prior image-data-compression algorithms, this algorithm neither depends on nor exploits the two-dimensional spatial correlations that are generally present in images. In order to understand the essence of this compression algorithm, it is necessary to understand that the net effect of this algorithm and the associated decompression algorithm is to approximate the original stream of data as a sequence of finite series of Chebyshev polynomials. For the purpose of this algorithm, a block of data or interval of time for which a Chebyshev polynomial series is fitted to the original data is denoted a fitting interval. Chebyshev approximation has two properties that make it particularly effective for compressing serial data streams with minimal loss of scientific information: The errors associated with a Chebyshev approximation are nearly uniformly distributed over the fitting interval (this is known in the art as the "equal error property"); and the maximum deviations of the fitted Chebyshev polynomial from the original data have the smallest possible values (this is known in the art as the "min-max property").

Hawkins, S. Edward, III↗
NASA NTRS1982

The optimization of convergence for Chebyshev polynomial methods in an unbounded domain

Grosch and Orszag (1977) have performed a numerical analysis of the problem of solving differential equations in a semiinfinite or infinite domain using Chebyshev polynomials. The principal limitation of the conducted study was that it was entirely empirical. Various differential equations were solved in different ways and the numbers were compared. The present investigation has the objective to extend the studies conducted by Grosch and Orszag by deriving asymptotic approximations to the Chebyshev coefficients of simple model functions. This approach makes it possible to conduct more systematic comparisons of different methods, extend the range of comparisons, and, perhaps most important, give simple analytic formulas for choosing the optimum domain size or mapping parameter L for various situations.

Boyd, J. P.↗
NASA NTRS1990

Quadrature imposition of compatibility conditions in Chebyshev methods

This paper handles a problem encountered in the solution by way of Chebyshev spectral collocation discretization of the Poisson equation with homogeneous Neumann boundary conditions. When pseudospectral Chebyshev methodology is utilized to discretize the partial differential equation these integrals have to be approximated by an appropriate quadrature formula. The correct quadrature formula is developed for these problems, taking into account the degree of the polynomials involved. It is shown that this formula leads to a well-conditioned Chebyshev approximation to the differential equations and that the compatibility condition is automatically satisfied.

Gottlieb, D.↗
NASA NTRS1975

Analytical theory for artificial satellites

A theory for generating segmented ephemerides is discussed as a means for fast generation and simple retrieval of nominal orbit data. Over a succession of finite intervals of time, the orbit is represented by a best approximation expressed by Chebyshev polynomials. Storage of coefficients tables for Chebyshev polynomials is seen as a method to reduce data and decrease transmission costs. A general algorithm was constructed and computer programs were designed. The possibility of storing an ephemeris for a few days in the on-board computer, or in microprocessors attached to the data collectors is suggested.

Deprit, A.↗