.png){kind=icon}
返回
A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2003.08.130.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we discuss a recursive divide and conquer method to solve a tridiagonal system of linear equations. We propose two divide and conquer algorithms using different communication schemes. The first one uses a fan-in scheme to perform communication among processors, while the second one follows a rather different model, in which all the processors communicate all data to the main one. A theoretical study of the computational cost of both algorithms is developed computing theoretical times; firstly in an IBM SP2 computer with a high performance switch and Ethernet connection, and secondly in a CRAY T3D computer. We present experimental results for the IBM SP2 computer, for 2, 4, and 8 processors, comparing these results with the theoretical predicted times. (C) 2003 Elsevier Inc. All rights reserved.
Keyword:
tridiagonal matrix
BSP computer
divide and conquer
Shernian-Morrison formula
diagonal dominant matrix
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容