正在加载图片...
秦 算法1.2LU分解 1:fork 1 to n-1 do 2 for i=k+1 to n do 3 lk=a/akk%计算L的第k列 4: end for 5: for j=k to n do 6 ukj akj %计算U的第k行 7: end for 8: fori=k+1 to n do 9 forj=k+1ton do 10: aj=a财-l认ukj %更新A(k+1:n,k+1:m)】 11: end for 12: end for 13:end for http://math.ecnu.edu.cn/~jypan 12/30算法 1.2 LU 分解 1: for k = 1 to n − 1 do 2: for i = k + 1 to n do 3: lik = aik/akk % 计算 L 的第 k 列 4: end for 5: for j = k to n do 6: ukj = akj % 计算 U 的第 k 行 7: end for 8: for i = k + 1 to n do 9: for j = k + 1 to n do 10: aij = aij − likukj % 更新 A(k + 1 : n, k + 1 : n) 11: end for 12: end for 13: end for http://math.ecnu.edu.cn/~jypan 12/30
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有