(a) Assume that f(x) could be written as f(x) = (x-x₂)²q(x), where q(xr) 0 (i) Show that f(xr) = f'(xr) = 0 (ii) Show that µ(xr) = 0 but µ'(xr) ‡ 0. (iii) The results above show that finding the root of f(x) is equivalent to finding the root of μ(x). Hence, show that a modified version of the Newton-Raphson method that can be used in order to achieve quadratic convergence is f(x₁) f'(x₂) [f′(æi)]? – f(xi)f"(x) (iv) Use Eqs. (2.19) and (2.21) to obtain the root of ƒ(x) = e(x−¹) — x. (b) Solve (2.20) Xi+1 = Xi (2.21) (2.22) You might like to plot the function to see how it looks like. Start with an initial guess of xo 5. Which of the two methods give you faster convergence? The exact answer is r = 1. = x³ + 4x −9=0 (2.23) using both Eq. (2.19) and Eq. (2.21). Start with an initial guess of co = 5. (c) Compare the convergence and discuss the advantages and disadvantages of each schemes.

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
Exercise 2.11:
The formula for Newton-Raphson method is given by
Xi+1 = Xi
(2.19)
which can be used to find the root, xr, of a function, f(x). It has been been
shown in lectures that the Newton-Raphson method has quadratic convergence
providing that f'(x) ‡ 0. In cases where f'(x) = 0 one will not be able to
achieve quadratic convergence with Eq. (2.19). In order to achieve quadratic
convergence for cases where f'(x) = 0, we have to define another function, µ(x),
where
µ(x) =
=
f (x₂)
f'(xi)
-
f(x)
f'(x)
Transcribed Image Text:Exercise 2.11: The formula for Newton-Raphson method is given by Xi+1 = Xi (2.19) which can be used to find the root, xr, of a function, f(x). It has been been shown in lectures that the Newton-Raphson method has quadratic convergence providing that f'(x) ‡ 0. In cases where f'(x) = 0 one will not be able to achieve quadratic convergence with Eq. (2.19). In order to achieve quadratic convergence for cases where f'(x) = 0, we have to define another function, µ(x), where µ(x) = = f (x₂) f'(xi) - f(x) f'(x)
(a) Assume that f(x) could be written as
f(x) = (x − x)²q(x),
where q(x) 0
(i) Show that f(x₁) = f'(x₁) = 0
(ii) Show that u(x₁) = 0 but µ'(x) ‡ 0.
µ(xr)
(iii) The results above show that finding the root of f(x) is equivalent
to finding the root of u(x). Hence, show that a modified version of
the Newton-Raphson method that can be used in order to achieve
quadratic convergence is
Xi+1 = Xi
f(i)f(i)
[f′(xi)]? – f(xi)f"(i)
m(xr)
(iv) Use Eqs. (2.19) and (2.21) to obtain the root of
(b) Solve
=
(2.20)
f(x) = e(x-¹) — x.
e(x−1)
(2.22)
You might like to plot the function to see how it looks like. Start with
an initial guess of xo 5. Which of the two methods give you faster
convergence? The exact answer is x = 1.
3
x³ + 4x − 9=0
(2.21)
(2.23)
using both Eq. (2.19) and Eq. (2.21). Start with an initial guess of xo = 5.
(c) Compare the convergence and discuss the advantages and disadvantages of
each schemes.
Transcribed Image Text:(a) Assume that f(x) could be written as f(x) = (x − x)²q(x), where q(x) 0 (i) Show that f(x₁) = f'(x₁) = 0 (ii) Show that u(x₁) = 0 but µ'(x) ‡ 0. µ(xr) (iii) The results above show that finding the root of f(x) is equivalent to finding the root of u(x). Hence, show that a modified version of the Newton-Raphson method that can be used in order to achieve quadratic convergence is Xi+1 = Xi f(i)f(i) [f′(xi)]? – f(xi)f"(i) m(xr) (iv) Use Eqs. (2.19) and (2.21) to obtain the root of (b) Solve = (2.20) f(x) = e(x-¹) — x. e(x−1) (2.22) You might like to plot the function to see how it looks like. Start with an initial guess of xo 5. Which of the two methods give you faster convergence? The exact answer is x = 1. 3 x³ + 4x − 9=0 (2.21) (2.23) using both Eq. (2.19) and Eq. (2.21). Start with an initial guess of xo = 5. (c) Compare the convergence and discuss the advantages and disadvantages of each schemes.
Expert Solution
steps

Step by step

Solved in 5 steps with 4 images

Blurred answer
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,