A PARALLEL METHOD TO INCOMPLETE FACTORIZATIONS OF BLOCK TRIDIAGONAL MATRICES

摘要：

For a given block tridiagonai matrix, incomplete factorizations are efficient pre-conditioners and attract lots of attention. But it is well known that incomplete factorization is a serial process in essence and is hard to be parallelized. Based on the analyses of the multisplitting technique, which is based on domain decom-position with overlapping, and the parallel local block factorization technique, we provide a new parallel method in this paper. It can be used to parallelize any incomplete factorizations and the experiments show that it is more efficient than multisplitting technique and the analysis show that it is comparable to pseudo-overlapping technique.

作者: JIAN-PING WU XIAO-MEI LI ZHENG-HUA WANG

作者单位: School of Computer, National University of Defense Technology,Changsha, P.R. China, 41007S School of Computer, National University of Defense Technology,Changsha, P.R.China, 41007S Institute

会议类型: 国际会议

会议名称: The Joint Conference of ICCP6 and CCP2003(第6届国际计算伦理会议)

会议地点: 北京

会议语种:英文

页码: 365-368

在线出版日期: 2004-05-23（万方平台首次上网日期，不代表论文的发表时间）