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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Dharmendra Kumar Gupta / rank
 
Normal rank
Property / author
 
Property / author: Sanjaya Kumar Parhi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s12190-009-0272-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2111664388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Enclosing Simple Roots of Nonlinear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new family of exponential iteration methods with quadratic convergence of both diameters and points for enclosing zeros of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved exponential regula falsi methods with quadratic convergence of both diameter and point for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Halley method in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local convergence theorem for the super-Halley method in a Banach space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified regula falsi method for computing the root of an equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The “Pegasus” method for computing the root of an equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of Chebyshev-Halley type methods in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4060241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New high-order convergence iteration methods without employing derivatives for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of quadratic convergence iteration formulae without derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved regula falsi method with quadratic convergence of both diameter and point for enclosing simple zeros of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A free-derivative iteration method of order three having convergence of both point and interval for nonlinear equations / rank
 
Normal rank

Latest revision as of 00:00, 3 July 2024

scientific article
Language Label Description Also known as
English
An improved class of regula falsi methods of third order for solving nonlinear equations in \(\mathbb R\)
scientific article

    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
    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