High-precision Chebyshev series approximation to the exponential integral
Calculating exponential integral using Chebyshev series expansion of associated functions
Lee, K. L.↗
SEARCH · Search NASA
Results for “Chebyshev functions”
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.
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.↗
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.↗
Single scattering from nonspherical Chebyshev particles: A compendium of calculations
A large set of exact calculations of the scattering from a class of nonspherical particles known as Chebyshev particles' has been performed. Phase function and degree of polarization in random orientation, and parallel and perpendicular intensities in fixed orientations, are plotted for a variety of particles shapes and sizes. The intention is to furnish a data base against which both experimental data, and the predictions of approximate methods, can be tested. The calculations are performed with the widely-used Extended Boundary Condition Method. An extensive discussion of this method is given, including much material that is not easily available elsewhere (especially the analysis of its convergence properties). An extensive review is also given of all extant methods for nonspherical scattering calculations, as well as of the available pool of experimental data.
Wiscombe, W. J.↗
An algorithm for summing orthogonal polynomial series and their derivatives with applications to curve-fitting and interpolation.
Algorithm for summing orthogonal polynomial series and derivatives with applications to curve fitting and interpolation
DATA SMOOTHING↗
Optimal control with Chebyshev minimax performance index.
Optimal control of dynamic systems with minimax type performance index, discussing application of proposed method of solution
CHEBYSHEV APPROXIMATION↗
Well-posedness of one-way wave equations and absorbing boundary conditions
The one-way wave equations occurring in geophysics, underwater acoustics, and numerical studies involving absorbing boundary conditions are characterized analytically. The conditions under which such equations are well posed are obtained by examining the rational functions used to reduce them. Results are presented for Chebyshev, Pade, least-squares, and symmetric least-squares approximations.
Trefethen, Lloyd N.↗
A new approach to remove interorder background in high dispersion IUE images
A two dimensional Chebyshev interpolating scheme, followed by modeling of point spread functions as Voigt profiles, is proposed for final archiving IUESIPS to remove the interorder overlap from the smoothed background fluxes of high dispersion International Ultraviolet Explorer (IUE) images. Tests of the first and last stages of the algorithm suggest that it can give a considerably better zero point than the old IUESIPS algorithm which samples local interorder background.
Smith, Myron A.↗
On the Gibbs phenomenon 4: Recovering exponential accuracy in a sub-interval from a Gegenbauer partial sum of a piecewise analytic function
We continue our investigation of overcoming Gibbs phenomenon, i.e., to obtain exponential accuracy at all points (including at the discontinuities themselves), from the knowledge of a spectral partial sum of a discontinuous but piecewise analytic function. We show that if we are given the first N Gegenbauer expansion coefficients, based on the Gegenbauer polynomials C(sub k)(sup mu)(x) with the weight function (1 - x(exp 2))(exp mu - 1/2) for any constant mu is greater than or equal to 0, of an L(sub 1) function f(x), we can construct an exponentially convergent approximation to the point values of f(x) in any subinterval in which the function is analytic. The proof covers the cases of Chebyshev or Legendre partial sums, which are most common in applications.
Gottlieb, David↗
A numerically exact full wave packet approach to molecule-surface scattering
A numerically exact spectral method for solving the time-dependent Schroedinger equation in spherical coordinates is described. The angular dependence of the wave function is represented on a two-dimensional grid of evenly spaced points. The fast Fourier transform algorithm is used to transform between the angle space representation of the wave function and its conjugate representation in momentum space. The time propagation of the wave function is evaluated using an expansion of the time evolution operator as a series of Chebyshev polynomials. Calculations performed for a model system representing H2 scattering from a rectangular corrugated surface yield transition probabilities that are in excellent agreement with those obtained using the close-coupling wave packet (CCWP) method. However, the new method is found to require substantially more computation time than the CCWP method because of the large number of grid points needed to represent the angular dependence of the wave function and the variation in the number of terms required in the Chebyshev representation of the time evolution operator.
Mowrey, R. C.↗
An adaptive pseudo-spectral method for reaction diffusion problems
The spectral interpolation error was considered for both the Chebyshev pseudo-spectral and Galerkin approximations. A family of functionals I sub r (u), with the property that the maximum norm of the error is bounded by I sub r (u)/J sub r, where r is an integer and J is the degree of the polynomial approximation, was developed. These functionals are used in the adaptive procedure whereby the problem is dynamically transformed to minimize I sub r (u). The number of collocation points is then chosen to maintain a prescribed error bound. The method is illustrated by various examples from combustion problems in one and two dimensions.
Bayliss, A.↗
An adaptive pseudo-spectral method for reaction diffusion problems
The spectral interpolation error was considered for both the Chebyshev pseudo-spectral and Galerkin approximations. A family of functionals I sub r (u), with the property that the maximum norm of the error is bounded by I sub r (u)/J sub r, where r is an integer and J is the degree of the polynomial approximation, was developed. These functionals are used in the adaptive procedure whereby the problem is dynamically transformed to minimize I sub r (u). The number of collocation points is then chosen to maintain a prescribed error bound. The method is illustrated by various examples from combustion problems in one and two dimensions.
Bayliss, A.↗
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.↗
A comparison of computational methods and algorithms for the complex gamma function
A survey and comparison of some computational methods and algorithms for gamma and log-gamma functions of complex arguments are presented. Methods and algorithms reported include Chebyshev approximations, Pade expansion and Stirling's asymptotic series. The comparison leads to the conclusion that Algorithm 421 published in the Communications of ACM by H. Kuki is the best program either for individual application or for the inclusion in subroutine libraries.
Ng, E. W.↗
On the Gibbs phenomenon 3: Recovering exponential accuracy in a sub-interval from a spectral partial sum of a piecewise analytic function
The investigation of overcoming Gibbs phenomenon was continued, i.e., obtaining exponential accuracy at all points including at the discontinuities themselves, from the knowledge of a spectral partial sum of a discontinuous but piecewise analytic function. It was shown that if we are given the first N expansion coefficients of an L(sub 2) function f(x) in terms of either the trigonometrical polynomials or the Chebyshev or Legendre polynomials, an exponentially convergent approximation to the point values of f(x) in any sub-interval in which it is analytic can be constructed.
Gottlieb, David↗
Compression of ephemerides
An algorithm is proposed for generating sequences of Chebyshev series which are the best approximations of an astronomical ephemeris in the sense of Chebyshev over large intervals of time. The criterion for a polynomial approximation of a function to be the best polynomial approximation of the function is that the error function present certain rippling characteristics as described by Remez (1957). General features of the program in PL/1 are described.
Deprit, A.↗
An approach for finding long period elliptical orbits for precursor SEI missions
Precursors for Solar System Exploration Initiative (SEI) missions may require long period elliptical orbits about a planet. These orbits will typically have periods on the order of tens to hundreds of days. Some potential uses for these orbits may include the following: studying the effects of galactic cosmic radiation, parking orbits for engineering and operational test of systems, and ferrying orbits between libration points and low altitude orbits. This report presents an approach that can be used to find these orbits. The approach consists of three major steps. First, it uses a restricted three-body targeting algorithm to determine the initial conditions which satisfy certain desired final conditions in a system of two massive primaries. Then the initial conditions are transformed to an inertial coordinate system for use by a special perturbation method. Finally, using the special perturbation method, other perturbations (e.g., sun third body and solar radiation pressure) can be easily incorporated to determine their effects on the nominal trajectory. An algorithm potentially suitable for on-board guidance will also be discussed. This algorithm uses an analytic method relying on Chebyshev polynomials to compute the desired position and velocity of the satellite as a function of time. Together with navigation updates, this algorithm can be implemented to predict the size and timing for AV corrections.
Fraietta, Michael F.↗
On the Gibbs phenomenon 5: Recovering exponential accuracy from collocation point values of a piecewise analytic function
The paper presents a method to recover exponential accuracy at all points (including at the discontinuities themselves), from the knowledge of an approximation to the interpolation polynomial (or trigonometrical polynomial). We show that if we are given the collocation point values (or a highly accurate approximation) at the Gauss or Gauss-Lobatto points, we can reconstruct a uniform exponentially convergent approximation to the function f(x) in any sub-interval of analyticity. The proof covers the cases of Fourier, Chebyshev, Legendre, and more general Gegenbauer collocation methods.
Gottlieb, David↗