On numerical methods for solving infinite systems of linear algebraic equations

Numerical methods for solving in nite systems of linear algebraic equations are considered. First, the Gauss-Jordan method is formally generalized to in nite systems. It is shown that, on the basis of such an algorithm, it is possible to formally generalize other numerical methods, for example, the method of successive approximations or the iterative Seidel method. Then, using examples of speci c joint in nite systems, the e ciency of these methods was tested. A numerical comparison of these methods is given.