finite sum
(0.002 seconds)
21—30 of 75 matching pages
21: 29.20 Methods of Computation
…
►The Fourier series may be summed using Clenshaw’s algorithm; see §3.11(ii).
…
►A third method is to approximate eigenvalues and Fourier coefficients of Lamé functions by eigenvalues and eigenvectors of finite matrices using the methods of §§3.2(vi) and 3.8(iv).
…
►The eigenvalues corresponding to Lamé polynomials are computed from eigenvalues of the finite tridiagonal matrices given in §29.15(i), using methods described in §3.2(vi) and Ritter (1998).
The corresponding eigenvectors yield the coefficients in the finite Fourier series for Lamé polynomials.
…
22: 1.9 Calculus of a Complex Variable
…
►
1.9.68
…
23: 6.6 Power Series
…
►
6.6.1
.
►
6.6.2
…
►
6.6.4
►
6.6.5
…
►The series in this section converge for all finite values of and .
24: 33.23 Methods of Computation
…
►The power-series expansions of §§33.6 and 33.19 converge for all finite values of the radii and , respectively, and may be used to compute the regular and irregular solutions.
Cancellation errors increase with increases in and , and may be estimated by comparing the final sum of the series with the largest partial sum.
…
25: 24.4 Basic Properties
26: 1.12 Continued Fractions
…
►
1.12.18
,
…
►
1.12.19
,
…
►A continued fraction converges if the convergents tend to a finite limit as .
…
►and the even and odd parts of the continued fraction converge to finite values.
…
►
1.12.28
…
27: Bibliography J
…
►
Note sur la série
.
Bull. Soc. Math. France 17, pp. 142–152 (French).
►
Calculus of Finite Differences.
Hungarian Agent Eggenberger Book-Shop, Budapest.
►
Calculus of Finite Differences.
3rd edition, AMS Chelsea, Providence, RI.
…
28: 2.3 Integrals of a Real Variable
…
►is finite and bounded for , then the th error term (that is, the difference between the integral and th partial sum in (2.3.2)) is bounded in absolute value by when exceeds both and .
…
29: 26.18 Counting Techniques
…
►
26.18.1
…