Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017, Article ID 1624969, 8 pages
https://doi.org/10.1155/2017/1624969
Research Article

The Relaxed Gradient Based Iterative Algorithm for the Symmetric (Skew Symmetric) Solution of the Sylvester Equation

1School of Information and Computer, Anhui Agricultural University, Hefei 230036, China
2School of Mathematics and Statistics, Fuyang Normal College, Anhui 236037, China

Correspondence should be addressed to Xingping Sheng; moc.361@gnehsgnipgnix

Received 26 February 2017; Accepted 23 March 2017; Published 3 April 2017

Academic Editor: Jean Jacques Loiseau

Copyright © 2017 Xiaodan Zhang and Xingping Sheng. 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. S. P. Bhattacharyya and E. de Souza, “Pole assignment via Sylvester's equation,” Systems & Control Letters, vol. 1, no. 4, pp. 261–263, 1982. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. G. R. Duan, “Solutions to matrix equation AV+BW=VF and their application to eigenstructure assignment in linear systems,” IEEE Transactions on Automatic Control, vol. 38, no. 2, pp. 276–280, 1993. View at Google Scholar
  3. G. R. Duan, “On the solution to the Sylvester matrix equation AV+BW=EVF,” IEEE Transactions on Automatic Control, vol. 41, no. 4, pp. 612–614, 1996. View at Publisher · View at Google Scholar
  4. B. Zhou and G. R. Duan, “A new solution to the generalized Sylvester matrix equation AV-EVF=BW,” Systems & Control Letters, vol. 55, no. 3, pp. 193–198, 2006. View at Publisher · View at Google Scholar
  5. T. S. Hu, Z. L. Lin, and J. Lam, “Unified gradient approach to performance optimization under a pole assignment constraint,” Journal of Optimization Theory and Applications, vol. 121, no. 2, pp. 361–383, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  6. J. Lam and W. Y. Yan, “A gradient flow approach to the robust pole-placement problem,” International Journal of Robust and Nonlinear Control, vol. 5, no. 3, pp. 175–185, 1995. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. J. Lam and W.-Y. Yan, “Pole assignment with optimal spectral conditioning,” Systems & Control Letters, vol. 29, no. 5, pp. 241–253, 1997. View at Publisher · View at Google Scholar · View at MathSciNet
  8. J. Lam, W.-Y. Yan, and T. Hu, “Pole assignment with eigenvalue and stability robustness,” International Journal of Control, vol. 72, no. 13, pp. 1165–1174, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  9. B. N. Datta, W.-W. Lin, and J.-N. Wang, “Robust partial pole assignment for vibrating systems with aerodynamic effects,” IEEE Transactions on Automatic Control, vol. 51, no. 12, pp. 1979–1984, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. B. Zhou and G. R. Duan, “Parametric approach for the normal Luenberger function observer design in second-order linear systems,” in Proceedings of the 45th IEEE Conference on Decision and Control, pp. 1423–1428, San Diego, Calif, USA, 2006.
  11. D. L. Chu and P. Van Dooren, “A novel numerical method for exact model matching problem with stability,” Automatica, vol. 42, no. 10, pp. 1697–1704, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. D. L. Chu, H. C. Chan, and D. W. C. Ho, “Regularization of singular systems by derivative and proportional output feedback,” SIAM Journal on Matrix Analysis and Applications, vol. 19, no. 1, pp. 21–38, 1998. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. D. L. Chu, V. Mehrmann, and N. K. Nichols, “Minimum norm regularization of descriptor systems by mixed output feedback,” Linear Algebra and Its Applications, vol. 296, no. 1–3, pp. 39–77, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  14. D. L. Chu and V. Mehrmann, “Disturbance decoupling for descriptor systems by state feedback,” SIAM Journal on Control and Optimization, vol. 38, no. 6, pp. 1830–1858, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. D. L. Chu and R. C. E. Tan, “Numerically reliable computing for the row by row decoupling problem with stability,” SIAM Journal on Matrix Analysis and Applications, vol. 23, no. 4, pp. 1143–1170, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. G. H. Golub, S. Nash, and C. Van Loan, “A Hessenberg-Schur method for the problem AX-XB=C,” IEEE Transactions on Automatics Control, vol. 24, pp. 909–913, 1979. View at Google Scholar
  17. R. H. Bartels and G. W. Stewart, “Algorithm 432: Solution of the matrix equation AX-XB=C,” Communications of the ACM, vol. 15, no. 9, pp. 820–826, 1972. View at Google Scholar
  18. Y.-B. Deng, Z.-Z. Bai, and Y.-H. Gao, “Iterative orthogonal direction methods for Hermitian minimum norm solutions of two consistent matrix equations,” Numerical Linear Algebra with Applications, vol. 13, no. 10, pp. 801–823, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  19. 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 Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. 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 MathSciNet · View at Scopus
  21. A. Kaabi, F. Toutounian, and A. Kerayechian, “Preconditioned Galerkin and minimal residual methods for solving Sylvester equations,” Applied Mathematics and Computation, vol. 181, no. 2, pp. 1208–1214, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  22. A. Kaabi, A. Kerayechian, and F. Toutounian, “A new version of successive approximations method for solving Sylvester matrix equations,” Applied Mathematics and Computation, vol. 186, no. 1, pp. 638–645, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  23. Y.-Q. Lin, “Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations,” Applied Mathematics and Computation, vol. 167, no. 2, pp. 1004–1025, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. Y. Lin, “Minimal residual methods augmented with eigenvectors for solving SYLvester equations and generalized SYLvester equations,” Applied Mathematics and Computation, vol. 181, no. 1, pp. 487–499, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. D. Khojasteh Salkuyeh and F. Toutounian, “New approaches for solving large Sylvester equations,” Applied Mathematics and Computation, vol. 173, no. 1, pp. 9–18, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. J.-J. Zhang, “A note on the iterative solutions of general coupled matrix equation,” Applied Mathematics and Computation, vol. 217, no. 22, pp. 9380–9386, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  27. F. Ding and T. Chen, “Hierarchical gradient-based identification of multivariable discrete-time systems,” Automatica, vol. 41, no. 2, pp. 315–325, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. 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 · View at MathSciNet · View at Scopus
  29. F. Ding and T. Chen, “Hierarchical identification of lifted state-space models for general dual-rate systems,” IEEE Transactions on Circuits and Systems. I. Regular Papers, vol. 52, no. 6, pp. 1179–1187, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. J.-P. Chehab and M. Raydan, “An implicit preconditioning strategy for large-scale generalized Sylvester equations,” Applied Mathematics and Computation, vol. 217, no. 21, pp. 8793–8803, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  31. 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 · View at MathSciNet · View at Scopus
  32. 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 · View at MathSciNet · View at Scopus
  33. A.-G. Wu, X. Zeng, G.-R. Duan, and W.-J. Wu, “Iterative solutions to the extended Sylvester-conjugate matrix equations,” Applied Mathematics and Computation, vol. 217, no. 1, pp. 130–142, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  34. 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 · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  35. X. Wang, L. Dai, and D. Liao, “A modified gradient based algorithm for solving Sylvester equations,” Applied Mathematics and Computation, vol. 218, no. 9, pp. 5620–5628, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  36. Y.-J. Xie and C.-F. Ma, “The accelerated gradient based iterative algorithm for solving a class of generalized Sylvester-transpose matrix equation,” Applied Mathematics and Computation, vol. 273, pp. 1257–1269, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  37. Y. Xie and C. Ma, “Iterative methods to solve the generalized coupled Sylvester-conjugate matrix equations for obtaining the centrally symmetric (centrally antisymmetric) matrix solutions,” Journal of Applied Mathematics, vol. 2014, Article ID 515816, 17 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  38. Y. Xie, N. Huang, and C. Ma, “Iterative method to solve the generalized coupled Sylvester-transpose linear matrix equations over reflexive or anti-reflexive matrix,” Computers & Mathematics with Applications, vol. 67, no. 11, pp. 2071–2084, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus