Recursive algorithms of parallel matrix computations

Consideration was given to the recursive approach to the block algorithms of linear algebra. The problem of LLT^–-decomposition (quadratic root) was used by way of example. Computational complexity was estimated both in terms of arithmetic floating-point operations and data-transfer operations required to generate recursive structures. The main area of application of the algorithms is solution of large-scale problems on parallel and distributed computer systems.