Recursive Algorithms of Parallel Matrix Computations
Automation and Remote Control
| Hi-index | 0.00 |
A recursive approach to cell matrix algorithms is considered and applied to the QR factorization by the rotation method. Estimates of the computational complexity both for floating-point operations and for data-transfer operations, which are required for forming cell structures, are given. Parallel versions of the algorithms are considered.