Investigating Of The Computational Possibylities Of The Kg-Algoritm To Solve The Systems Of Algebraic Eduations With Three Diagonals Matrix Of Coefficients

The main part of computational mathematics’ problems can be brought to solving the systems of linear algebraic equations. In case with a big number of equations and unknowns there are some difficulties on this way. To overcome it, the KG-method which combines the algorithmic structure of the Gauss method with Cramer rules are presented in this paper