SIAM Journal on Matrix Analysis and Applications
Solution of the Sylvester matrix equation AXBT + CXDT = E
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
Recursion leads to automatic variable blocking for dense linear-algebra algorithms
IBM Journal of Research and Development
LAPACK Users' guide (third ed.)
LAPACK Users' guide (third ed.)
Blocked algorithms and software for reduction of a regular matrix pair to generalized Schur form
ACM Transactions on Mathematical Software (TOMS)
Solution of the matrix equation AX + XB = C [F4]
Communications of the ACM
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
Recursive Blocked Data Formats and BLAS's for Dense Linear Algebra Algorithms
PARA '98 Proceedings of the 4th International Workshop on Applied Parallel Computing, Large Scale Scientific and Industrial Problems
Parallel Triangular Sylvester-Type Matrix Equation Solvers for SMP Systems Using Recursive Blocking
PARA '00 Proceedings of the 5th International Workshop on Applied Parallel Computing, New Paradigms for HPC in Industry and Academia
Parallel Algorithms for Triangular Sylvester Equations: Design, Scheduling and Saclability Issues
PARA '98 Proceedings of the 4th International Workshop on Applied Parallel Computing, Large Scale Scientific and Industrial Problems
Hi-index | 0.00 |
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.