A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence

DOI10.1016/J.CAM.2023.115428zbMath1519.65010OpenAlexW4382681213MaRDI QIDQ6049349

Petko D. Proinov, Stoil I. Ivanov

Publication date: 15 September 2023

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2023.115428

zbMATH Keywords

error estimatesiterative methodspolynomial zeroslocal and semilocal convergencemultiple and simple zeros

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Cites Work

• Unnamed Item
• Unnamed Item
• On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
• On some improvements of square root iteration for polynomial complex zeros
• On the convergence of Halley's method for simultaneous computation of polynomial zeros
• Relationships between different types of initial conditions for simultaneous root finding methods
• Point estimation of root finding methods
• Accelerating generators of iterative methods for finding multiple roots of nonlinear equations
• General local convergence theory for a class of iterative processes and its applications to Newton's method
• Some modifications of the parallel Halley iteration method and their convergence
• On Euler-like methods for the simultaneous approximation of polynomial zeros
• A high-order iterative formula for simultaneous determination of zeros of a polynomial
• An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial. (An algorithm)
• Unified convergence analysis for Picard iteration in \(n\)-dimensional vector spaces
• On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros
• The convergence analysis and uniqueness of blow-up solutions for a Dirichlet problem of the general \(k\)-Hessian equations
• A generalization of the Banach contraction principle with high order of convergence of successive approximations
• Variants of Newton's method using fifth-order quadrature formulas
• On a high-order one-parameter family for the simultaneous determination of polynomial roots
• Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
• Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
• New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
• An algorithm for the total, or partial, factorization of a polynomial
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
• An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros
• A modified Newton method for polynomials
• Certain modifications of Newton's method for the approximate solution of algebraic equations
• General convergence theorems for iterative processes and applications to the Weierstrass root-finding method

This page was built for publication: A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence