Implicit iterative algorithms with a tuning parameter for discrete stochastic Lyapunov matrix equations

Implicit iterative algorithms with a tuning parameter for discrete stochastic Lyapunov matrix equations

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Control Theory & Applications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

An implicit iterative algorithm is established for solving a class of Lyapunov matrix equations appearing in the discrete-time stochastic systems with multiplicative noise. This algorithm contains a tuning parameter which can be appropriately chosen such that it has better convergence performance. Some convergence conditions have been derived for the proposed iterative algorithm, and for a special case an approach is given to choose the optimal tuning parameter such that the algorithm has the best convergence performance. In addition, the properties of boundedness and monotonicity of the proposed algorithm are also investigated when the corresponding stochastic system is asymptotically mean-square stable.


    1. 1)
      • 1. Gershon, E., Shaked, U., Yaesh, I.: ‘H control and filtering of discrete-time stochastic systems with multiplicative noise’, Bull. Inst. Politeh. ‘Gheorghe Gheorghiu-Dej’ Bucur. Ser. Autom., 2001, 37, pp. 409417.
    2. 2)
      • 2. Xu, S., Lam, J., Chen, T.: ‘Robust H control for uncertain discrete stochastic time-delay systems’, Syst. Control Lett., 2004, 51, pp. 203215.
    3. 3)
      • 3. Sheng, L., Zhang, W., Gao, M.: ‘Mixed H2/H control of time-varying stochastic discrete-time systems under uniform detectability’, IET Control Theory Appl., 2014, 8, (17), pp. 18661874.
    4. 4)
      • 4. Huang, L., Hjalmarsson, H., Koeppl, H.: ‘Almost sure stability and stabilization of discrete-time stochastic systems’, Syst. Control Lett., 2015, 82, pp. 2632.
    5. 5)
      • 5. Kubrusly, C.S., Costa, O.L.V.: ‘Mean square stability conditions for discrete stochastic bilinear systems’, IEEE Trans. Autom. Control, 1985, AC-30, (11), pp. 10821087.
    6. 6)
      • 6. Feng, J.E., Lam, J., Xu, S., et al: ‘Optimal stabilizing controllers for linear discrete-time stochastic systems’, Optim. Control Appl. Methods, 2008, 29, pp. 243253.
    7. 7)
      • 7. Rami, M.A., Zhou, X.Y., Xu, S.: ‘Linear matrix inequalities, Riccati equations, and indefinite stochastic linear quadratic controls’,IEEE Trans. Autom. Control, 2000, 45, (6), pp. 11311143.
    8. 8)
      • 8. Zhang, W., Chen, B.S.: ‘On stabilizability and exact observability of stochastic systems with their applications’, Automatica, 2004, 40, pp. 8794.
    9. 9)
      • 9. Zhang, W., Zhang, H., Chen, B.S.: ‘Generalized Lyapunov equation approach to state-dependent stochastic stabilization/detectability criterion’, IEEE Trans. Autom. Control, 2008, 53, (7), pp. 16301642.
    10. 10)
      • 10. Li, Z.Y., Wang, Y., Zhou, B., et al: ‘Detectability and observability of discrete-time stochastic systems and their application’, Automatica, 2009, 45, (5), pp. 13401346.
    11. 11)
      • 11. Deng, F., Feng, Z., Liu, Y.: ‘Solution to matrix equation ATP+PA+i=1mFiTPFi=Q (in Chinese)’, Control Theory Appl., 1996, 13, (2), pp. 163168.
    12. 12)
      • 12. Ding, F., Chen, T.: ‘Gradient based iterative algorithms for solving a class of matrix equations’,IEEE Trans. Autom. Control, 2005, 50, (8), pp. 12161221.
    13. 13)
      • 13. Ding, F., Liu, P.X., Ding, J.: ‘Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle’, Appl. Math. Comput., 2008, 197, pp. 4150.

Related content

This is a required field
Please enter a valid email address