Scribd
Upload
24 views4 pages

Numerical Methods For Engineers - 9780073397924 - Exercise 2 - Quizlet

The document outlines a numerical method for finding the root of a given equation using the bisection method followed by the Newton-Raphson method. It details the steps taken to estimate the root, including function evaluation and iterative calculations. The final result approximates the root R to be 0.56349.

Uploaded by

rabiyairfannadeem
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views4 pages

Numerical Methods For Engineers - 9780073397924 - Exercise 2 - Quizlet

The document outlines a numerical method for finding the root of a given equation using the bisection method followed by the Newton-Raphson method. It details the steps taken to estimate the root, including function evaluation and iterative calculations. The final result approximates the root R to be 0.56349.

Uploaded by

rabiyairfannadeem
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Science Engineering Numerical Methods for Engineers (7th Edition)

Exercise 2
Chapter 8, Page 215

Numerical Methods for Engineers


ISBN: 9780073397924

Table of contents

Solution Verified

Step 1 1 of 5

Determine the root of the given equation by finding R such that f (R) =
0 where
1 + R (1 − 0.9) R+1
f (R) = ln −
R (1 − 0.9) R (1 + R (1 − 0.9))
​ ​

The function is easy enough to differentiate, but the plot looks as though
the derivative is close to zero near the root. The following graph was
created in GNU Octave, a free MATLAB alternative, using the code shown
below.
Step 2 2 of 5

ff=@(x) log((1+x*0.1)/(x*0.1))-(x+1)/x*(1+x*0.1);

x=0.1:0.1:3;

for i=1:30
y(i)=ff(x(i));
end
Step 3 3 of 5

As R ∈ [0, 1], start by estimating the root using the bisection method until
the approximation gets closer to the true root. Move the lower bound of
the interval to 0.1 as the function is undefined in R = 0.

0.1 + 1
i=1 xr = = 0.505
2
​ ​

f (xr ) = −0.095 ⇒ f (xl ) ⋅ f (xr ) > 0 ⇒ xl = xr


​ ​ ​ ​ ​

0.505 + 1
i=2 xr = = 0.7525
2
​ ​

f (xr ) = 0.155 ⇒ f (xl ) ⋅ f (xr ) < 0 ⇒ xu = xr


​ ​ ​ ​ ​

​ ​

0.505 + 0.7525
i=3 xr = = 0.62875
2
​ ​

f (xr ) = 0.0742 ⇒ f (xl ) ⋅ f (xr ) < 0 ⇒ xu = xr


​ ​ ​ ​ ​

0.505 + 0.62875
i=4 xr = = 0.566875
2
​ ​

f (xr ) = 0.0046
​

Now it is safe to assume that xr is an initial guess precise enough for the
​

Newton-Raphson method to demonstrate convergence. Note that

0.1x 10 1 ⋅ (x + 0.1x2 ) − (x + 1) (1 + 0.2x)


′
f (x) = ⋅ (− 2 ) −
1 + 0.1x (x + 0.1x2 )2
​ ​ ​

x
x 0.1x2 + 0.2x + 1
​ ​

=− 2 +
x + 0.1x3 (x + 0.1x2 )2
​ ​
Step 4 4 of 5

Perform iterations given by formula (6.6) to obtain

f (xr ) f (0.566875)
i=1 x1 = xr − = 0.566875 − = 0.563858
​

f ′ (xr ) f ′ (0.56875)
​ ​ ​ ​

0.563858 − 0.566875
εa = = −0.00535
0.563858
​ ​

f (x1 )
i=2 x2 = x1 − = 0.563529
​

f ′ (x1 )
​ ​ ​

0.563529 − 0.563858
​ ​

ε=
0.563529
​

f (x2 )
i=3 x3 = x2 − ′ = 0.563491
​

f (x2 )
​ ​ ​ ​

0.563491 − 0.563529
εa = = −6.75 ⋅ 10−5
0.563491
​ ​

Result 5 of 5

R ≈ 0.56349

Rate this solution

Exercise 1 Exercise 3

Privacy Terms English (USA)

You might also like