Sylvester方程的一种并行梯度迭代方法  

A Parallel Gradient Iterative Method of the Sylvester Equation

作　　者：雍进军[1] 李晟[1] 任善静[1] 

机构地区：[1]贵州师范学院数学与计算机科学学院,贵州贵阳550018

出　　处：《贵州师范学院学报》2013年第3期10-12,共3页Journal of Guizhou Education University

基　　金：贵州师范学院校级项目基金(12YB020)

摘　　要：针对Sylvester矩阵方程AX+XB=C的数值求解过程中有大量的矩阵运算,而实际问题往往是大型矩阵方程,此时单机无法实现的实际情况,给出了一种在高性能计算平台下Sylvester方程的并行梯度迭代算法,该算法将方程组的系数矩阵及右端项按行分块,然后将分块的系数矩阵及右端项按分块存储在各处理机。试验结果表明该算法具有较高的并行效率和加速比。Considering the Sylvester matrix equation AX ＋ XB = C numerical solving process with a large matrix calculation, and practical problems are often large matrix equation, this single is unable to realize the actual situa- tion, proposed a in high performance computing platform Sylvester equations of parallel gradient iterative algorithm, the algorithm of the coefficient matrix of the equations, and the right - hand side by rows sub - blocks, then block co- efficient matrix and the right - hand side of the block storage in each processor. The test results show that the algorithm has high parallel efficiency and speedup.

关 键 词：SYLVESTER方程 梯度迭代算法 高性能计算 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]