矩阵求逆并行算法 高斯约旦 法

[OpenHero]

求逆矩阵的并行算法
matrix-inverse

input A(1:n,1:n)

output A^(-1)(1:n,1:n)

begin

1. assign A^(-1) = identity matrix

2. For k = 1 to n

3. For i = 1 to n but i != k do in paraallel

4. do row operation for the matrices A and A^(-1)

Ri<- Ri-(aik/akk)Rk

5. End parrallel

6. Next k

http://blog.csdn.net/OpenHero/archive/2008/02/05/2084257.aspx

[sapzj1984]

顶！

[netbaronly]

mark ，找了好酒

[converf]

ding