摘要:<正> In this paper,the main results are concluded in theorem 1 and theorem 4.Theorem 1 Let A,b be nxn matrix and re-dimensional vector respectively,which can be represented exactly in the computer.If W is a nonsingu-lar nXn matrix such that ||I-WA||<1 then for any algorithm the errors of the sulution of linear equations Ax - b (1) satisfy the following inequalities