Parallel factorizations and parallel solvers for tridiagonal linear systems
At first a unified representation of all types of parallel methods (splittings) for tridiagonal systems is presented. Then parallel algorithms for LU, Gauss-Jordan and cyclic reduction are investigated on a 32-transputer system. The last one is the best one. The speedup in the paper is not clearly defined. It should be the comparison to the best scalar algorithm with roughly half the number of operations of the parallel algorithm. It should be mentioned that for the same reason many tridiagonal systems (occurring for ADI or time split methods) are better solved in parallel, each system on a single processor.
scientific article; zbMATH DE number 64496
scientific article