A slight generalization of Steffensen Method for Solving Non Linear Equations

@article{Martins2022ASG,
  title={A slight generalization of Steffensen Method for Solving Non Linear Equations},
  author={Eder Marinho Martins and Geraldo Cesar Gonçalves Ferreira and Thais Ester Gonçalves},
  journal={ArXiv},
  year={2022},
  volume={abs/2209.14474}
}
In this article, we present an iterative method to find simple roots of nonlinear equations, that is, to solving an equation of the form f ( x ) = 0. Different from Newton’s method, the method we purpose do not require evaluation of derivatives. The method is based on the classical Steffensen’s method and it is a slight modification of it. The proofs of theoretical results are stated using Landau’s Little o notation and simples concepts of Real Analysis. We prove that the method converges and its… 

Tables from this paper

References

SHOWING 1-9 OF 9 REFERENCES

On a Kurchatov's method of linear interpolation for solving nonlinear equations

We apply the method of linear interpolation of Kurchatov to solve nonlinear operator equations in Banach spaces. Using the principle of majorants of L. V. Kantorovich, we study the semilocal

A Note on the Convergence of the Secant Method for Simple and Multiple Roots

The secant method is one of the most popular methods for root finding. Standard text books in numerical analysis state that the secant method is superlinear: the rate of convergence is set by the

Remarks on iteration.

1. Iteration is an operation with many aspects; we shall here only occupy ourselves with iteration as a means of numerical determination of a real root of an equation. Nor shall we go into the whole

Solution of equations in Euclidean and Banach spaces

A new steffensen-homeier iterative metod for solving nonlinear equations. Investigación Operacional

  • 2019