When we compute a root of equation
F(
X)=0,
Mailer's Method uses three initial approximations
X0,
X1, and
X2 and determines the next approximation
X3 by the intersection of the X-axis with the parabola through (
X0,
F(
X0)), (
X1,
F(
X1)), and (
X2,
F(
X2)). The procedure is repeated successively to improve the approximate solution of an equation
F(
X)=0.
Suppose a continuous function
F, defined on the interval [
X0,
X1] is given, with
F(
X0) and
F(
X1) being opposite signs. In our
New-Mailer's Method we choose
X0 and
X1 as the ends of the interval and take another initial approximation
X2 as the mid-point of
X0,
X1 and new approximation
X3 is the intersection of the X-axis with a quadratic curve through (
X0,
F(
X0)), (
X2,
F(
X2)), and (
X1,
F(
X1)). This method is proposed to improve the rate of convergence and calculate faster for reducing the interval. Let us call this method
New-Muller's Method in this paper.
View full abstract