On generalization based on bi et Al. Iterative methods with eighth-order convergence for solving nonlinear equations
Taher Lotfi1, Alicia Cordero2, Juan R Torregrosa2
1Department of Applied Mathematics, Hamedan Branch, Islamic Azad University, Hamedan 65188, Iran.
Abstract:
The primary goal of this work is to provide a general optimal three-step class of iterative methods based on the schemes designed by Bi et al. (2009). Accordingly, it requires four functional evaluations per iteration with eighth-order convergence. Consequently, it satisfies Kung and Traub's conjecture relevant to construction optimal methods without memory. Moreover, some concrete methods of this class are shown and implemented numerically, showing their applicability and efficiency.
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 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,...
Differential Equations: Problem Solving
Gaussian Elimination: Problem Solving
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....

