|
Computational algebra
Some questions of applying assignment algorithms to define a list of pivotal elements in LU-decomposition of sparse matrices are considered. By solving the problem of assignment, it is necessary to find a permutation which provides a maximum of the product of the modules of elements from the main diagonal. The assignment algorithm is applied to an auxiliary matrix constructed according to certain rules from elements of the inital matrix. Specific features of auxiliary matrices allow us to choose an efficient algorithm for solving assignment problems, which is confirmed by the results of testing.
Note. Abstracts are published in author's edition
Mail to Webmaster |
|Home Page| |English Part| |
![[SBRAS]](http://www-sbras.nsc.ru/gif/s_sigma.gif) Go to Home |