A method to accelerate the convergence of the secant algorithm

DOI10.1155/2014/321592zbMath1307.65063OpenAlexW2150165573WikidataQ59047680 ScholiaQ59047680MaRDI QIDQ2260479

M. J. P. Nijmeijer

Publication date: 10 March 2015

Published in: Advances in Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/321592

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (1)

On the convergence ball and error analysis of the modified secant method

Cites Work

• A family of derivative-free methods with high order of convergence and its application to nonsmooth equations
• Some efficient methods for enclosing simple zeros of nonlinear equations
• Exact order of convergence of the secant method
• On a higher order secant method.
• A note on the convergence of the secant method for simple and multiple roots
• Generalizations of aitken's process for accelerating the convergence of sequences
• Divided differences of inverse functions and partitions of a convex polygon
• A Method for Solving Algebraic Equations Using an Automatic Computer
• Average-Case Optimality of a Hybrid Secant-Bisection Method
• An algorithm with guaranteed convergence for finding a zero of a function
• A new high order method of regula falsi type for computing a root of an equation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A method to accelerate the convergence of the secant algorithm