TheoremBase

The Lyapunov Differential Equation

Names the Lyapunov differential equation P' = AP + PAᵀ + C with initial value P(a) = P₀, as a matrix initial value problem on [a,b], and its backward form Z' = -(AᵀZ + ZA + Q) with terminal value Z(b) = F.

Statement

In the setting of Vector- and Matrix-Valued Functions on a Compact Interval: Standing Conventions, let a,b∈Ra,b\in\mathbb{R} with a<ba<b, and let n∈Nn\in\mathbb{N}.

Let A,C:[a,b]→Mn(R)A,C:[a,b]\to\mathcal{M}_{n}(\mathbb{R}) be functions and let P0∈Mn(R)P_{0}\in\mathcal{M}_{n}(\mathbb{R}). Let H:[a,b]×Mn(R)→Mn(R)H:[a,b]\times\mathcal{M}_{n}(\mathbb{R})\to\mathcal{M}_{n}(\mathbb{R}) be the function with

H(t,P)=A(t)P+PA(t)⊤+C(t)(t∈[a,b], P∈Mn(R)).H(t,P)=A(t)P+PA(t)^{\top}+C(t)\qquad\bigl(t\in[a,b],\ P\in\mathcal{M}_{n}(\mathbb{R})\bigr).

The Lyapunov differential equation with data AA, CC and P0P_{0} is the initial value problem of The Initial Value Problem for a First-Order System of Ordinary Differential Equations (ii) on [a,b][a,b], with bb for cc, nn for pp and qq, right-hand side HH and initial value P0P_{0}:

P′(t)=A(t)P(t)+P(t)A(t)⊤+C(t)(t∈[a,b]),P(a)=P0,P'(t)=A(t)P(t)+P(t)A(t)^{\top}+C(t)\quad\bigl(t\in[a,b]\bigr),\qquad P(a)=P_{0},

for an unknown function P:[a,b]→Mn(R)P:[a,b]\to\mathcal{M}_{n}(\mathbb{R}). Its solutions are the solutions of this initial value problem.

Let A,Q:[a,b]→Mn(R)A,Q:[a,b]\to\mathcal{M}_{n}(\mathbb{R}) be functions and let F∈Mn(R)F\in\mathcal{M}_{n}(\mathbb{R}). The backward Lyapunov differential equation with data AA, QQ and FF is the terminal value problem

Z′(t)=−(A(t)⊤Z(t)+Z(t)A(t)+Q(t))(t∈[a,b]),Z(b)=F,Z'(t)=-\bigl(A(t)^{\top}Z(t)+Z(t)A(t)+Q(t)\bigr)\quad\bigl(t\in[a,b]\bigr),\qquad Z(b)=F,

for an unknown function Z:[a,b]→Mn(R)Z:[a,b]\to\mathcal{M}_{n}(\mathbb{R}). A solution of it is a function Z:[a,b]→Mn(R)Z:[a,b]\to\mathcal{M}_{n}(\mathbb{R}) that is differentiable and satisfies both conditions.

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…