dlyapchol - Square-root solver for discrete-time Lyapunov equations

Syntax

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

Description

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.

Algorithms

dlyapchol 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

dlyap | lyapchol

Free Control Systems Interactive Kit

Learn more about resources for designing, testing, and implementing control systems.

Get free kit

Trials Available

Try the latest control systems products.

Get trial software