On some simultaneous methods based on Weierstrass' correction
The authors consider iteration methods for the simultaneous approximation of all zeros of a polynomial \(f(z)\) with complex coefficients. All methods are based on the Weierstrass correction \(W_i(z)=f(z)/\prod^n_{\substack{ k=1\\ k\neq i}} (z-z_k)\), which appears in the iteration formula \(\widehat z_i=z_i- W_i(z_i)\), \(i=1,2,\dots,n\). The \(z_i\) are approximations to the zeros of \(f(z)\). Simultaneous methods of order \(q+1\) are derived from a one point method of order \(q\) by replacing \(f(z)\) by \(W_i(z)\), \(f'(z)\) by \(W_i'(z)\), etc. For example, for Newton's method \((q=2)\), the corresponding simultaneous method is the third-order Maehly-Ehrlich-Aberth method. Simultaneous multistep methods, based on rational interpolation, are then discussed, and the paper concludes by presenting a new combined interval method based on the secant method and the \(W\)-correction. Convergence analysis is included and some numerical examples presented.
- scientific article; zbMATH DE number 818538
- On a Method of Weierstraß for the Simultaneous Calculation of the Roots of a Polynomial
- scientific article; zbMATH DE number 1868928
- Some improved inclusion methods for polynomial roots with Weierstrass' corrections
- Weierstrass-like methods with corrections for the inclusion of polynomial zeros
- Euler-like method for the simultaneous inclusion of polynomial zeros with Weierstrass' correction
- Simultaneous approximation by Gauss-Weierstrass-Wachnicki operators
- Convergence of the Weierstrass method for simultaneous approximation of polynomial zeros
- Some results on the simultaneous approximation
- The behaviour of approximations of the SOR Weierstrass method
- A class of iterative methods for holomorphic functions
- A family of root finding methods
- A high-order iterative formula for simultaneous determination of zeros of a polynomial
- A modified Newton method for polynomials
- A new method for solving polynomial equations
- Circular arithmetic and the determination of polynomial zeros
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
- scientific article; zbMATH DE number 3161517 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 50026 (Why is no real title available?)
- scientific article; zbMATH DE number 714514 (Why is no real title available?)
- scientific article; zbMATH DE number 3352737 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Iterative methods for simultaneous inclusion of polynomial zeros
- On iteration methods without derivatives for the simultaneous determination of polynomial zeros
- Parallel Laguerre iterations: The complex case
- Simultaneous inclusion of the zeros of a polynomial
- The Use of Rational Functions in the Iterative Solution of Equations on a Digital Computer
- Weierstrass formula and zero-finding methods
- Zur iterativen Auflösung algebraischer Gleichungen
- The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. I: Correction methods
- On Euler-like methods for the simultaneous approximation of polynomial zeros
- A family of simultaneous zero-finding methods
- Weierstrass formula and zero-finding methods
- A new method of increasing the order of convergence step by step
- Improvement of convergence of an iterative method for finding polynomial factors of analytic functions
- A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros
- The convergence of a family of parallel zero-finding methods
- Family of simultaneous methods of Hansen--Patrick's type
- On some methods for the simultaneous determination of polynomial zeros
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
- A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously
- On iteration methods without derivatives for the simultaneous determination of polynomial zeros
- Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
- An efficient higher order family of root finders
- Weierstrass-like methods with corrections for the inclusion of polynomial zeros
- Chebyshev-like root-finding methods with accelerated convergence
- Inclusion Weierstrass-like root-finders with corrections
- scientific article; zbMATH DE number 3951891 (Why is no real title available?)
- On the fourth order methods of Weierstrass' type
- On the weierstrass and some petkovic-like methods for numerical determination of polynomial zeros
- scientific article; zbMATH DE number 1868928 (Why is no real title available?)
- The simultaneous approximation of polynomial roots
- On a family of Weierstrass-type root-finding methods with accelerated convergence
- A high order iteration formula for the simultaneous inclusion of polynomial zeros
- Comments on the Basto-Semiao-Calheiros root finding method
- Construction of zero-finding methods by Weierstrass functions
- On new higher order families of simultaneous methods for finding polynomial zeros
This page was built for publication: On some simultaneous methods based on Weierstrass' correction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923458)
