Journal of Algorithms & Computational Technology · 2019 · 15 citations · 18 references
Natural SciencesMathematicsComputational MechanicsComputational PhysicsDifferential EquationsContinued FractionsConvergence AnalysisIterative SolversNumerical AnalysisNumerical ConvergenceRoot FindingContinued Fraction ExpansionsConvergenceNewton ConvergenceNonlinear Convergence AnalysisPolynomial Root FindingRoot Finding Algorithms
In this paper, we present firstly several one-step iterative methods including classical Newton’s method and Halley’s method for root-finding problem based on Thiele’s continued fraction. Secondly, by using approximants of the second derivative and the third derivative, we obtain an improved iterative method, which is not only two-step iterative method but also avoids calculating the higher derivatives of the function. Analysis of its convergence shows that the order of convergence of the modified iterative method is four for a simple root of the equation. Finally, to illustrate the efficiency and performance of the proposed method, we give some numerical experiments and comparison.
18
Iterative Methods for the Solution of Equations.
David M. Young, J. F. Traub · American Mathematical Monthly · 1967 · 2.2K citations
Neural networks for optimization and signal processing
Adam Krzyżak · Neurocomputing · 1994 · 1.2K citations