带状方程组并行列处理法贪心方法  

Parallel Column Action Method with Greedy Method for Band System of Linear Equations

作　　者：杨本立[1] 李安志[1] 赵国伟[1] 

机构地区：[1]中国工程物理研究院工学院,四川绵阳621900

出　　处：《电子科技大学学报》2005年第4期566-568,共3页Journal of University of Electronic Science and Technology of China

基　　金：中国工程物理研究院科学技术基金资助项目(20020656)

摘　　要：利用列处理法贪心方法和分治策略,给出了一种求解任意相容性带状方程组的解或任意不相容性带状方程组最小二乘解的消息传递多指令流多数据流并行迭代解法,分析了解法的收敛性、计算复杂性和数值稳定性。该方法能使得各处理机上的负载基本平衡,得到了理想的加速比和并行效率。This paper utilizes the column action method with the greedy method and the dividing-Conquering strategy to put forward a message passing multiple instruction stream-multiple data stream （MIMD） parallel iterative method for determining the solution of arbitrary consistent band system of linear equations or the least squares solution of arbitrary inconsistent band system of linear equations, also analyzes its convergence and its computational complexity, so its numerical stability. Moreover, the method in this paper con make roughly balance of the computation workload to each processor, hence can obtained ideal speed-up and parallel efficiency.

关 键 词：带状方程组 消息传递并行迭代算法 列处理法贪心方法 分治策略 

分 类 号：O241.6[理学—计算数学] O246[理学—数学]