A NEW SOLUTION METHOD FOR THE DISCRETE LYAPUNOV EQUATIONS

Fang Yamin (P. R. China), Li Shuhong (P. R. China) and Zhang Mabiao (P. R. China)

Received December 2, 2007

References:

[1] A. Y. Barraud, A numerical algorithm to solve IEEE Trans. Automat. Contr. 22 (1977), 883-885. [2] D. Boley and G. Golub, The Lanczos-Arnoldi algorithm and controllability, Syst. Contr. Lett. (4) (1984), 317-324. [3] S. Guoyong and C.-J. Richard Shi, Model-order reduction by dominant subspace projection: error bound, subspace computation and circuit applications, IEEE Trans. Circuits Syst. 52(5) (2005), 975-993. [4] T. Kailath, Linear Systems, Prentice Hall, Englewood Cliffs, 1980. [5] J. LaSalle and S. Lefschetz, Stability of Lyapunov's Direct Method, Academic Press, New York, 1961. [6] B. RH and G. W. Stewart, Solution of the matrix equation Commun. ACM (15) (1972), 820-826. [7] Y. Saad, Numerical solution of large Lyapunov equations, Signal Processing, Scattering, Operator Theory, and Numerical Methods, M. Kaashoek, J. Schuppen, and A. Ran, eds., Boston, MA, 1990, pp. 503-511. [8] TROCH, Solving the Discrete Lyapunov Equation Using the Solution of the Corresponding of the Correspongding Continuous Lyapunov Equation and Vice Versa, IEEE Trans. Automat. Contr. 33(10) (1988), 944-946. [9] C. Villemagne and R. Skelton, Model reduction using a projection formulation, Int. J. Control 46 (1987), 2141-2169. [10] J. Vlach and K. Singhal, Computer Methods for Circuit Analysis and Design, 2nd ed., Van Nostrand Reinhold, New York, 1993.

Keywords and phrases: discrete Lyapunov equation, eigenvalue decomposition, Krylov subspace, model-order reduction.