Yk+1 = f(a) + f^(a)(uk)", (2.143) and 1 Uk+1 = n! (2.144) This last equation has the solution Ant Uk |A| < 1, (2.145) [f® (a)/n!]1/(n=1)* where A is an arbitrary constant satisfying the condition given by equation (2.145). Let us now make the following definitions: 1 t = A"", B1 = (2.146) [f(m)(a)/n!]l/(n-1)' and assume that Yk = z(t) = a+Bịt+B2t2 +.... (2.147) Note that t" = An(*+1) (2.148) %3D Therefore, from yk+1 = f(yk), we have z(t") = f[z(t)]. (2.149) On substituting the expansion of equation (2.147) into this expression, we obtain the result 1 a + Bit" + B2ť²n + ...= f(a) +f (a)(Bịt+ B2ť² %3D n! 1 + B3t° + ...)" + f(a+D(a)(B¡t (2.150) (n + 1)!" + B2t? + B3t³ + ...)"+1 + ....

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

Explain this and the theorem of part 2 it is from equation2.150

(ii) a =
f(a) and f'(a) = 0
Let f(n) (a) be the first nonzero derivative and let yk = a + uk. Therefore, in
the first approximation
Y+1 = S(a) + f (a)()",
(2.143)
Yk+1 =
and
1
Uk+1 =
n!
(2.144)
This last equation has the solution
92
Ant
Uk =
|A| < 1,
(2.145)
[fm) (a)/n!]1/(n-1)
where A is an arbitrary constant satisfying the condition given by equation
(2.145).
Let us now make the following definitions:
1
= A"",
B1
[f(m) (a)/n!]!/(n=1)
(2.146)
t =
and assume that
Yk = z(t) = a + Bịt + B2t2 + ....
(2.147)
Note that
t" = An(k+1)
(2.148)
Therefore, from yk+1 =
f(yk), we have
z(t") = f[z(t)].
(2.149)
On substituting the expansion of equation (2.147) into this expression, we
obtain the result
1
a + Bit" + Bot2n +.= f(a) + f(") (a)(Bit+ B2t?
n!
1
+ Bzt° + .)" +
(n + 1)! F*+1)(a)(Bịt (2.150)
+ Bzt? + B3t³ + ...)"+1 + ....
FIRST-ORDER DIFFERENCE EQUATIONS
69
Equating powers of t on each side allows the determination of B2, B3, etc.
For n = 2, we have
z(t?) = f[2(t)],
(2.151)
a = f(a),
f'(a) = 0,
(2.152)
and
B1 =
f"(a)'
2f"(a)
3f"(a)3*
5 f" (a)³ f"(a)
B2 = -
(2.153)
f"'(a)
B3
9f"(a) 3f"(a)ª f"(a)³'
etc.
Transcribed Image Text:(ii) a = f(a) and f'(a) = 0 Let f(n) (a) be the first nonzero derivative and let yk = a + uk. Therefore, in the first approximation Y+1 = S(a) + f (a)()", (2.143) Yk+1 = and 1 Uk+1 = n! (2.144) This last equation has the solution 92 Ant Uk = |A| < 1, (2.145) [fm) (a)/n!]1/(n-1) where A is an arbitrary constant satisfying the condition given by equation (2.145). Let us now make the following definitions: 1 = A"", B1 [f(m) (a)/n!]!/(n=1) (2.146) t = and assume that Yk = z(t) = a + Bịt + B2t2 + .... (2.147) Note that t" = An(k+1) (2.148) Therefore, from yk+1 = f(yk), we have z(t") = f[z(t)]. (2.149) On substituting the expansion of equation (2.147) into this expression, we obtain the result 1 a + Bit" + Bot2n +.= f(a) + f(") (a)(Bit+ B2t? n! 1 + Bzt° + .)" + (n + 1)! F*+1)(a)(Bịt (2.150) + Bzt? + B3t³ + ...)"+1 + .... FIRST-ORDER DIFFERENCE EQUATIONS 69 Equating powers of t on each side allows the determination of B2, B3, etc. For n = 2, we have z(t?) = f[2(t)], (2.151) a = f(a), f'(a) = 0, (2.152) and B1 = f"(a)' 2f"(a) 3f"(a)3* 5 f" (a)³ f"(a) B2 = - (2.153) f"'(a) B3 9f"(a) 3f"(a)ª f"(a)³' etc.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Linear Equations
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,