This is machine translation

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

Note: This page has been translated by MathWorks. Click here to see
To view all translated materials including this page, select Country from the country navigator on the bottom of this page.


Continuous Lyapunov equation solution


X = lyap(A,Q)
X = lyap(A,B,C)
X = lyap(A,Q,[],E)


lyap solves the special and general forms of the Lyapunov equation. Lyapunov equations arise in several areas of control, including stability theory and the study of the RMS behavior of systems.

X = lyap(A,Q) solves the Lyapunov equation


where A and Q represent square matrices of identical sizes. If Q is a symmetric matrix, the solution X is also a symmetric matrix.

X = lyap(A,B,C) solves the Sylvester equation


The matrices A, B, and C must have compatible dimensions but need not be square.

X = lyap(A,Q,[],E) solves the generalized Lyapunov equation


where Q is a symmetric matrix. You must use empty square brackets [] for this function. If you place any values inside the brackets, the function errors out.


The continuous Lyapunov equation has a unique solution if the eigenvalues α1,α2,...,αn of A and β1,β2,...,βn of B satisfy


If this condition is violated, lyap produces the error message:

Solution does not exist or is not unique.


Example 1

Solve Lyapunov Equation

Solve the Lyapunov equation




The A matrix is stable, and the Q matrix is positive definite.

A = [1 2; -3 -4];  
Q = [3 1; 1 1];
X = lyap(A,Q)
These commands return the following X matrix:
X =

    6.1667   -3.8333
   -3.8333    3.0000
You can compute the eigenvalues to see that X is positive definite.


The command returns the following result:

ans =


Example 2

Solve Sylvester Equation

Solve the Sylvester equation




A = 5;
B = [4 3; 4 3];
C = [2 1];
X = lyap(A,B,C)

These commands return the following X matrix:

X =

   -0.2000   -0.0500


lyap uses SLICOT routines SB03MD and SG03AD for Lyapunov equations and SB04MD (SLICOT) and ZTRSYL (LAPACK) for Sylvester equations.


[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] Barraud, A.Y., “A numerical algorithm to solve A XA - X = Q,” IEEE® Trans. Auto. Contr., AC-22, pp. 883–885, 1977.

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

[4] Penzl, T., ”Numerical solution of generalized Lyapunov equations,” Advances in Comp. Math., Vol. 8, pp. 33–48, 1998.

[5] Golub, G.H., Nash, S. and Van Loan, C.F., “A Hessenberg-Schur method for the problem AX + XB = C,” IEEE Trans. Auto. Contr., AC-24, pp. 909–913, 1979.

See Also


Introduced before R2006a