in series of Chebyshev polynomials
(0.008 seconds)
1—10 of 29 matching pages
1: 18.40 Methods of Computation
…
►For applications in which the OP’s appear only as terms in series expansions (compare §18.18(i)) the need to compute them can be avoided altogether by use instead of Clenshaw’s algorithm (§3.11(ii)) and its straightforward generalization to OP’s other than Chebyshev.
…
…
2: 3.11 Approximation Techniques
…
►
§3.11(ii) Chebyshev-Series Expansions
… ►Since , is a monotonically increasing function of , and (for example) , this means that in practice the gain in replacing a truncated Chebyshev-series expansion by the corresponding minimax polynomial approximation is hardly worthwhile. … ►Let be the last term retained in the truncated series. …3: 18.18 Sums
4: 18.38 Mathematical Applications
…
►In consequence, expansions of functions that are infinitely differentiable on
in series of Chebyshev polynomials usually converge extremely rapidly.
…
►Linear ordinary differential equations can be solved directly in series of Chebyshev polynomials (or other OP’s) by a method originated by Clenshaw (1957).
…
5: 25.20 Approximations
…
►
•
…
Cody et al. (1971) gives rational approximations for in the form of quotients of polynomials or quotients of Chebyshev series. The ranges covered are , , , . Precision is varied, with a maximum of 20S.
6: 18.3 Definitions
…
►Explicit power series for Chebyshev, Legendre, Laguerre, and Hermite polynomials for are given in §18.5(iv).
…
7: 29.15 Fourier Series and Chebyshev Series
§29.15 Fourier Series and Chebyshev Series
… ►When , , the Fourier series (29.6.1) terminates: … ►§29.15(ii) Chebyshev Series
►The Chebyshev polynomial of the first kind (§18.3) satisfies . … ►Using also , with denoting the Chebyshev polynomial of the second kind (§18.3), we obtain …8: 19.38 Approximations
…
►Minimax polynomial approximations (§3.11(i)) for and
in terms of with can be found in Abramowitz and Stegun (1964, §17.3) with maximum absolute errors ranging from 4×10⁻⁵ to 2×10⁻⁸.
Approximations of the same type for and for are given in Cody (1965a) with maximum absolute errors ranging from 4×10⁻⁵ to 4×10⁻¹⁸.
Cody (1965b) gives Chebyshev-series expansions (§3.11(ii)) with maximum precision 25D.
►Approximations for Legendre’s complete or incomplete integrals of all three kinds, derived by Padé approximation of the square root in the integrand, are given in Luke (1968, 1970).
…The accuracy is controlled by the number of terms retained in the approximation; for real variables the number of significant figures appears to be roughly twice the number of terms retained, perhaps even for near with the improvements made in the 1970 reference.
…
9: 8.27 Approximations
…
►
•
►
•
…
►
•
…
►
•
Luke (1969b, p. 186) gives hypergeometric polynomial representations that converge uniformly on compact subsets of the -plane that exclude and are valid for .
Luke (1975, p. 103) gives Chebyshev-series expansions for and related functions for .
Verbeeck (1970) gives polynomial and rational approximations for , approximately, where denotes a quotient of polynomials of equal degree in .
10: 5.23 Approximations
…
►Hart et al. (1968) gives minimax polynomial and rational approximations to and
in the intervals , , ; precision is variable.
…
►