On a new three-step class of methods and its acceleration for nonlinear equations
T Lotfi1, K Mahdiani1, Z Noori1
1Department of Mathematics, Islamic Azad University, Hamedan Branch, Hamedan, Iran.
Abstract:
A class of derivative-free methods without memory for approximating a simple zero of a nonlinear equation is presented. The proposed class uses four function evaluations per iteration with convergence order eight. Therefore, it is an optimal three-step scheme without memory based on Kung-Traub conjecture. Moreover, the proposed class has an accelerator parameter with the property that it can increase the convergence rate from eight to twelve without any new functional evaluations. Thus, we construct a with memory method that increases considerably efficiency index from 8(1/4) ≈ 1.681 to 12(1/4) ≈ 1.861. Illustrations are also included to support the underlying theory.
More Related Videos
06:44Age-dependent Dynamics of Locomotion in Caenorhabditis elegans: A Lyapunov Exponent Analysis
Published on: September 23, 2025
09:01Gain-compensation Methodology for a Sinusoidal Scan of a Galvanometer Mirror in Proportional-Integral-Differential Control Using Pre-emphasis Techniques
Published on: April 4, 2017
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Newton’s Method
Linear Differential Equations
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
Kinematic Equations: Problem Solving
Linearization and Approximation
