References
- F. P. A. Beik and D. K. Salkuyeh, On the global Krylov subspace methods for solving general coupled matrix equation, Comput. Math. Appl. 62 (2011), no. 12, 4605-4613. https://doi.org/10.1016/j.camwa.2011.10.043
- F. P. A. Beik and D. K. Salkuyeh, The coupled Sylvester-transpose matrix equations over generalized centro- symmetric matrices, Int. J. Comput. Math. 90 (2013), no. 7, 1546-1566. https://doi.org/10.1080/00207160.2012.761337
- D. S. Bernstein, Matrix Mathematics: theory, facts, and formulas, Second edition, Princeton University Press, 2009.
- A. Bjorck, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, 1996.
- C. F. Borges, R. Frezza, and W. B. Gragg, Some inverse eigenproblems for Jacobi and arrow matrices, Numer. Linear Algebra Appl. 2 (1995), no. 3, 195-203. https://doi.org/10.1002/nla.1680020302
- A. Bouhamidi and K. Jbilou, A note on the numerical approximate solutions for gener- alized Sylvester matrix equations with applications, Appl. Math. Comput. 206 (2008), no. 2, 687-694. https://doi.org/10.1016/j.amc.2008.09.022
- M. Dehghan and M. Hajarian, An iterative algorithm for solving a pair of matrix equa- tion AY B = E, CY D = F over generalized centro-symmetric matrices, Comput. Math. Appl. 56 (2008), no. 12, 3246-3260. https://doi.org/10.1016/j.camwa.2008.07.031
- M. Dehghan and M. Hajarian, The general coupled matrix equations over generalized bisymmetric matrices, Linear Algebra Appl. 432 (2010), no. 6, 1531-1552. https://doi.org/10.1016/j.laa.2009.11.014
- M. Dehghan and M. Hajarian, Analysis of an iterative algorithm to solve the generalized coupled Sylvester matrix equations, Appl. Math. Model. 35 (2011), no. 7, 3285-3300. https://doi.org/10.1016/j.apm.2011.01.022
- F. Ding and T. Chen, Gradient based iterative algorithms for solving a class of matrix equations, IEEE Trans. Automat. Control 50 (2005), no. 8, 1216-1221. https://doi.org/10.1109/TAC.2005.852558
- F. Ding and T. Chen, On iterative solutions of general coupled matrix equations, SIAM J. Control Optim. 44 (2006), no. 6, 2269-2284. https://doi.org/10.1137/S0363012904441350
- F. Ding, P. X. Liu, and J. Ding, Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle, Appl. Math. Comput. 197 (2008), no. 1, 41-50. https://doi.org/10.1016/j.amc.2007.07.040
- A. El Guennouni, K. Jbilou, and A. J. Riquet, Block Krylov subspace methods for solving large Sylvester equations, Numer. Algorithms 29 (2002), no. 1-3, 75-96. https://doi.org/10.1023/A:1014807923223
- D. Fisher, G. Golub, O. Hald, C. Leiva, and O. Widlund, On Fourier-Toeplitz methods for separable elliptic problems, Math. Comp. 28 (1974), 349-368. https://doi.org/10.1090/S0025-5718-1974-0415995-2
- M. Hajarian, Developing the CGLS algorithm for the least squares solutions of the general coupled matrix equations, Math. Methods Appl. Sci. 37 (2014), no. 17, 2782- 2798. https://doi.org/10.1002/mma.3017
-
M. Hajarian and M. Dehghan, The generalized centro-symmetric and least squares gen- eralized centro-symmetric solutions of the matrix equation AY B + C
$Y^T$ D = E, Math. Methods Appl. Sci. 34 (2011), no. 13, 1562-1579. https://doi.org/10.1002/mma.1459 - D. Y. Hu and L. Reichel, Krylov-subspace methods for the Sylvester equation, Linear Algebra Appl. 172 (1992), 283-313. https://doi.org/10.1016/0024-3795(92)90031-5
- G. X. Huang, F. Ying, and K. Gua, An iterative method for skew-symmetric solution and the optimal approximate solution of the matrix equation AXB = C, J. Comput. Appl. Math. 212 (2008), no. 2, 231-244. https://doi.org/10.1016/j.cam.2006.12.005
- K. Jbilou and A. J. Riquet, Projection methods for large Lyapunov matrix equations, Linear Algebra Appl. 415 (2006), no. 2, 344-358. https://doi.org/10.1016/j.laa.2004.11.004
- T. Jiang and M. Wei, On solutions of the matrix equations X − AXB = C and X − A X B = C, Linear Algebra Appl. 367 (2003), 225-233. https://doi.org/10.1016/S0024-3795(02)00633-X
- H. Li, Z. Gao, and D. Zhao, Least squares solutions of the matrix equation AXB + CY D = E with the least norm for symmetric arrowhead matrices, Appl. Math. Comput. 226 (2014), 719-724. https://doi.org/10.1016/j.amc.2013.10.065
- J. F. Li, X. Y. Hu, X.-F. Duan, and L. Zhang, Iterative method for mirror-symmetric solution of matrix equation AXB +CY D = E, Bull. Iranian Math. Soc. 36 (2010), no. 2, 35-55.
- D. P. O'leary and G. Stewart, Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices, J. Comput. Phys. 90 (1990), no. 2, 497-405. https://doi.org/10.1016/0021-9991(90)90177-3
- B. Parlett, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cilffs, 1980.
- B. Parlett and B. Nour-Omid, The use of a refined error bound when updating eigen- values of tridiagonals, Linear Algebra Appl. 68 (1985), 179-219. https://doi.org/10.1016/0024-3795(85)90213-7
-
Z. H. Peng, The reflexive least squares solutions of the matrix equation
$A_1X_1B_1$ +$A_2X_2B_2$ + ... +$A_{\ell}X_{\ell}B_{\ell}$ = C with a submatrix constraint, Numer. Algorithms 64 (2013), no. 3, 455-480. https://doi.org/10.1007/s11075-012-9674-7 - Z. H. Peng, X. Y. Hu, and L. Zhang, Two inverse eigenvalue problems for a special kind of matrices, Linear Algebra Appl. 416 (2006), no. 2, 336-347. https://doi.org/10.1016/j.laa.2005.11.017
Cited by
- Iterative algorithms for least-squares solutions of a quaternion matrix equation vol.53, pp.1-2, 2017, https://doi.org/10.1007/s12190-015-0959-6
- Symmetric least squares solution of a class of Sylvester matrix equations via MINIRES algorithm vol.354, pp.14, 2017, https://doi.org/10.1016/j.jfranklin.2017.08.004
- An efficient iterative algorithm for quaternionic least-squares problems over the generalized -(anti-)bi-Hermitian matrices vol.65, pp.9, 2017, https://doi.org/10.1080/03081087.2016.1255172