Scribd
Upload
507 views

Muller Method: Where Z - 2c B B - 4ac

Muller's method is a generalization of the secant method for finding roots of equations. It uses three initial approximations to the root to fit a quadratic polynomial, then finds the root of the quadratic to get the next approximation. This is repeated, choosing the two values closest to the new approximation at each step, until convergence within a specified tolerance is achieved. Examples are provided to demonstrate finding roots of various equations using Muller's method.

Uploaded by

Kantharaj Chinnappa
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
507 views

Muller Method: Where Z - 2c B B - 4ac

Muller's method is a generalization of the secant method for finding roots of equations. It uses three initial approximations to the root to fit a quadratic polynomial, then finds the root of the quadratic to get the next approximation. This is repeated, choosing the two values closest to the new approximation at each step, until convergence within a specified tolerance is achieved. Examples are provided to demonstrate finding roots of various equations using Muller's method.

Uploaded by

Kantharaj Chinnappa
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

MULLER METHOD

Muller's method is a generalization of the secant method. Instead of starting with two
initial values and then joining them with a straight line in secant method, Mullers
method starts with three initial approximations to the root and then join them with a
second degree polynomial (a parabola), then the quadratic formula is used to find a
root of the quadratic for the next approximation. That is if x
0
, x
1
and x
2
are the initial
approximations then x
3
is obtained by solving the quadratic which is obtained by
means of x
0
, x
1
and x
2
. Then two values among x
0
, x
1
and x
2
which are close to x
3
are
chosen for the next iteration

x
3
= x
2
+ z ( * )

where z =
-2c
b\( b
2
-4ac)
a = D
1
/D
2
, b = D
2
/D and c = f(x
2
)
D = h
0
h
1
(h
0
-h
1
) , D
1
= (f
0
-c)h
1
-(f
1
-c)h
0
, D
2
= (f
1
-c)h
0
2
- (f
0
-c)h
1
2

h
0
= x
0
-x
2
, h
1
= x
1
-x
2






Algorithm - Muller's Scheme
Given an equation f(x) = 0
Let the initial guesses be x
0
, x
1
and x
2

Let x
i
= x
2
, x
i-1
= x
1
and

x
i-2
= x
0

Compute f(x
i-2
), f(x
i-1
) and f(x
i
)
Do

Compute
h = x - x
i
, h
i
= x
i
- x
i-1
and h
i-1
= x
i-1
- x
i-2


i
= h
i
/ h
i-1
, o
i
= 1 +
i

g
i
=
i
2
f
i-2
- o
i
2
f
i-1
+ (
i
+ o
i
) f
i

c
i
=
i
(
i
f
i-2
- o
i
f
i-1
+ f
i
)

i+1
= min ( -2o
i
f
i
/ (g
i
\(g
i
2
- 4o
i
f
i
c
i
) ) )
(take minimum in absolute sense)
Then x
i+1
= x
i
+ ( x
i
-

x
i-1
)
i+1
, i = 2, 3, 4, . . .
while (none of the convergence criterion C1 or C2 is met)
- C1. Fixing apriori the total number of iterations N.
- C2. By testing the condition | x
i+1
- x
i
| (where i is the iteration number) less than
some tolerance limit, say epsilon, fixed apriori.
Numerical Example :
Find the root of 3x+sin[x]-exp[x]=0 [ Graph]
Let the initial guess be 0.0 and 1.0
f(x) = 3x+sin[x]-exp[x]

i 0 1 2 3 4 5 6
x
i
0 1 0.471 0.308 0.363 0.36 0.36
So the iterative process converges to 0.36 in six iterations.



Worked out problems
Exapmple 1 Find a root of cos(x) - x * exp(x) = 0 Solution
Exapmple 2 Find a root of x
4
-x-10 = 0 Solution
Exapmple 3 Find a root of x-exp(-x) = 0 Solution
Exapmple 4 Find a root of exp(-x) * (x
2
-5x+2) + 1= 0 Solution
Exapmple 5 Find a root of x-sin(x)-(1/2)= 0 Solution
Exapmple 6 Find a root of exp(-x) = 3log(x) Solution
Problems to workout



Work out with theMuller method here

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy