(i) Rewrite the equation (3.1) in the form 1 3! 5! 7! suitable for application of the Fixed-Point Iteration method, and then show that the iteration function 73 g(x) = 3! 1 5! 7! takes the interval [a, b) = [0.5,0.5861] into itself and there is a constant kE (0, 1) such that lg'(x)| < k for all z € [a, b) = [0.5, 0.5861]. This will imply that given any po € [a, b), the sequence (pn) generated by the Fixed-Point Iteration method converges to the fixed point p of the function g(x) in [a, b), and hence to the minimal positive solution of the equation (3.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
100%
Numerical Analysis & it’s applications. Q3 Part (i) The equation (3.1) is written in the beginning of the question which is x-x^3/3! +.........
3. (Fired-Point Iteration Method;
Consider the equation
73
1
(3.1)
%3D
3!
5!
7!
2
Since we have the seventh Taylor polynomial of the sine function centered at zero in the left-hand side of the equation, it is reasonable to expect
that the minimal positive solution of the equation can be a good enough approximation of 1/6.
(i) Rewrite the equation (3.1) in the form
73
3!
5!
+
7!
suitable for application of the Fixed-Point Iteration method, and then show that the iteration function
77
1
g(x) =
3!
5!
7!
2
takes the interval [a, b] = [0.5,0.5861] into itself and there is a constant k e (0, 1) such that
|g'(x)| < k
for all a € [a, b) = [0.5, 0.5861]. This will imply that given any po € [a, b], the sequence (pn) generated by the Fixed-Point Iteration method
converges to the fixed point p of the function g(x) in [a, b], and hence to the minimal positive solution of the equation (3.1).
Transcribed Image Text:3. (Fired-Point Iteration Method; Consider the equation 73 1 (3.1) %3D 3! 5! 7! 2 Since we have the seventh Taylor polynomial of the sine function centered at zero in the left-hand side of the equation, it is reasonable to expect that the minimal positive solution of the equation can be a good enough approximation of 1/6. (i) Rewrite the equation (3.1) in the form 73 3! 5! + 7! suitable for application of the Fixed-Point Iteration method, and then show that the iteration function 77 1 g(x) = 3! 5! 7! 2 takes the interval [a, b] = [0.5,0.5861] into itself and there is a constant k e (0, 1) such that |g'(x)| < k for all a € [a, b) = [0.5, 0.5861]. This will imply that given any po € [a, b], the sequence (pn) generated by the Fixed-Point Iteration method converges to the fixed point p of the function g(x) in [a, b], and hence to the minimal positive solution of the equation (3.1).
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

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,