|
|
Informatika i Ee Primeneniya [Informatics and its Applications], 2008, Volume 2, Issue 3, Pages 2–6
(Mi ia101)
|
|
|
 |
Structural matrix systems decomposition
A. S. Olenin
Institute for Problems of Informatics RAS
Abstract:
One of possible approaches to matrix systems parallelizing by their structural decomposion on the set of subsystems independent at the certain stage of calculations is considered. The constructive algorithm of the decomposition method is formulated and the estimation of its computing expenses is given.
Keywords:
matrix system; band matrix; full matrix; triangular matrix; block tridiagonal matrix; decomposition; partition vector; partition interval; factorization; LU-algorithm; parallelizing.
Citation:
A. S. Olenin, “Structural matrix systems decomposition”, Inform. Primen., 2:3 (2008), 2–6
Linking options:
https://www.mathnet.ru/eng/ia101 https://www.mathnet.ru/eng/ia/v2/i3/p2
|
| Statistics & downloads: |
| Abstract page: | 226 | | Full-text PDF : | 115 | | References: | 24 | | First page: | 1 |
|
Citation in format AMSBIB
Contact us: