formulae expressing explicitly the coefficients of an expansion of double jacobi polynomials which has been partially differentiated an arbitrary number of times with respect to its variables in terms of the coefficients of the original expansion are stated and proved. extension to expansion of triple jacobi polynomials is given. the results for the special cases of double and triple ultraspher...

A fast, simple, and numerically stable transform for converting between Legendre and Chebyshev coefficients of a degree N polynomial in O(N(logN)2/ log logN) operations is derived. The basis of the algorithm is to rewrite a well-known asymptotic formula for Legendre polynomials of large degree as a weighted linear combination of Chebyshev polynomials, which can then be evaluated by using the di...

A new version of the fast Gauss transform (FGT) is introduced which is based on a truncated Chebyshev series expansion of the Gaussian. Unlike the traditional fast algorithms, the scheme does not subdivide sources and evaluation points into multiple clusters. Instead, the whole problem geometry is treated as a single cluster. Estimates for the error as a function of the dimension d and the expa...

The usual way to determine the asymptotic behavior of the Chebyshev coefficients for a function is to apply the method of steepest descent to the integral representation of the coefficients. However, the procedure is usually laborious. We prove an asymptotic upper bound on the Chebyshev coefficients for the kth integral of a function. The tightness of this upper bound is then analyzed for the c...

Hough functions are the eigenfunctions of the Laplace tidal equation governing fluid motion on a rotating sphere with a resting basic state. Several numerical methods have been used in the past. In this paper, we compare two of those methods: normalized associated Legendre polynomial expansion and Chebyshev collocation. Both methods are not widely used, but both have some advantages over the co...

The operational matrices of fractional-order integration for the Legendre and Chebyshev wavelets are derived. Block pulse functions and collocation method are employed to derive a general procedure for forming these matrices for both the Legendre and the Chebyshev wavelets. Then numerical methods based on wavelet expansion and these operational matrices are proposed. In this proposed method, by...

In this paper we compare Krylov subspace methods with Chebyshev series expansion for approximating the matrix exponential operator on large, sparse, symmetric matrices. Experimental results upon negative-definite matrices with very large size, arising from (2D and 3D) FE and FD spatial discretization of linear parabolic PDEs, demonstrate that the Chebyshev method can be an effective alternative...

We study the orthogonal polynomial expansion on sparse grids for a function of d variables in a weighted L space. A fast algorithm is developed to compute the orthogonal polynomial expansion by combining the fast cosine transform, a fast transform from the Chebyshev orthogonal polynomial basis to the orthogonal polynomial basis for the weighted L space, and a fast algorithm of computing hierarc...