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.

lyapchol

Square-root solver for continuous-time Lyapunov equation

Syntax

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

Description

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

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

All eigenvalues of matrix A must lie in the open left half-plane for R to exist.

X = lyapchol(A,B,E) computes a Cholesky factorization X = R'*R of X solving the generalized Lyapunov equation:

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

All generalized eigenvalues of (A,E) must lie in the open left half-plane for R to exist.

Algorithms

lyapchol uses SLICOT routines SB03OD and SG03BD.

References

[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