An improvement of the Euler-Chebyshev iterative method (Q819019)

The computation of a simple root of a sufficiently smooth scalar function \(f\) is discussed. The Newton method and the Euler-Chebyshev method are briefly presented. A method based on the Euler-Chebyshev method using a linear combination of function values of \(f\) with a convergence order of 5 is constructed. For the practical test of 13 functions, a Maple-algorithm with iteration depending arithmetic is used.