Explain Muller’s method briefly.
In Muller’s method, f (x) = 0 is approximated by a second degree polynomial; that is by a quadratic equation that fits through three points in the vicinity of a root. The roots of this quadratic equation are then approximated to the roots of the equation f (x) 0.This method is iterative in nature and does not require the evaluation of derivatives as in Newton-Raphson method. This method can also be used to determine both real and complex roots of f (x) = 0.
In Muller’s method, f (x) = 0 is approximated by a second degree polynomial; that is by a quadratic equation that fits through three points in the vicinity of a root. The roots of this quadratic equation are then approximated to the roots of the equation f (x) 0.This method is iterative in nature and does not require the evaluation of derivatives as in Newton-Raphson method. This method can also be used to determine both real and complex roots of f (x) = 0.
0 comments
Post a Comment