Parallel solution of block tridiagonal linear systems
The paper deals with the problem of solving linear recurrences arising from the inversion of block tridiagonal systems on a multiprocessor (MIMD architecture). Two algorithms are presented with a development on their complexity, taking into account interprocessor communications. Two cases of small and large number of (identical) processors are studied, the hypercube being the target computer in the second one. Few details are given about the complexity formulas, more information on this interesting point would have been welcome.
scientific article; zbMATH DE number 4062461