About the Project

substitution of

AdvancedHelp

(0.001 seconds)

1—10 of 58 matching pages

1: 8.15 Sums
8.15.2 a k = 1 ( e 2 π i k ( z + h ) ( 2 π i k ) a + 1 Γ ( a , 2 π i k z ) + e 2 π i k ( z + h ) ( 2 π i k ) a + 1 Γ ( a , 2 π i k z ) ) = ζ ( a , z + h ) + z a + 1 a + 1 + ( h 1 2 ) z a , h [ 0 , 1 ] .
2: 29.10 Lamé Functions with Imaginary Periods
The substitutions
3: 3.2 Linear Algebra
With 𝐲 = [ y 1 , y 2 , , y n ] T the process of solution can then be regarded as first solving the equation 𝐋 𝐲 = 𝐛 for 𝐲 (forward elimination), followed by the solution of 𝐔 𝐱 = 𝐲 for 𝐱 (back substitution). … In solving 𝐀 𝐱 = [ 1 , 1 , 1 ] T , we obtain by forward elimination 𝐲 = [ 1 , 1 , 3 ] T , and by back substitution 𝐱 = [ 1 6 , 1 6 , 1 6 ] T . … and back substitution is x n = y n / d n , followed by …
4: 10.12 Generating Function and Associated Series
5: 10.35 Generating Function and Associated Series
6: 27.5 Inversion Formulas
7: 2.1 Definitions and Elementary Properties
means that for each n , the difference between f ( x ) and the n th partial sum on the right-hand side is O ( ( x c ) n ) as x c in 𝐗 . … Substitution, logarithms, and powers are also permissible; compare Olver (1997b, pp. 19–22). …
8: 29.12 Definitions
With the substitution ξ = sn 2 ( z , k ) every Lamé polynomial in Table 29.12.1 can be written in the form
29.12.9 ξ ρ ( ξ 1 ) σ ( ξ k 2 ) τ P ( ξ ) ,
9: 8.7 Series Expansions
8.7.6 Γ ( a , x ) = x a e x n = 0 L n ( a ) ( x ) n + 1 , x > 0 , a < 1 2 .
10: 10.13 Other Differential Equations