1. The function f(x) = 49x³ - 35x² - 48x + 36 has a root of multiplicity 2 near x = 1. a) Can the (i) bisection method, (ii) regula falsi, (iii) standard Newton-Raphson method, (iv) secant method or (v) fixed-point iteration with g(x) = be used to determine = 35x²+48x-36 49x² this root? In each case, without doing any iterations, state why or why not. b) What is the order of iteration in finding this root using (i) the standard Newton-Raphson method, (ii) the Modified Newton-Raphson Method 1 [Xn+1 = xn - m and (iii) the u(xn) u'(xn) where u(x) = f(x)]. f'(x) From all the methods listed in parts (a) and (b), choose the method which you feel converges the fastest to determine the root to at least six significant figures. Prove that the multiplicity of the root found in part (c) is 2. d) c) Modified Newton-Raphson Method 2 [Xn+1 = Xn f(xn)] f'(xn) -

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

Please only answer part(s) c and d. Do not answer parts a, b, or c

1. The function f(x) = 49x³ - 35x² - 48x + 36 has a root of multiplicity 2 near x = 1.
a) Can the (i) bisection method, (ii) regula falsi, (iii) standard Newton-Raphson method, (iv)
secant method or (v) fixed-point iteration with g(x):
be used to determine
35x²+48x-36
49x²
this root? In each case, without doing any iterations, state why or why not.
=
b) What is the order of iteration in finding this root using (i) the standard Newton-Raphson
method, (ii) the Modified Newton-Raphson Method 1 [xn+1 = xn-m- f(x) and (iii) the
f'(xn)]
where u(x) = f(x)].
Modified Newton-Raphson Method 2 [Xn+1 = xn
u(xn)
u'(xn)
c)
From all the methods listed in parts (a) and (b), choose the method which you feel converges
the fastest to determine the root to at least six significant figures.
d) Prove that the multiplicity of the root found in part (c) is 2.
-
Transcribed Image Text:1. The function f(x) = 49x³ - 35x² - 48x + 36 has a root of multiplicity 2 near x = 1. a) Can the (i) bisection method, (ii) regula falsi, (iii) standard Newton-Raphson method, (iv) secant method or (v) fixed-point iteration with g(x): be used to determine 35x²+48x-36 49x² this root? In each case, without doing any iterations, state why or why not. = b) What is the order of iteration in finding this root using (i) the standard Newton-Raphson method, (ii) the Modified Newton-Raphson Method 1 [xn+1 = xn-m- f(x) and (iii) the f'(xn)] where u(x) = f(x)]. Modified Newton-Raphson Method 2 [Xn+1 = xn u(xn) u'(xn) c) From all the methods listed in parts (a) and (b), choose the method which you feel converges the fastest to determine the root to at least six significant figures. d) Prove that the multiplicity of the root found in part (c) is 2. -
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 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,