计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (34): 72-73.

• 研究、探讨 • 上一篇    下一篇

改进的并行Arnoldi方法

戴宽平,吕全义   

  1. 西北工业大学 应用数学系,西安 710129
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-12-01 发布日期:2011-12-01

Improved parallel Arnoldi method

DAI Kuanping,LV Quanyi   

  1. Department of Applied Mathematics,Northwestern Polytechnical University,Xi’an 710129,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-12-01 Published:2011-12-01

摘要: 为了求解大规模的块三对角线性方程组,相关研究给出一种变形的并行Arnoldi算法,通过选取适当的基,使算法具有良好的并行性。结合已有的选基方式,在预处理思想的指导下,提出了另一种选基的方法。在联想深腾1800集群上进行的数值实验结果表明,该算法的收敛速度有了明显的提高,并保持了较高的并行性,并行效率可达到85%以上。

关键词: 预处理, Arnoldi方法, 块三对角线性方程组, 并行迭代算法

Abstract: In order to solve the large-scale block-tridiagonal systems,a kind of distortion parallel Arnoldi method has given,and the algorithm has a better parallelism by choosing of the suitable bases.With the algorithm,this paper proposes a new kind of method to choose the bases.The numerical experiments on the Lenovo Deep Proton 1800 high-performance show that the new algorithm is preferable convergence and the parallel efficiency may achieve above 85%.

Key words: precondition, Arnoldi method, block-tridiagonal liner equations, parallel iterative algorithm