This is machine translation

Translated by Microsoft
Mouseover text to see original. Click the button below to return to the English verison of the page.

Note: This page has been translated by MathWorks. Please click here
To view all translated materals including this page, select Japan from the country navigator on the bottom of this page.


Square-root solver for discrete-time Lyapunov equations


R = dlyapchol(A,B)
X = dlyapchol(A,B,E)


R = dlyapchol(A,B) computes a Cholesky factorization X = R'*R of the solution X to the Lyapunov matrix equation:

A*X*A'- X + B*B' = 0

All eigenvalues of A matrix must lie in the open unit disk for R to exist.

X = dlyapchol(A,B,E) computes a Cholesky factorization X = R'*R of X solving the Sylvester equation

A*X*A' - E*X*E' + B*B' = 0

All generalized eigenvalues of (A,E) must lie in the open unit disk for R to exist.


dlyapchol uses SLICOT routines SB03OD and SG03BD.


[1] Bartels, R.H. and G.W. Stewart, "Solution of the Matrix Equation AX + XB = C," Comm. of the ACM, Vol. 15, No. 9, 1972.

[2] Hammarling, S.J., "Numerical solution of the stable, non-negative definite Lyapunov equation," IMA J. Num. Anal., Vol. 2, pp. 303-325, 1982.

[3] Penzl, T., "Numerical solution of generalized Lyapunov equations," Advances in Comp. Math., Vol. 8, pp. 33-48, 1998.

See Also


Introduced before R2006a

Was this topic helpful?