A Method to Accelerate the Convergence of the Secant Algorithm. (19th November 2014)

• Record Type: Journal Article
• Authors: Nijmeijer, M. J. P.
• Other Names: Lazarov Raytcho Academic Editor.
• Is Part Of: Advances in numerical analysis. Volume 2014(2014)
• Publication Date: 2014-11-19
• Subjects: Numerical analysis -- Periodicals; Numerical analysis; Periodicals; Electronic journals; 518
• DOI: 10.1155/2014/321592
• Languages: English
• ISSNs: 1687-9562

Abstract

Abstract : We present an acceleration technique for the Secant method. The Secant method is a root-searching algorithm for a general functionf . We exploit the fact that the combination of two Secant steps leads to an improved, so-called first-order approximant of the root. The original Secant algorithm can be modified to a first-order accelerated algorithm which generates a sequence of first-order approximants. This process can be repeated: twon th order approximants can be combined in a( n + 1 ) th order approximant and the algorithm can be modified to an( n + 1 ) th order accelerated algorithm which generates a sequence of such approximants. We show that the sequence ofn th order approximants converges to the root with the same order as methods using polynomial fits off of degreen .