MÜLLERS
METHOD
Presentation By :-
Siddharth Singh
231ME353
Mechanical Engineering (M3)
WHAT ?
• MULLER’S METHOD
It is a root-finding algorithm, a numerical method for
solving equations of the form f(x) = 0. Muller's method is
a recursive method that generates a new approximation
of a root of f(x) at each iteration using the three prior
iterations (x0, x1, x2).
It uses three points corresponding to the last three
iterative approximations, constructs a parabola through
these three points, and then uses a root of the parabola
as the next approximation at every iteration.
It is more efficient and faster in some cases.
WHEN ?
• HISTORY
This root-finding algorithm was developed by the American mathematician,
David E. Muller in 1956.
In 1956, David E. Müller introduced an improvement over the various method by
using quadratic interpolation instead of linear interpolation to approximate the
root.
Müller's method uses three points to form a quadratic curve and solves for the
root of that quadratic. This improves upon the secant method's convergence
rate, as quadratic functions tend to converge faster than linear functions.
Müller’s method essentially combines the secant method and quadratic
interpolation, using three points to fit a parabola through the data points and
find the next approximation of the root.
WHY ?
Müller's method has found application in various fields of numerical analysis including Root-finding in polynomials,
Optimization, Scientific Computing.
The problem while applying Secant, False-Position or Newton’s Method of Polynomial is the possibility of
polynomial having Complex root, even when all coefficient are real number.
Mullers method is the extended version of Secant method.
WHY NOT?
Müller's method has many advantages, it also has some drawbacks, Requires Three Initial Points (method
requires three starting points, which can make it less practical in some cases where only one initial guess is
available), Possible Instability (if the initial guesses are poorly chosen, the method can fail or produce
inaccurate results), Computational Cost (Each iteration of Müller's method requires solving a quadratic
equation, which is more computationally expensive than the secant method’s linear approximation.)
HOW ?
• Algorithm
• Relation between my Code & Actual method
MY PYTHON CODE
EXAMPLES
1. Find a root between 0 to 1 of an equation f(x)=3x+sin(x)-ex using Mullers
method.
Given :- x0 = 0.000000, f(x0) = -1.000000
x1 = 0.500000, f(x1) = 0.330704
x2 = 1.000000, f(x2) = 1.123489
Ans.
THANK
YOU
