About the Project

finite sum

AdvancedHelp

(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 C n = 0 f n ( z ) d z = n = 0 C f n ( z ) d z
23: 6.6 Power Series
6.6.1 Ei ( x ) = γ + ln x + n = 1 x n n ! n , x > 0 .
6.6.2 E 1 ( z ) = γ ln z n = 1 ( 1 ) n z n n ! n .
6.6.4 Ein ( z ) = n = 1 ( 1 ) n 1 z n n ! n ,
6.6.5 Si ( z ) = n = 0 ( 1 ) n z 2 n + 1 ( 2 n + 1 ) ! ( 2 n + 1 ) ,
The series in this section converge for all finite values of x and | z | .
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 r , respectively, and may be used to compute the regular and irregular solutions. Cancellation errors increase with increases in ρ and | r | , and may be estimated by comparing the final sum of the series with the largest partial sum. …
25: 24.4 Basic Properties
§24.4(iii) Sums of Powers
24.4.7 k = 1 m k n = B n + 1 ( m + 1 ) B n + 1 n + 1 ,
24.4.8 k = 1 m ( 1 ) m k k n = E n ( m + 1 ) + ( 1 ) m E n ( 0 ) 2 .
§24.4(iv) Finite Expansions
24.4.24 B n ( m x ) = m n B n ( x ) + n k = 1 n j = 0 k 1 ( 1 ) j ( n k ) ( r = 1 m 1 e 2 π i ( k j ) r / m ( 1 e 2 π i r / m ) n ) ( j + m x ) n 1 , n = 1 , 2 , , m = 2 , 3 , .
26: 1.12 Continued Fractions
1.12.18 p 0 + k = 1 n p 1 p 2 p k = p 0 + p 1 1 p 2 1 + p 2 p 3 1 + p 3 p n 1 + p n , n = 0 , 1 , 2 , ,
1.12.19 k = 0 n c k x k = c 0 + c 1 x 1 ( c 2 / c 1 ) x 1 + ( c 2 / c 1 ) x ( c 3 / c 2 ) x 1 + ( c 3 / c 2 ) x ( c n / c n 1 ) x 1 + ( c n / c n 1 ) x , n = 0 , 1 , 2 , ,
A continued fraction converges if the convergents C n tend to a finite limit as n . … and the even and odd parts of the continued fraction converge to finite values. …
1.12.28 n = 1 | b n | = .
27: Bibliography J
  • A. Jonquière (1889) Note sur la série n = 1 x n / n s . Bull. Soc. Math. France 17, pp. 142–152 (French).
  • C. Jordan (1939) Calculus of Finite Differences. Hungarian Agent Eggenberger Book-Shop, Budapest.
  • C. Jordan (1965) Calculus of Finite Differences. 3rd edition, AMS Chelsea, Providence, RI.
  • 28: 2.3 Integrals of a Real Variable
    is finite and bounded for n = 0 , 1 , 2 , , then the n th error term (that is, the difference between the integral and n th partial sum in (2.3.2)) is bounded in absolute value by | q ( n ) ( 0 ) / ( x n ( x σ n ) ) | when x exceeds both 0 and σ n . …
    29: 26.18 Counting Techniques
    26.18.1 | S ( A 1 A 2 A n ) | = | S | + t = 1 n ( 1 ) t 1 j 1 < j 2 < < j t n | A j 1 A j 2 A j t | .
    30: 7.6 Series Expansions
    7.6.1 erf z = 2 π n = 0 ( 1 ) n z 2 n + 1 n ! ( 2 n + 1 ) ,
    7.6.2 erf z = 2 π e z 2 n = 0 2 n z 2 n + 1 1 3 ( 2 n + 1 ) ,
    7.6.5 C ( z ) = cos ( 1 2 π z 2 ) n = 0 ( 1 ) n π 2 n 1 3 ( 4 n + 1 ) z 4 n + 1 + sin ( 1 2 π z 2 ) n = 0 ( 1 ) n π 2 n + 1 1 3 ( 4 n + 3 ) z 4 n + 3 .
    7.6.7 S ( z ) = cos ( 1 2 π z 2 ) n = 0 ( 1 ) n π 2 n + 1 1 3 ( 4 n + 3 ) z 4 n + 3 + sin ( 1 2 π z 2 ) n = 0 ( 1 ) n π 2 n 1 3 ( 4 n + 1 ) z 4 n + 1 .
    The series in this subsection and in §7.6(ii) converge for all finite values of | z | . …