Gergely József: Program package sparse matrices (SZTAKI Tanulmányok 115/1980)

- 3 -Abstract In tlie paper programs are investigated for the solution of si;; problems of linear algobra where the matrices of the problems are sparse ones. Linear systems of equations are solved in the first four programs, the eigenvalues are computed in the 5th and 6th program in the symmetric, non­­symmetric or band cases. The inverse and determinant also are computed in the first program. 1. Introduction A lot of methods and programs for the solution of the problems of linear algebra are known. In the books dealing with linear algebra or numerical methods there are sections in lihich the methods for the solution of systems of linear equations and matri;; inversion are investigated. Moreover, the libraries of computer centers contain various programs to solve problems of linear algebra. Large size main memories are needed in computers for the solution of large size problems. The solutions of large size problems are computed by means of back store, if the main memory is not enough for the solution. In this case the programs of solutions are more sophisticated and the computation takes more time because of the transfer between the memories, (see [^l]).

Next