An exponential regula falsi method for solving nonlinear equations (Q2498992): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q587877 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Iulian Coroian / rank | |||
Normal rank |
Revision as of 11:31, 16 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An exponential regula falsi method for solving nonlinear equations |
scientific article |
Statements
An exponential regula falsi method for solving nonlinear equations (English)
0 references
14 August 2006
0 references
The authors consider a class of iterative methods for computing approximate solutions of nonlinear equations. Combining the classical regula falsi method and a class of exponential iterative methods, the authors propose a new class of ``exponential regula falsi methods'' having high order of convergence. The sequence of iterations has the order of convergence two and the sequence of the so called ``diameters'', also two. The modification proposed for the regula falsi method can be made also for another methods, for example for the bisection method, etc. Numerical experiments show that the new exponentially regula falsi method is more efficient than the classical regula falsi method and has a high convergence rate than Newton's method and Steffensen's method.
0 references
regula falsi method
0 references
quadratic convergence
0 references
comparison of methods
0 references
exponential regula falsi methods
0 references
numerical experiments
0 references
bisection method
0 references
Newton's method
0 references
Steffensen's method
0 references