摘要
在文献 (四川师范大学学报 (自然科学版 ) ,2 0 0 2 ,2 5 (4) :35 1~ 35 4 .)的基础上 ,给出一个在分布式存储MIMD一级 3叉树树机模型上求解任意三对角线性代数方程组的分布式并行迭代算法并分析算法的通信复杂度 .
By using a known theorem (J. Sichuan Normal University(Natural Science),2002,25(4):351~354.), this paper puts forward a paralled iterative algorithm based on the 1 th and 3 nary tree machine model with MIMD computer of distributed memory. The algorithm can solve the arbitrary tridiagonal systems, and its communication complexity is also discussed.
出处
《四川师范大学学报(自然科学版)》
CAS
CSCD
2002年第5期487-489,共3页
Journal of Sichuan Normal University(Natural Science)
基金
中国工程物理研究院科学技术基金资助项目 (2 0 0 2 0 65 6)