Secant‐type methods and nondiscrete induction

Secant‐type methods and nondiscrete induction

0.00 Avg rating0 Votes
Article ID: iaor20126135
Volume: 61
Issue: 3
Start Page Number: 397
End Page Number: 412
Publication Date: Nov 2012
Journal: Numerical Algorithms
Authors: ,
Keywords: error bound, global convergence
Abstract:

The celebrated nondiscrete mathematical induction has been used to improve error bounds of distances involved in the discrete case but not the sufficient convergence conditions for Secant–type methods. We show that using the same information as before, the following advantages can be obtained: weaker sufficient convergence conditions; tighter error bounds on the distances involved and a more precise information on the location of the solution. Numerical examples validating the theoretical conclusions are also provided in this study.

Reviews

Required fields are marked *. Your email address will not be published.