查詢結果分析
來源資料
相關文獻
- The Derivation of Two Parallel Zero-Finding Algorithms of Polynomials
- MPI平行計算程式設計
- 一個計算二值影像中物體輪廓曲率值的平行演算法
- 非線性系統之平行計算--區域分割方法在流體力學計算上的應用
- 動態批量平行演算法之探討
- MPI平行計算程式設計
- MPI平行計算程式設計
- Application of CFD Parallel Computing on NT System
- Parallelization of 2-D Incompressible Navier-Stokes Equations
- 平行計算流力國際研討會概況--兼論日本及臺灣之發展
頁籤選單縮合
題名 | The Derivation of Two Parallel Zero-Finding Algorithms of Polynomials=解多項式零位之平行演算法 |
---|---|
作者 | 左臺益; | 書刊名 | 師大學報. 數理與科技類 |
卷期 | 42 1997.10[民86.10] |
頁次 | 頁1-6 |
分類號 | 314.5 |
關鍵詞 | 平行計算; 函數疊代分析; 解零位; 隱式除法; Parallel computing; Functional iteration analysis; Zeros-finding; Implicit deflation; |
語文 | 英文(English) |
中文摘要 | 本文研究適合平行計算之二種演算法Weierstrass法及Aberth法以求解多項式之零位。我們說明由函數疊代分析可以導出此二種演算法。同時也驗證Weierstrass法可由不動點疊代法結合隱式除法計算導出,而牛頓法結合隱式除法可以計算出Aberth法。 |
英文摘要 | 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. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。