Mathematical Problems in Engineering · 2020 · 22 citations · 22 references
ComputingComputational EngineeringComputational MechanicsDifferential EquationsMethod ValidationConvergence AnalysisIterative SolversNumerical AnalysisNumerical ConvergenceNumerical StabilityRoot FindingAccuracy-computational Cost TradeoffConvergence Rate AnalysisCritical PointsNonlinear Convergence AnalysisNonlinear Equation SolversNonlinear Equation SystemsPolynomial Root FindingRoot Finding Algorithms
In this article, we first construct a family of optimal 2-step iterative methods for finding a single root of the nonlinear equation using the procedure of weight function. We then extend these methods for determining all roots simultaneously. Convergence analysis is presented for both cases to show that the order of convergence is 4 in case of the single-root finding method and is 6 for simultaneous determination of all distinct as well as multiple roots of a nonlinear equation. The dynamical behavior is presented to analyze the stability of fixed and critical points of the rational operator of one-point iterative methods. The computational cost, basins of attraction, efficiency, log of the residual, and numerical test examples show that the newly constructed methods are more efficient as compared with the existing methods in the literature.
22
Optimal Order of One-Point and Multipoint Iteration
H. T. Kung, J. F. Traub · Journal of the ACM · 1974 · 750 citations · Full text
Chaos in King’s iterative family
Alicia Cordero, Javier G. Maimó, Juan R. Torregrosa et al. · Applied Mathematics Letters · 2013 · 130 citations · Full text