Fast algorithms for the Sylvester equation AX−XBT=C
- 1 May 2001
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 259 (1-2) , 623-638
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A Strassen-Newton algorithm for high-speed parallelizable matrix inversion2003
- Rectangular Matrix Multiplication RevisitedJournal of Complexity, 1997
- Nearly Optimal Algorithms for Canonical Matrix FormsSIAM Journal on Computing, 1995
- Exploiting fast matrix multiplication within the level 3 BLASACM Transactions on Mathematical Software, 1990
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Three methods for refining estimates of invariant subspacesComputing, 1987
- An Efficient Formula for Linear RecurrencesSIAM Journal on Computing, 1985
- Generalized eigenproblem algorithms and software for algebraic Riccati equationsProceedings of the IEEE, 1984
- A Hessenberg-Schur method for the problem AX + XB= CIEEE Transactions on Automatic Control, 1979
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]Communications of the ACM, 1972