An Improved Arnoldi Method for Linear Equations
To improve parallelism of Anorldi method for Linear Equations, a parallel algorithm based on Arnoldi method for block-tridiagonal linear equations on distributed-memory multi-computers is presented, a group of vectors spanning subspace is properly chosed, a parallel iterative method on distributed-memory multi-computer is established. In theory, convergence is proved when the coefficient matrix is a symmetric positive definite matrix. Some numerical examples show that experimental results are consistent with the theory, and the efficiency of the algorithm is very high.
Block-tridiagonal linear equations Parallel algorithm Krylov subspace method
Wang Bao Lv Quanyi Nie Yufeng
School of Science, Northwestern Polytechnical University, Xian ,China 710072 School of Aeronautics, School of Science, Northwestern Polytechnical University, Xian ,China 710072
国际会议
The Third International Workshop on Applied Matriz Theory(第三届国际矩阵分析与应用会议)
杭州
英文
1006-1009
2009-07-09（万方平台首次上网日期，不代表论文的发表时间）