User`s guide
Table Of Contents
- Preface
- Quick Start
- LTI Models
- Introduction
- Creating LTI Models
- LTI Properties
- Model Conversion
- Time Delays
- Simulink Block for LTI Systems
- References
- Operations on LTI Models
- Arrays of LTI Models
- Model Analysis Tools
- The LTI Viewer
- Introduction
- Getting Started Using the LTI Viewer: An Example
- The LTI Viewer Menus
- The Right-Click Menus
- The LTI Viewer Tools Menu
- Simulink LTI Viewer
- Control Design Tools
- The Root Locus Design GUI
- Introduction
- A Servomechanism Example
- Controller Design Using the Root Locus Design GUI
- Additional Root Locus Design GUI Features
- References
- Design Case Studies
- Reliable Computations
- Reference
- Category Tables
- acker
- append
- augstate
- balreal
- bode
- c2d
- canon
- care
- chgunits
- connect
- covar
- ctrb
- ctrbf
- d2c
- d2d
- damp
- dare
- dcgain
- delay2z
- dlqr
- dlyap
- drmodel, drss
- dsort
- dss
- dssdata
- esort
- estim
- evalfr
- feedback
- filt
- frd
- frdata
- freqresp
- gensig
- get
- gram
- hasdelay
- impulse
- initial
- inv
- isct, isdt
- isempty
- isproper
- issiso
- kalman
- kalmd
- lft
- lqgreg
- lqr
- lqrd
- lqry
- lsim
- ltiview
- lyap
- margin
- minreal
- modred
- ndims
- ngrid
- nichols
- norm
- nyquist
- obsv
- obsvf
- ord2
- pade
- parallel
- place
- pole
- pzmap
- reg
- reshape
- rlocfind
- rlocus
- rltool
- rmodel, rss
- series
- set
- sgrid
- sigma
- size
- sminreal
- ss
- ss2ss
- ssbal
- ssdata
- stack
- step
- tf
- tfdata
- totaldelay
- zero
- zgrid
- zpk
- zpkdata
- Index

lyap
11-135
11lyap
Purpose Solve continuous-time Lyapunov equations
Syntax X = lyap(A,Q)
X = lyap(A,B,C)
Description lyap solves the special and g eneral forms of the L yapunov matrix equation.
Lyapunov equations arise in several areas of control, including stability theor y
and the study of the RMS behavior of syst ems.
X = lyap(A,Q) solves the Lyapunov equation
where and are square matrices of identical sizes. The solution
X is a
symmetric matrix if is.
X = lyap(A,B,C) solves the generalized Lyapunov equation (also called
Sylvester equation).
The ma trices must have compatible dimensions but need not be
square.
Algorithm lyap transforms the and matrices t o complex Schur form, computes the
solution of the resulting triangular system, and transforms this solution back
[1].
Limitations The continuous Lyapunov equation has a (unique) solution if the eigenvalues
of and of satisfy
If this condition is violated,
lyap produces the error message
Solution does not exist or is not unique.
See Also covar Covariance of system response to white noise
dlyap S olv e discrete Lyapunov equations
AX XA
T
Q++0=
A
Q
Q
AX XB C
++
0
=
ABC
,,
A
B
α
1
α
2
...
α
n
,,,
A
β
1
β
2
...
β
n
,,,
B
α
i
β
j
0
≠+
for all pairs ij
,()