工作站网络下三对角方程组并行求解

考虑工作站网络（ＮＯＷｓ）中三对角线性方程组的并行求解，基于最小秩解耦算法与分布治之并行计算模式，并行最小秩解耦算法（ＰＭＲＤ）。它在计算过程中保持原矩阵的结构特征，数值稳定性高，本文给出算法的数值特征分析以及计算与通讯复杂性分析并与Ｍｅｈｒｍａｎｎ分治算比较，所有算法由ＰＶＭ软件系统实现并在工作站网络中测试。

Parallel Solution of Tridiagonal Linear Equations on Network of Workstations

In this paper, we consider the parallel solution of tridiagonal linear equations on network of workstations (NOWs). Based on divide and conquer parallel computation model and minimal rank decoupling idea, Parallel Minimal Rank Decoupling(PMRD) method is proposed. This method preserves the structure property of the original equation and more stable numericas during a computation. Analyses of numerical properties, computation and communication complexities are made together with an comparison between the above and divide-and-conquer algorithm of Mehrmann. All algorithms involved in this paper have been completed with PVM software system and tested on NOWs.