Linear system solving with the help of decomposition

Authors

  • D. A. Zaitsev

Abstract

Special subsets of equations of linear system named by clans were introduced and studied. It was proposed to use the decomposition into clans for the acceleration of linear system solving. Decomposition complexity equals cube depending on size of system. Therefore, acceleration of computations was obtained for methods with complexity exceeding cube. For integer systems solving in nonnegative integer numbers acceleration of computations obtained is exponential.

Author Biography

D. A. Zaitsev

Zaitsev D.A.

Downloads

Issue

No. 2 (2005)

Section

New methods in system analysis, computer science and theory of decision making

License

This is an open access journal which means that all content is freely available without charge to the user or his/her institution. Users are allowed to read, download, copy, distribute, print, search, or link to the full texts of the articles in this journal without asking prior permission from the publisher or the author. This is in accordance with the BOAI definition of open access.