Parallel Algorithms for Triangular Periodic Sylvester-Type Matrix Equations
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Recursive blocked algorithms for solving periodic triangular Sylvester-type matrix equations
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
| Hi-index | 0.01 |
A direct method for eigenvalue reordering in a product of a K-periodic matrix sequence in periodic or extended periodic real Schur form is presented and analyzed. Each reordering of two adjacent sequences of diagonal blocks is performed tentatively to guarantee backward stability and involves solving a K-periodic Sylvester equation (PSE) and constructing a K-periodic sequence of orthogonal transformation matrices. An error analysis of the direct reordering method is presented, and results from computational experiments confirm the stability and accuracy of the method for well-conditioned as well as ill-conditioned problems. These include matrix sequences with fixed and time-varying dimensions, and sequences of small and large periodicity.