0% found this document useful (0 votes)
27 views3 pages

1-Roots of Equations-Exercises Solutions

The document discusses numerical methods for finding roots of equations, specifically using the Bisection, False Position, Fixed Point Iteration, Newton, Secant, and Modified Secant methods. It provides detailed iterations and calculations for each method applied to different functions. The results include approximate root values for each method after a specified number of iterations.

Uploaded by

sraiden49
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
0% found this document useful (0 votes)
27 views3 pages

1-Roots of Equations-Exercises Solutions

The document discusses numerical methods for finding roots of equations, specifically using the Bisection, False Position, Fixed Point Iteration, Newton, Secant, and Modified Secant methods. It provides detailed iterations and calculations for each method applied to different functions. The results include approximate root values for each method after a specified number of iterations.

Uploaded by

sraiden49
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/ 3

Numerical Methods

Exercises - Roots of Equations:

(1) Consider finding the root of f(x) = e-x(3.2 sin(x) - 0.5 cos(x)) on the interval [3, 4], εs = 0.1%
using (i) Bisection method (ii) False position method.

Solution:

Bisection method:

iteration
# L U f(L) f(U) r f(r) εa %
1 3 4 0.047127457 -0.03837028 3.5 -0.01975748
2 3 3.5 0.047127457 -0.01975748 3.25 0.005848717 7.692308
3 3.25 3.5 0.005848717 -0.01975748 3.375 -0.00868108 3.703704
4 3.25 3.375 0.005848717 -0.00868108 3.3125 -0.00187696 1.886792
5 3.25 3.3125 0.005848717 -0.00187696 3.28125 0.001867025 0.952381
6 3.28125 3.3125 0.001867025 -0.00187696 3.296875 -3.4225E-05 0.473934
7 3.28125 3.296875 0.001867025 -3.4225E-05 3.2890625 0.000909029 0.23753
8 3.289063 3.296875 0.000909029 -3.4225E-05 3.2929688 0.000435567 0.118624
9 3.292969 3.296875 0.000435567 -3.4225E-05 3.2949219 0.000200213 0.059277

r = 3.296875

False position method:

iteration
# L U f(L) f(U) r f(r) εa %
1 3 4 0.047127457 -0.03837028 3.5512129 -0.02340513
2 3 3.551213 0.047127457 -0.02340513 3.3683016 -0.00799417 5.430374
3 3 3.368302 0.047127457 -0.00799417 3.3148876 -0.00215345 1.611336
4 3 3.314888 0.047127457 -0.00215345 3.3011278 -0.00054154 0.41682
5 3 3.301128 0.047127457 -0.00054154 3.2977069 -0.0001338 0.103737
6 3 3.297707 0.047127457 -0.0001338 3.2968641 -3.2914E-05 0.025565

r = 3.2968641

1
Numerical Methods

(2) Find the root of (e-x * (x2+5x+2)) + 1= 0 using (i) Fixed point iteration method (ii) Newton
method, xo = -2

Solution:

Fixed point iteration method:

Consider g(x) = (ex+x2+2)/-5

iteration # xi
0 -2
1 -1.22707
2 -0.75977
3 -0.609
4 -0.58296
5 -0.57962
6 -0.57921
7 -0.57917
8 -0.57916
9 -0.57916

Newton method:

iteration # xi
0 -2
1 -1.22707
2 -0.77562
3 -0.60291
4 -0.57955
5 -0.57916
6 -0.57916

2
Numerical Methods

(3) Find a root of the following function:

Using (i) Secant method (x-1= 3, x0 = 4) (ii) Modified Secant method ( x0 = 3,  = 0.01), for three
iterations:

Secant method:

Modified Secant method:

You might also like