Академический Документы
Профессиональный Документы
Культура Документы
11.1
Chapter 11
if it is known that a0 =
Solution: We want to nd a100 if it is known that 0 [(n + 1 )2 an+2 n2 an+1 + (n 1 )an ] xn = 0. 2 The recursion identity here is (n + 1 ) an+2 n2 an+1 + (n 1 )an = 0, that is, an+2 = [n2 an+1 (n 1 )an]/(n + 1 )2 , n = 0, 1, 2, . . ., where a0 = a1 = 1. A computer may easily be programmed to calculate the coefcients using the identity and the initial data a0 = a1 = 1. In fact, a100 1.0629 106 .
11.2
a ( s ) ds
In Legendres ODEs of order 0 and 1, we have that a ( x ) = 2 x/(1 x2 ), u0 ( x ) = 1, x 2 and u1 ( x ) = x, respectively. So v0 = e 2s/(1s )ds = C1 /(1 x2 ), and (using an integral table) v0 = C1 1 + x ln + C2 , 2 1x
x
(C1 > 0 )
(1/ s ) ds
[C3 +
x
(1/) d
C1 ds] s ( 1 s2 )
= x[C3 + C1
C1 2 s ( 1 s2 )
ds]
1 1 1+x )] (C1 > 0 ) = x[C3 + C1 ( + ln x 2 1x where we have used a table of integrals. So, second independent solutions for Legendres equations of order 0 and 1 on the interval | x| < 1 are, respectively, C1 1 + x 1 1 1+x ln + C2 and v1 = x[C3 + C1 ( + ln )] 2 1x x 2 1x where C1 , C2 and C3 are constants and C1 > 0. See Graph 1 and Graph 2, respectively, for graphs of v0 and v1 , where C1 = 1, C2 = 0, C3 = 0. v0 =
v0
v1
11.3
Solution: Each of the equations may be written as an Euler equation x2 y + p0 xy + q0 y = 0, and the solutions are determined by the roots r1 and r2 of the indicial polynomial r 2 + ( p0 1 )r + q0 . The three types of solutions are given in (13) in the text. In each case we list the indicial polynomial, its roots, and then the general solution; c1 and c2 denote arbitrary constants. It is assumed throughout that x > 0, and absolute value signs around x are not needed. See the appropriate gures for plots of some solutions of each equation. For negative x, replace x by | x| in all formulas. (a) r 2 r 6; r1 = 2, r2 = 3; y = c1 x2 + c2 x3 . (c) r 2 + 9; r1 = 3i, r2 = 3i; y = c1 cos(3 ln x ) + c2 sin(3 ln x ). (e) r 2 2r + 5; r1 = 1 + 2i = r 2 ; y = x[c1 cos(2 ln x ) + c2 sin(2 ln x )].
Problem 11.4.3(a).
Problem 11.4.3(c).
Problem 11.4.3(e).
11.4
The indicial polynomial is r 2 + 2r/3 1/3 and r1 = 1/3, r2 = 1. There are independent solutions of the form y 1 = x 1 /3 + a 1 x 4 /3 + a 2 x 7 /3 + , y2 = x1 + b1 + b2 x +
where we have set a0 = b0 = 1 in each series. Although we could use Frobenius Theorem I to determine the coefcients, it is probably simpler to make a direct substitution of y1 and then y2 into the ODE. For y1 we have that 3 x2 y1 + 5 xy1 e x y1 = (7a1 1 ) x4/3 + (20a2 a1 1/2 ) x7/3 + (39a3 a2 a1 /2 1/6 ) x10/3 + = 0 So a1 = 1/7, a2 = 9/280, a3 = 227/32760 and y1 = x1/3 + x4/3 /7 + 9 x7/3 /280 + 227 x10/3 /32760 + In the same way we see that y2 = x1 1 x/8 11 x2 /360 +
J1 / 2 , J3 / 2 , J5 / 2
J0 , J1 , J2 , J3
11.5
Solution: It is straightforward to show that 0 is a regular singular point of each ODE; the details are omitted. (a) The ODE is xy + (1 + x ) y + y = 0. The equation in standard form is x2 y + x (1 + x ) y + xy = 0. So, p0 = 1, q0 = 0 and the indicial polynomial is r 2 with roots r1 = r2 = 0. We are in Case II of Frobenius Theorem II. First, there is a solution of the form y1 = n=0 an xn with a0 = 1. Using the techniques of Section 11.5, we see that the recursion formula in this case is an+1 = an /(n + 1 ), n = 0, 1, 2, and a solution is y1 =
n=0
(1 )n xn / n! = ex
We have by the Wronskian Reduction Method of Problem 6, Section 3.7, that ex y2 + x ex y2 = ex / x, where the right-hand side is exp[ a (s )ds], a (s ) = s1 + 1, for the normalized ODE, y + x1 (1 + x ) y + x1 y = 0. So, y2 + y2 = 1/ x, or ( y2 e x ) = e x / x. We have as a second independent solution y2 = e x
x
(es /s )ds
Since the integral cant be expressed in terms of elementary functions, we use power series techniques. Expanding es in its Taylor series about x0 = 0, dividing each term by s, and integrating term by term, we have that y2 = ex [ln x + x + x2 /4 + + xn /(n!n ) + ] = y1 ( x )[ln x + x + x2 /4 + + xn /(n!n ) + ] (c) The ODE is xy xy + y = 0. Here the ODE in standard form is x2 y x2 y + xy = 0, and the indicial polynomial is r 2 r and r1 = 1, r2 = 0. We are in Case III of Frobenius Theorem II. We may use the methods of Section 11.5 to nd a solution y1 = n=0 an xn+1 , a0 = 1. The recursion formula is an+1 = So an = 0 for n 1 and y1 = x is a solution. We have by the Wronskian Reduction Method of Problem 6, Section 3.7 that xy2 y2 = e x , y2 y2 / x = e x / x, ( y2 / x ) = e x / x2 and
x
(1 n )a n , n (n + 1 )
n0
y2 = x
where we replaced es by its Maclaurin series, divided each term by s2 , and then integrated term by term.
11.6
r J0 ( xn r ) dr =
0
2 2 [ J1 ( xn )] sinh( xn a )k2 n
(r J1 ( xn r )) dr
0
1 2 2 ( r J ( x r )) = 1 n 2 2 0 [ J1 ( xn )] sinh( xn a )) xn J1 ( xn ) sinh( xn a )) x2 n