On the efficiency of the secant method and the Newton method
An abstract discussion on the efficiency (in terms of the amount of arithmetic operations) of iterative methods for solving \(f(x)=0\) for \(f:\mathbb{R}^k\to\mathbb{R}^k\) is given. Under appropriate assumptions of smoothness of \(f\), three methods are considered: the standard chord (secant) method, a variant of the secant method given previously by the author, and the standard Newton method. According to a previous result of the author, the second method has convergence of order 2 under the usual hypotheses of the Newton-Kantorovich theory. On the other hand, the second method is shown to be more efficient than the first under the efficiency criteria discussed in the paper.
- Analysing the efficiency of some modifications of the secant method
- scientific article; zbMATH DE number 1161045
- A technique to choose the most efficient method between secant method and some variants
- On the secant method
- scientific article; zbMATH DE number 572108
- scientific article; zbMATH DE number 1102834
- scientific article; zbMATH DE number 3466443
- On the convergence of secant-like methods
- A method to accelerate the convergence of the secant algorithm
- Extending the applicability of Newton's and secant methods under regular smoothness
This page was built for publication: On the efficiency of the secant method and the Newton method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q677751)
