An improved class of regula falsi methods of third order for solving nonlinear equations in \(\mathbb R\) (Q980412)

From MaRDI portal





scientific article; zbMATH DE number 5728285
Language Label Description Also known as
default for all languages
No label defined
    English
    An improved class of regula falsi methods of third order for solving nonlinear equations in \(\mathbb R\)
    scientific article; zbMATH DE number 5728285

      Statements

      An improved class of regula falsi methods of third order for solving nonlinear equations in \(\mathbb R\) (English)
      0 references
      29 June 2010
      0 references
      The regula falsi method or the false position method is a classical root finding algorithm that combines the feature of the bisection method and the secant method. The author proposes an improvement of the regula falsi method to accelerate the convergence of these methods from quadratic to cubic. A convergence theorem for establishing the cubic convergence of both the sequence of diameters to the root is given. Numerical examples are given to establish the effectiveness of the cubically convergent method. The roots are compared with the several root finding methods; particularly the more important Newton method. The initial guess in Newton's method should be close to the root, however, the extreme point is considered which makes the result either more divergent or it takes a large number of iterations for convergence. Thus the comparison is not appropriate.
      0 references
      nonlinear equations
      0 references
      regula falsi methods
      0 references
      Newton's method
      0 references
      Steffensen's method
      0 references
      cubic convergence
      0 references
      convergence acceleration
      0 references
      comparison of methods
      0 references
      root finding algorithm
      0 references
      bisection method
      0 references
      secant method
      0 references
      numerical examples
      0 references
      0 references
      0 references

      Identifiers