Please use this identifier to cite or link to this item:
|Title:||The Derivation of Two Parallel Zero-Finding Algorithms of Polynomials|
Office of Research and Development
In this paper we study the derivation of two famous algorithms for finding all zeros of a giving polynomial. These two algorithms which are the Weierstrass method and the Aberth method are highly suited for parallel computing. It is explained that both of the two algorithms can be arrived by the functional iteration analysis. We also show that the the Weierstrass method and the Aberth method can be derived by the fixed point iteration method and the Newton method, respectively, together with the implicit deflation scheme.
|Appears in Collections:||師大學報：數理與科技類|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.