No label defined (Q3798149)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4064369
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4064369

      Statements

      0 references
      1987
      0 references
      parallel algorithm
      0 references
      convergence
      0 references
      error estimations
      0 references
      multiple roots
      0 references
      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\).
      0 references

      Identifiers