论文信息 - Algorithm 748: enclosing zeros of continuous functions

Algorithm 748: enclosing zeros of continuous functions

Two efficient algorithms for enclosing a zero of a continuous function are presented. They are similar to the recent methods, but together with quadratic interpolation they make essential use of inverse cubic interpolation as well. Since asymptotically the inverse cubic interpolation is always chosen by the algorithms, they achieve higher-efficiency indices: 1.6529… for the first algorithm, and 1.6686… for the second one. It is proved that the second algorithm is optimal in a certain family. Numerical experiments show that the two new methods compare well with recent methods, as well as with the efficient solvers of Dekker, Brent, Bus and Dekker, and Le. The second method from the present article has the best behavior of all 12 methods especially when the termination tolerance is small.

[1] Åke Björck,et al. A new high order method of regula falsi type for computing a root of an equation , 1973 .

[2] T. J. Dekker,et al. Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function , 1975, TOMS.

[3] D. Le,et al. An efficient derivative-free method for solving nonlinear equations , 1985, TOMS.

[4] Florian A. Potra,et al. On Two Higher Order Enclosing Methods of J. W. Schmidt , 1988 .

[5] F. Potra. OnQ-order andR-order of convergence , 1989 .

[6] Florian A. Potra,et al. Some efficient methods for enclosing simple zeros of nonlinear equations , 1992 .

[7] Florian A. Potra,et al. On enclosing simple roots of nonlinear equations , 1993 .