Recurrent matrix form of the optimal elimination method

The paper deals with the direct recurrent method [1] which is an alternative formulation of the direct projection method of solving systems of linear algebraic equations. The direct recurrent method is shown to be equivalent to the method of optimal elimination, which makes it possible to treat the latter as the direct recurrent method. This approach provides the potential for creating machine algorithms of solving systems of linear algebraic equations with many right sides, especially efficient in iteration refinement algorithms. The algorithms created have an optimal volume of on-line storage.