原矩阵 meaning in English

original matrix

We give the sufficient and necessary condition of the problem , and prove that when the matrix a is column - divided , we can use the divide - and - conquer method to solve the lrms problem
首先，我们给出了一个lrms问题可以用分而治之方法来求解的充分必要条件和一个可判定条件(充分条件) ，当原矩阵a是列可分时， lrms问题可以用分而治之方法来求解。
If / is the column index subset which we have known , then we choose a column index i * from the residual subset i0 i , such that which k is the rank of a ( : , i ) . this method is called the forward - choice greedy algorithm
实际上，在第三章中，我们只是解决了原矩阵a是列可分的lrms问题，那么对于原矩阵a是列不可分的lrms问题，该如何求解呢
Besides the preconditioning techniques , there arc many other methods to turn the original matrix to a new one of better properties . pre - symmetry is such a kind of technique . cg is stable and efficient , but it can only be used to symmetric matrices
除预条件外，尚有许多其它的预处理技术将原矩阵化为性质较好矩阵，预对称化即是其中之一， cg迭代法不仅效率高，而且稳定性好，但却只能应用于对称矩阵，采用预对称技术将非对称矩阵化为对称矩阵，就能利用cg法进行高效计算。