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

Realization of matrix operations for the PRORAB computer

Effective construction of eigenvectors for a class of singular sparse matrices

The paper presents the latest version of programs implementing the large-block operating mode in machines of the M-20 family with orientation to the solution of problems with very sparse quantities.

A model prorab machine and solution of problems with very sparse quantities

A modification of the Danilewski method is presented, permitting the solution of the eigenvalue problem for a constant sparse matrix of large order to be reduced to the solution of the same problem for a polynomial matrix of lower order. Certain solution algorithms are proposed for a partial eigenvalue problem for the polynomial matrix. Questions of the realization of the algorithms on a model PRORAB computer are examined.

V. B. Khazanov

Papers

Solving the eigenvalue problem for sparse matrices