On some simultaneous methods based on Weierstrass' correction

DOI10.1016/0377-0427(95)00278-2zbMath0859.65048OpenAlexW2024328969WikidataQ127360619 ScholiaQ127360619MaRDI QIDQ1923458

Tetsuya Sakurai, Miodrag S. Petković

Publication date: 7 April 1997

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

Full work available at URL: https://doi.org/10.1016/0377-0427(95)00278-2

zbMATH Keywords

convergenceNewton's methodnumerical examplesrational interpolationzeros of polynomialsmultistep methodssecant methodinterval methoditeration methodssimultaneous methodsWeierstrass correctionMaehly-Ehrlich-Aberth method

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 solutions to single equations (65H05)

Related Items

Family of simultaneous methods of Hansen--Patrick's type ⋮ A high order iteration formula for the simultaneous inclusion of polynomial zeros ⋮ A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros ⋮ Comments on the Basto-Semiao-Calheiros root finding method ⋮ Construction of zero-finding methods by Weierstrass functions ⋮ On Euler-like methods for the simultaneous approximation of polynomial zeros ⋮ A family of simultaneous zero-finding methods ⋮ Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros ⋮ A new method of increasing the order of convergence step by step ⋮ On a family of Weierstrass-type root-finding methods with accelerated convergence ⋮ Chebyshev-like root-finding methods with accelerated convergence ⋮ On the fourth order methods of Weierstrass' type ⋮ On new higher order families of simultaneous methods for finding polynomial zeros ⋮ An efficient higher order family of root finders ⋮ The convergence of a family of parallel zero-finding methods ⋮ Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros ⋮ Improvement of convergence of an iterative method for finding polynomial factors of analytic functions ⋮ A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously

Uses Software

• PASCAL-XSC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A high-order iterative formula for simultaneous determination of zeros of a polynomial
• Parallel Laguerre iterations: The complex case
• A family of root finding methods
• Weierstrass formula and zero-finding methods
• Iterative methods for simultaneous inclusion of polynomial zeros
• On iteration methods without derivatives for the simultaneous determination of polynomial zeros
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• A class of iterative methods for holomorphic functions
• Circular arithmetic and the determination of polynomial zeros
• Simultaneous inclusion of the zeros of a polynomial
• Zur iterativen Auflösung algebraischer Gleichungen
• The Use of Rational Functions in the Iterative Solution of Equations on a Digital Computer
• A new method for solving polynomial equations
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• A modified Newton method for polynomials
• Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems