Symmetry · 2020 · 45 citations · 23 references
ComputingPhysicsComputational MechanicsComputational PhysicsDifferential EquationsConvergence AnalysisIterative SolversNumerical AlgorithmsNumerical AnalysisNumerical ConvergenceRoot FindingConvergenceDerivative-free Root FindingHigh-order Numerical SchemesNewton ConvergenceOrder ConvergencePolynomial Root FindingRoot Finding Algorithms
A plethora of higher order iterative methods, involving derivatives in algorithms, are available in the literature for finding multiple roots. Contrary to this fact, the higher order methods without derivatives in the iteration are difficult to construct, and hence, such methods are almost non-existent. This motivated us to explore a derivative-free iterative scheme with optimal fourth order convergence. The applicability of the new scheme is shown by testing on different functions, which illustrates the excellent convergence. Moreover, the comparison of the performance shows that the new technique is a good competitor to existing optimal fourth order Newton-like techniques.
23
Optimal Order of One-Point and Multipoint Iteration
H. T. Kung, J. F. Traub · Journal of the ACM · 1974 · 750 citations · Full text
A family of root finding methods
Eldon Hansen, Merrell L. Patrick · Numerische Mathematik · 1976 · 233 citations