The Derivation of Two Parallel Zero-Finding Algorithms of Polynomials

Research output: Contribution to journalArticle

Abstract

本文研究適合平行計算之二種演算法Weierstrass法及Aberth法以求解多項式之零位。我們說明白函數疊代分析可以導出此二種演算法。同時也驗證Weierstrass法可由不動點疊代法結合隱式除法計算導出,而牛頓法結合隱式除法可計算Aberth法。
Original languageChinese
Pages (from-to)1-6
Number of pages6
Journal師大學報:數理與科技類
Issue number42
DOIs
Publication statusPublished - 1997

Keywords

  • 平行計算
  • 函數疊代分析
  • 解零位
  • 隱式除法
  • parallel computing
  • functional iteration analysis
  • zeros-finding
  • implicit deflation

Fingerprint Dive into the research topics of 'The Derivation of Two Parallel Zero-Finding Algorithms of Polynomials'. Together they form a unique fingerprint.

  • Cite this