Menu: Home :: go to Journal :: switch to Russian :: switch to English
You are here: all Journals and Issues→ Journal→ Issue→ Article

FAST MATRIX DECOMPOSITION IN PARALLEL COMPUTER ALGEBRA

Annotation

The new algorithms for finding matrix decomposition and matrix inversion in arbitrary fields are described. For the commutative domains the algorithm for finding adjoint matrices is proposed. These algorithms have the same complexity as matrix multiplication and do not require pivoting. For singular matrices they allow to obtain a nonsingular block of the biggest size. The proposed algorithms are pivot-free, and do not change the matrix block structure. They are suitable for parallel hardware implementation. GRATITUDES: Supported by the Sci. Program Devel. Sci. Potent. High. School, RNP 2.1.1.1853.

Keywords

fast algorithms; matrix decomposition; parallel algorithms; computer algebra

Full-text in one file

Download

UDC

519.688

Pages

1372-1385

Для корректной работы сайта используйте один из современных браузеров. Например, Firefox 55, Chrome 60 или более новые.