7.6. The General Solution of LTI Systems¶
In this section we conclude our introduction to state space systems by developing a method that can be used to solve any linear time invariant (LTI) system using the state space model. This will put on a formal mathematical footing the approach described in Section 7.3.
To do this we need to derive the Taylor series for the state matrix and then use the results from the previous two lectures to formally derive the state transmission matrix ϕ(t) from the resolvant matrix
This will lead is to a general solution which we will illustrate with examples and compare with the solution developed in the last section and the solution obtained by inverting the system transfer function. As before, we will refer to MATLAB where relevant.
Once we have completed this material, we will be in a position to move on to look at state-space methods for control system design.
7.6.1. The Matrix Exponential Function¶
In mathematics, the Taylor series is a representation of a function as an infinite sum of terms calculated from the values of its derivatives at a single point. It is named after the English mathematician Brook Taylor. It is common practice to use a finite number of terms of the series to approximate a function. The Taylor series may be regarded as the limit of the Taylor polynomials.
We use Taylor series to approximate general functions, and here we adapt the Taylor series to discover the form of a function of a matrix.
7.6.1.1. Taylor series¶
If a function f(t) has Taylor series:
Then the corresponding matrix function is defined as:
7.6.1.2. Using the Similarity Transformation¶
Given the transformation T−1AT=Λ:
The matrix function becomes:
The term inside the brackets on the rhs is a diagonal matrix and the ith diagonal element is:
From the Taylor series this must be f(λit):
where f(Λt)=diag(f(λit)).
7.6.1.3. Transition Matrix¶
In particular, the solution of:
given x=x0 at t=0 is:
The term ϕ(t)=eAt is known as the state transition matrix because it shows how time, t, transforms the initial state vector into the present one.
7.6.1.4. Forced solution¶
Furthermore, the solution of:
given x=x0 at t=0 is:
7.6.1.5. End of Pre-Class Presentation¶
In the class we will work through a worked example of this approach and contrast it with two alternatives – diagonalization by similarity transform and Laplace.
7.6.2. Example¶
Find the solution of:
given x0=[1, 1]T, and u=1 for t≥0.
Note: The solutions to this example and the remaining alternatives are available in the form of MATLAB scripts and as Pencasts in OneNote.
7.6.2.1. Solution¶
The state matrix A is the same as Example 4 from Section 7.3, so the transformation matrix is:
with an inverse:
and with corresponding eigenvalues λ1=−1 and λ2=−2.
Therefore the state transition matrix is:
The solution is:
where term1=ϕ(t)x0=eAtx0.
and
Combining term1 and ∫t0term2dτ we find the total, forced, response:
Therefore:
7.6.2.2. Alternative solution 1¶
Repeat Example 1 using the transformation to normal canonical form:
Using the transformation to normal canonical form:
Therefore
7.6.2.3. Alternative solution 2¶
Solve the problem of example 1 using the Laplace transform method.
Taking Laplace transforms of the state equations, taking account of the initial conditions:
Therefore
Therefore
Taking partial fractions:
Finally, taking inverse Laplace transforms: