Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2012, Article ID 401059, 12 pages
http://dx.doi.org/10.1155/2012/401059
Research Article

A Preconditioned Iteration Method for Solving Sylvester Equations

1School of Mathematics and Computational Science, Wuyi University, Guangdong, Jiangmen 529000, China
2College of Science, China University of Mining and Technology, Xuzhou 221116, China
3Mathematics and Physics Centre, Xi’an Jiaotong-Liverpool University, Suzhou 215123, China

Received 25 May 2012; Accepted 20 June 2012

Academic Editor: Jianke Yang

Copyright © 2012 Jituan Zhou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Bhatia and P. Rosenthal, “How and why to solve the operator equation AX-XB=Y,” The Bulletin of the London Mathematical Society, vol. 29, no. 1, pp. 1–21, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. B. N. Datta, Numerical Methods for Linear Control Systems, Elsevier Academic Press, 2003.
  3. L. Xie, Y. J. Liu, and H.-Z. Yang, “Gradient based and least squares based iterative algorithms for matrix equations AXB+CXTD=F,” Applied Mathematics and Computation, vol. 217, no. 5, pp. 2191–2199, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  4. L. Xie, J. Ding, and F. Ding, “Gradient based iterative solutions for general linear matrix equations,” Computers & Mathematics with Applications, vol. 58, no. 7, pp. 1441–1448, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. J. Ding, Y. J. Liu, and F. Ding, “Iterative solutions to matrix equations of the form AiXBi=Fi,” Computers & Mathematics with Applications, vol. 59, no. 11, pp. 3500–3507, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. G. H. Golub, S. Nash, and C. Van Loan, “A Hessenberg-Schur method for the problem AX-XB=C,” IEEE Transactions on Automatic Control, vol. 24, no. 6, pp. 909–913, 1979. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  7. R. H. Bartels and G. W. Stewart, “Algorithm 432: solution of the matrix equation AX-XB=C,” Communications of the ACM, vol. 15, pp. 820–826, 1972. View at Google Scholar
  8. D. C. Sorensen and Y. K. Zhou, “Direct methods for matrix Sylvester and Lyapunov equations,” Journal of Applied Mathematics, vol. 2003, no. 6, pp. 277–303, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  9. W. H. Enright, “Improving the efficiency of matrix operations in the numerical solution of stiff ordinary differential equations,” ACM Transactions on Mathematical Software, vol. 4, no. 2, pp. 127–136, 1978. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. D. Calvetti and L. Reichel, “Application of ADI iterative methods to the restoration of noisy images,” SIAM Journal on Matrix Analysis and Applications, vol. 17, no. 1, pp. 165–186, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  11. D. Y. Hu and L. Reichel, “Krylov-subspace methods for the Sylvester equation,” Linear Algebra and Its Applications, vol. 172, no. 15, pp. 283–313, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  12. P. Kirrinnis, “Fast algorithms for the Sylvester equation AX-XBT=C,” Theoretical Computer Science, vol. 259, no. 1-2, pp. 623–638, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. G. Starke and W. Niethammer, “SOR for AX-XB=C,” Linear Algebra and Its Applications, vol. 154/156, pp. 355–375, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  14. Q. Niu, X. Wang, and L.-Z. Lu, “A relaxed gradient based algorithm for solving Sylvester equations,” Asian Journal of Control, vol. 13, no. 3, pp. 461–464, 2011. View at Publisher · View at Google Scholar
  15. Z.-Z. Bai, “On Hermitian and Skew-Hermitian splitting iteration methods for continuous Sylvester equations,” Journal of Computational Mathematics, vol. 29, no. 2, pp. 185–198, 2011. View at Google Scholar
  16. F. Ding and T. Chen, “On iterative solutions of general coupled matrix equations,” SIAM Journal on Control and Optimization, vol. 44, no. 6, pp. 2269–2284, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  17. F. Ding and T. Chen, “Iterative least-squares solutions of coupled Sylvester matrix equations,” Systems & Control Letters, vol. 54, no. 2, pp. 95–107, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  18. F. Ding and T. Chen, “Gradient based iterative algorithms for solving a class of matrix equations,” IEEE Transactions on Automatic Control, vol. 50, no. 8, pp. 1216–1221, 2005. View at Publisher · View at Google Scholar
  19. F. Ding, P. X. Liu, and J. Ding, “Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle,” Applied Mathematics and Computation, vol. 197, no. 1, pp. 41–50, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  20. F. Ding and T. Chen, “Gradient-based identification methods for Hammerstein nonlinear ARMAX models,” Nonlinear Dynamics, vol. 45, no. 1-2, pp. 31–43, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  21. F. Ding and T. Chen, “Gradient and least-squares based identification methods for OE and OEMA systems,” Digital Signal Processing, vol. 20, no. 3, pp. 664–677, 2010. View at Google Scholar
  22. Y. J. Liu, J. Sheng, and R. F. Ding, “Convergence of stochastic gradient estimation algorithm for multivariable ARX-like systems,” Computers & Mathematics with Applications, vol. 59, no. 8, pp. 2615–2627, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  23. Y. J. Liu, Y. S. Xiao, and X. L. Zhao, “Multi-innovation stochastic gradient algorithm for multiple-input single-output systems using the auxiliary model,” Applied Mathematics and Computation, vol. 215, no. 4, pp. 1477–1483, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  24. F. Ding, G. J. Liu, and X. P. Liu, “Parameter estimation with scarce measurements,” Automatica, vol. 47, no. 8, pp. 1646–1655, 2011. View at Google Scholar
  25. F. Ding and T. W. Chen, “Performance analysis of multi-innovation gradient type identification methods,” Automatica, vol. 43, no. 1, pp. 1–14, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  26. F. Ding, Y. J. Liu, and B. Bao, “Gradient based and least squares based iterative estimation algorithms for multi-input multi-output systems,” Proceedings of the Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering, vol. 226, no. 1, pp. 43–55, 2012. View at Google Scholar
  27. M. Y. Waziri, W. J. Leong, and M. Mamat, “A two-step matrix-free secant method for solving large-scale systems of nonlinear equations,” Journal of Applied Mathematics, vol. 2012, Article ID 348654, 9 pages, 2012. View at Publisher · View at Google Scholar
  28. L. A. Hageman and D. M. Young, Applied Iterative Methods, Academic Press, New York, NY, USA, 1981.
  29. R. S. Varga, Matrix Iterative Analysis, Springer, Berlin, Germany, 2nd edition, 2000. View at Publisher · View at Google Scholar
  30. The MathWorks, Inc. MATLAB 7, September 2004.
  31. Y. Saad, Iterative Methods for Sparse Linear Systems, PWS, Boston, Mass, USA, 1996.
  32. A. Bouhamidi and K. Jbilou, “A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications,” Applied Mathematics and Computation, vol. 206, no. 2, pp. 687–694, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH