Институт вычислительной математики и математической геофизики СОРАН

Abstracts

For generation of sparse symmetric matrices, a two-step algorithm was realized. At the first step, the 3D real symmetric matrix is generated for a given spectrum using the method of constructing a set of polynomials, which are orthogonal on this spectrum (see, for example, Yu.I. Kuznetsov "Matrices and polynomials, part II, Novosibisk, 2004, p. 204. At the second step, the sparse matrix without band structure is obtained by random permutations. This matrix is written into the text file in the packed form. In this paper, the methods of the accuracy control are discussed. Results of computer experiments are represented and discussed. The developed computer program can be used for the training and testing of different algorithms for sparse packed matrices.

Mail to Webmaster www@www-sbras.nsc.ru

|Home Page| |English Part|

Go to Home