scientific article; zbMATH DE number 4064369
For a monic polynomial f of degree n with real or complex coefficients and the parallel algorithm \[ x_ i^{(m+1)}=x_ i^{(m)}-f(x_ i^{(m)})/\prod^{n}_{j=1,j\neq i}(x_ i^{(m)}-x_ j^{(m)}),\quad i-1,...,n,\quad m=0,1,..., \] the author proved its convergence in an earlier paper if the n initials \(x_ i^{(0)},...,x_ i^{(0)}\) satisfy \(g(n,s_ 0)\leq 1\), \(s_ 0=B_ 0\eta_ 0\in [0,1/2)\), where \(g(n,s)=(n-1)s(1+s/(1-2s))^{n-1}/((1- s)(1-2s))\) and \(\eta_ 0=\max_{1\leq i\leq n}| \quad x_ i^{(1)}- x_ i^{(0)}|,\) \(B_ 0=\max_{1\leq i,j\leq n,\quad i\neq j}| \quad x_ i^{(0)}-x_ j^{(0)}|^{-1}.\) In this paper, the author proves: The above conditions can't be relaxed, and prior and acquired error estimations are given; multiple roots for the polynomials occur if and only if \(g(n,s_ 0)=1\).
- Some parallel methods for polynomial root-finding
- A parallel algorithm for finding roots of a complex polynomial
- A parallel algorithm for simple roots of polynomials
- scientific article; zbMATH DE number 880381
- On a family of parallel root-finding methods for generalized polynomials
- On the parallel arithmetic complexity of the root-finding problem
- A globally convergent parallel algorithm for zeros of polynomial systems
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
- A parallel root-finding algorithm
- scientific article; zbMATH DE number 3860295
- On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems
- A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
- scientific article; zbMATH DE number 4176359 (Why is no real title available?)
- scientific article; zbMATH DE number 4209463 (Why is no real title available?)
- A parallel root-finding algorithm
- Efficient parallel rooting of complex polynomials on the unit circle
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
- A parallel algorithm for simple roots of polynomials
- An existence and nonexistence theorem for solutions of nonlinear systems and its application to algebraic equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798149)