| 块三对角线性方程组的可扩展块分割奇偶约化并行近似求解方法 |
| |
| 引用本文： | 张衡,张武.块三对角线性方程组的可扩展块分割奇偶约化并行近似求解方法[J].微电子学与计算机,2006,23(10):211-212,216. |
| |
| 作者姓名： | 张衡 张武 |
| |
| 作者单位： | 1. 上海大学,计算机科学学院,上海,200072;石河子大学,师范学院数学系,新疆,石河子,832000
2. 上海大学,计算机科学学院,上海,200072 |
| |
| 基金项目： | 教育部科学技术研究重点项目;上海市自然科学基金 |
| |
| 摘 要： | 文章对于一类严格块对角占优的块三对角线性方程组提出一个可扩展的块分割奇偶约化并行近似求解方法（PBOERA方法）。计算量减少到O（nm^2）＋O（m^3logm）;通信复杂度为常数。本方法在上海大学分布式并行计算机“自强3000”上使用64个节点进行了运行。得到线性加速比,并行效率达到90％以上。
|
| 关 键 词： | 块三对角线性方程组 块对角占优 块奇偶约化 矩阵分割 相对误差 |
| 文章编号： | 1000-7180（2006）10-0200-02 |
| 收稿时间： | 2006-04-22 |
| 修稿时间： | 2006-04-22 |
A Scalable Parallel Block Partition Odd-Even Reduction Approximate Algorithm for Block Tri-diagonal Systems |
| |
| Zhang Heng,Zhang Wu.A Scalable Parallel Block Partition Odd-Even Reduction Approximate Algorithm for Block Tri-diagonal Systems[J].Microelectronics & Computer,2006,23(10):211-212,216. |
| |
| Authors: | Zhang Heng Zhang Wu |
| |
| Affiliation: | 1. School of Computer Science, Shanghai University, Shanghai 200072;2. Department of Mathematics, Teachers College, Shihezi University, Shihezi 832000, China |
| |
| Abstract: | A high efficiency scalable parallel algorithm, namely parallel block partition odd-even reduction approximate (PBPOERA) algorithm is proposed for solving block tri-diagonal linear systems on multi-computers. The method proposed in this paper has been implemented on 64-node of the super parallel computer "ZiQiang 3000" of Shanghai University. The liner speedups have been obtained, and the parallel implementation efficiency preponderates over 90%. |
| |
| Keywords: | Block tridiagonal systems block diagonal dominant block odd-even reduction method matrix partitioning relative error |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
