Müller's method uses three points, It constructs a parabola through these three points, and takes the intersection of the x-axis with the parabola to be the next approximation. The order of convergence of Müller's method is approximately 1.84. This method could be advantageous if looking for a complex roots, since any iterates can be complex even if previous ones are real.
Procedure to run the code:
Press F5 or RUN, then in command window a message would be displayed- "Polynomial function of Order "n" is of type:a[1]X^n+a[2]X^(n-1)+ ..+a[n]X^1+a[n+1]
Type Coeff as "[ 1 2 3 ...]" i.e Row vector form."
Enter the values according to above order.
If polynomial is more than 1st order, it would ask for three initial guess for iteration.
Please provide with three distinct numbers or else error message would be displayed.
e.g.
Enter the coefficient in order? [1 2 3 4 5]
Give the three initial guess point [x0, x1, x2]: [-1 0 1]
or any other three distinct number,
If the range of solution is known then using a value close to that range might yield a faster result. Or if you don't have any clue about value of root then just press enter when ask for guess, and it would use default value of [1 2 3]. If you have found the desired root that you want you can terminate the process any time, writing [0 0 0] when asked for initial Guess.
|
