[1] S. Agoujil, A.H. Bentbib, K. Jabilou and E.M. Sadek, A minimal residual norm method for large-scale Sylvester matrix equations, Electronic Transactions on Numerical Analysis, 43 (2014) 45-59.
[2] Z-Z. Bai, Hermitian and skew-Hermitian spliting iteration methods for continuous Sylvester equations, Journal of Computational Mathematics, 29 (2011) 185-198.
[3] R.H. Bartels and G.W. Stewart, Solution of the matrix equation AX + XB = C, Algorithm 432, Communications of the ACM, 15 (1972) 820-826.
[4] P. Benner, R.C. Li, and N. Truhar, On the ADI method for Sylvester equations, Journal of Computational and Applied Mathematics, 233 (2009), 1035-1045.
[5] A. Bouhamidi, and K. Jabilou, A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications, Applied Mathematics and Computation, 206 (2008), 687-694.
[6] B.N. Datta and K. Datta, Theoretical and Computational Aspects of some Linear Algebra Problems in Control Theory, in: Computational and Combinatorial Methods in Systems Theory, eds. C.I. Byrnes and A. Lindquist, Elsevier, Amsterdam, (1986), 201-212.
[7] E. de Sturler, Nested Krylov methods based on GCR, Journal of Computational and Applied Mathematics, 67 (1996), 15-41.
[8] E. de Sturler, Truncation strategies for optimal Krylov subspace methods, SIAM Journal on Numerical Analysis, 36 (1999), 864-889.
[9] M. Dehghan and M. Hajarian, Two algorithms for finding the Hermitian reflexive and skew Hermitian solutions of Sylvester matrix equations, Applied Mathematics Letters, 24 (2011), 444-449.
[10] G.H. Golub, S. Nash and C. Van Loan, A Hessenberg–Schur method for the problem AX + XB = C, IEEE Transactions on Automatic Control, 24 (1979), 909-913.
[11] A.El. Guennouni, K. Jbilou and A.J. Riquet, Block Krylov Subspace Methods for Solving Large Sylvester Equations, Numerical Algorithms, 29 (2002), 75-96.
[12] A.El. Guennouni, K. Jbilou and H. Sadok, A block version of BICGSTAB for linear systems with multiple right-hand sides, Electronic Transactions on Numerical Analysis, 16 (2003), 129-142.
[13] C. Hyland and D. Bernstein, The optimal projection equations for fixed-order dynamic compensation, IEEE Transactions on Automatic Control, 29 (1984), 1034-1037.
[14] M. Khorsand Zak and F. Toutounian, Nested splitting CG-like iterative method for solving the continuous Sylvester equation and preconditioning, Advances in Computational Mathematics, 40 (2013), 865-880.
[15] J. Laub, M.T. Heath, C. Paige and R.C. Ward, Computation of system balancing transformations and other applications of simultaneous diagonalisation algorithms, IEEE Transactions on Automatic Control, 32 (1987) 115-122.
[16] Matrix Market, http:// math.nist.gov/ matrixMarket.
[17] J. Meng, H.B Li and Y.-F. Jing, A new deflated block GCROT(m, k) method for the solution of linear systems with multiple right-hand sides, Journal of Computational and Applied Mathematics, 300} (2016), 155-171.
[18] J. Meng, P.Y. Zhu and H.B. Li, A block GCROT(m, k) method for linear systems with multiple right-hand sides, Journal of Computational and Applied Mathematics, 225 (2014), 544-554.
[19] T. Penzel, LYAPACK: A MATLAB toolbox for large Lyapunov and Riccati equations, model reduction problems, and linear-quadratic optimal control problems, software available at https://www.tu-chemnitz.de/sfb393/lyapack/.
[20] D.K. Salkuyeh and F. Toutounian, New approaches for solving large Sylvester equations, Applied Mathematics and Computation, 173 (2006) 9-18.
[21] H.A. Van der Vorst and C. Vuik, GMRESR: A family of nested GMRES methods, Technical Report 91-80, Faculty of Technical Mathematics and Informatics, Delft University of Technology, Delft, Netherlands, (1991).
)