求解线性方程组的递推算法

Recurrence Algorism for Solving a System of Linear Equations

针对求解线性方程组AX=B(A∈R^(m×n),B∈R^m,X∈R^n)的两种迭代格式:(Ⅰ)X^(K+1)=EX^(K)+H;(Ⅱ)X^(K+1)=GX^(K)+F,给出了递推算法。当矩阵A和B不断增加新数据时,不必按新数据计算(Ⅰ)和(Ⅱ)中的相应矩阵,而是在新旧矩阵间建立了递推关系,减少了计算量和计算机内存。

Gives a recurrence algorism for solving iteration form of the linear equations: AX=B(A∈R^(m×n), B∈R^m, X∈R^n). When matrices A and B increase new data, establishes recurrence relationships between new and old matrices, reduces calculations and computer memory.