Realization of matrix operations for the PRORAB computer

The article is devoted to the computer realization of well-known computational algorithms of linear algebra with sparse matrices. Formal programs of operations of the second kind (subschemes) over sparse matrices are derived, as well as sub-schemes realizing the normalized expansion of a matrix, the modified Danilewski method, the stepwise choice of the leading element in a process of Gaussian elimination type, the search for approximations to an eigenvalue by the method of traces, etc.