Parallel Two-Sided Sylvester-Type Matrix Equation Solvers for SMP Systems Using Recursive Blocking

  • Authors:
  • Isak Jonsson;Bo Kågström

  • Affiliations:
  • -;-

  • Venue:
  • PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present recursive blocked algorithms for solving triangular two-sided Sylvester-type matrix equations. Recursion leads to automatic blocking that is variable and "squarish". The main part of the computations are performed as level 3 general matrix multiply and add (GEMM) operations. This is a continuation of the work presented at the PARA2000 conference ([9]), where we presented results for one-sided Sylvester-type matrix equations. The improvements for two-sided Sylvester-type matrix equations are remarkable, and make a substantial impact on solving unreduced matrix equations problems as well. Uniprocessor and SMP parallel performance results are presented and compared with results from existing LAPACK and SLICOT routines for solving this type of matrix equations.