Higher order methods of the basic family of iterations via \(S\)-iteration scheme with \(s\)-convexity

DOI10.1007/s00009-020-1491-yzbMath1436.65060OpenAlexW3008930352MaRDI QIDQ2310425

Waqas Nazeer, Abdul Aziz Shahid, Krzysztof Gdawiec

Publication date: 6 April 2020

Published in: Mediterranean Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00009-020-1491-y

zbMATH Keywords

root findingpolynomiography\(S\)-iteration\(s\)-convexity

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of roots of polynomial equations (65H04)

Uses Software

• PLCP
• SQPlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomiography based on the nonstandard Newton-like root finding methods
• Some Newton-like methods with sharper error estimates for solving operator equations in Banach spaces
• Semilocal convergence analysis of \(S\)-iteration process of Newton-Kantorovich like in Banach spaces
• A comparison between iterative methods by using the basins of attraction
• Graphic and numerical comparison between iterative methods
• On the order of convergence of a determinantal family of root-finding methods
• New approximation schemes for general variational inequalities
• Fractal patterns from the dynamics of combined polynomial root finding methods
• Polynomiography for the polynomial infinity norm via Kalantari's formula and nonstandard iterations
• Newton's method and generation of a determinantal family of iteration functions
• Control of dynamics of the modified Newton-Raphson algorithm
• A new class of three-point methods with optimal convergence order eight and its dynamics
• Three-step iterative methods with optimal eighth-order convergence
• S-iteration scheme and polynomiography
• A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity
• The local and semilocal convergence analysis of new Newton-like iteration methods
• Fixed Points by a New Iteration Method
• Mean Value Methods in Iteration
• Numerical optimization. Theoretical and practical aspects. Transl. from the French
• Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications

This page was built for publication: Higher order methods of the basic family of iterations via \(S\)-iteration scheme with \(s\)-convexity