Matrix sign function implementations on a hypercube multiprocessor

Three implementations of a matrix sign function algorithm for solving generalized algebraic Riccati equations on an Intel iPSC/d5 hypercube multiprocessor are described. The three implementations are compared for complexity of computation and communication. The best one showed efficiencies of about 60% on large problems. Timing results are given.<>