Кафедра мережних технологій
Permanent URI for this collection
Browse
Browsing Кафедра мережних технологій by Subject "block-recursive matrix algorithms"
Now showing 1 - 3 of 3
Results Per Page
Sort Options
Item Efficient Calculation Managing on a Cluster with Distributed Memory: [preprint](2017) Ilchenko, E.; Malaschonok, GennadiManaging of cluster parallel computations for tree-like recursive algebraic algorithms for the case of cluster with distributed memory is one of the diffcult problems of computer algebra. The block-recursive algorithms of matrix and polynomial multiplication, Strassen's and Karatsuba's algorithms, matrix inversion and computation of the kernel of a matrix operator, LDU and Bruhat factorization are examples of such algorithms. We suggest a scheme with multidispatching for management of such parallel computing processes and demonstrate the results of experiments at the JSC RAS cluster MVS-10P.Item Quick Recursive QR Decomposition(2021) Malaschonok, Gennadi; Ivashkevich, AndriyМатеріал доповіді учасників VI Міжнародної конференції з математичних основ інформатики MFOI-2020, 12-16 січня 2021 р., Київ.Item Sparse matrices in computer algebra when using distributed memory: theory and applications: [preprint](2017) Malaschonok, Gennadi; Ilchenko, E.We consider the class of block-recursive matrix algorithms. The most famous of them are standard and Strassen’s block matrix multiplication, Schur and Strassen’s block-matrix inversion. We demonstrate the results of experiments with parallel programms on the base of multidispatching.