# Control Systems/Time Variant System Solutions

## General Time Variant Solution[edit | edit source]

The state-space equations can be solved for time-variant systems, but the solution is significantly more complicated than the time-invariant case. Our time-variant state equation is given as follows:

We can say that the general solution to time-variant state-equation is defined as:

[Time-Variant General Solution]

**Matrix Dimensions:**

A: *p* × *p*

B: *p* × *q*

C: *r* × *p*

D: *r* × *q*

The function is called the **state-transition matrix**, because it (like the matrix exponential from the time-invariant case) controls the change for states in the state equation. However, unlike the time-invariant case, we cannot define this as a simple exponential. In fact, can't be defined in general, because it will actually be a different function for every system. However, the state-transition matrix does follow some basic properties that we can use to determine the state-transition matrix.

In a time-variant system, the general solution is obtained when the state-transition matrix is determined. For that reason, the first thing (and the most important thing) that we need to do here is find that matrix. We will discuss the solution to that matrix below.

### State Transition Matrix[edit | edit source]

**Note**:

The state transition matrix is a matrix function of two variables (we will say

*t*and τ). Once the form of the matrix is solved, we will plug in the initial time, t

_{0}in place of the variable τ. Because of the nature of this matrix, and the properties that it must satisfy, this matrix typically is composed of exponential or sinusoidal functions. The exact form of the state-transition matrix is dependent on the system itself, and the form of the system's differential equation. There is no single "template solution" for this matrix.

The state transition matrix is not completely unknown, it must always satisfy the following relationships:

And also must have the following properties:

1. 2. 3. 4.

If the system is time-invariant, we can define as:

The reader can verify that this solution for a time-invariant system satisfies all the properties listed above. However, in the time-variant case, there are many different functions that may satisfy these requirements, and the solution is dependent on the structure of the system. The state-transition matrix must be determined before analysis on the time-varying solution can continue. We will discuss some of the methods for determining this matrix below.

## Time-Variant, Zero Input[edit | edit source]

As the most basic case, we will consider the case of a system with zero input. If the system has no input, then the state equation is given as:

And we are interested in the response of this system in the time interval T = (a, b). The first thing we want to do in this case is find a **fundamental matrix** of the above equation. The fundamental matrix is related

### Fundamental Matrix[edit | edit source]

*x*is an

*n*× 1 vector, and A is an

*n*×

*n*matrix.

Given the equation:

The solutions to this equation form an *n*-dimensional vector space in the interval T = (a, b). Any set of *n* linearly-independent solutions {x_{1}, x_{2}, ..., x_{n}} to the equation above is called a **fundamental set** of solutions.

**basis set**for the solution space. Any basis set that spans the entire solution space is a valid fundamental set.

A **fundamental matrix FM** is formed by creating a matrix out of the *n* fundamental vectors. We will denote the fundamental matrix with a script capital X:

The fundamental matrix will satisfy the state equation:

Also, *any matrix that solves this equation can be a fundamental matrix* if and only if the determinant of the matrix is non-zero for all time *t* in the interval T. The determinant must be non-zero, because we are going to use the inverse of the fundamental matrix to solve for the state-transition matrix.

### State Transition Matrix[edit | edit source]

Once we have the fundamental matrix of a system, we can use it to find the state transition matrix of the system:

The inverse of the fundamental matrix exists, because we specify in the definition above that it must have a non-zero determinant, and therefore must be non-singular. The reader should note that this is only one possible method for determining the state transition matrix, and we will discuss other methods below.

### Example: 2-Dimensional System[edit | edit source]

Given the following fundamental matrix, Find the state-transition matrix.

the first task is to find the inverse of the fundamental matrix. Because the fundamental matrix is a 2 × 2 matrix, the inverse can be given easily through a common formula:

The state-transition matrix is given by:

### Other Methods[edit | edit source]

There are other methods for finding the state transition matrix besides having to find the fundamental matrix.

- Method 1
- If A(t) is triangular (upper or lower triangular), the state transition matrix can be determined by sequentially integrating the individual rows of the state equation.

- Method 2
- If for every τ and t, the state matrix commutes as follows:
- Then the state-transition matrix can be given as:
- The state transition matrix will commute as described above if any of the following conditions are true:
- A is a constant matrix (time-invariant)
- A is a diagonal matrix
- If , where is a constant matrix, and f(t) is a scalar-valued function (not a matrix).

- If none of the above conditions are true, then you must use
**method 3**. - Method 3
- If A(t) can be decomposed as the following sum:
- Where
*M*_{i}is a constant matrix such that M_{i}M_{j}= M_{j}M_{i}, and*f*_{i}is a scalar-valued function. If A(t) can be decomposed in this way, then the state-transition matrix can be given as:

It will be left as an exercise for the reader to prove that if A(t) is time-invariant, that the equation in **method 2** above will reduce to the state-transition matrix .

### Example: Using Method 3[edit | edit source]

Use method 3, above, to compute the state-transition matrix for the system if the system matrix A is given by:

We can decompose this matrix as follows:

Where f_{1}(t) = t, and f_{2}(t) = 1. Using the formula described above gives us:

Solving the two integrations gives us:

The first term is a diagonal matrix, and the solution to that matrix function is all the individual elements of the matrix raised as an exponent of *e*. The second term can be decomposed as:

The final solution is given as:

## Time-Variant, Non-zero Input[edit | edit source]

If the input to the system is not zero, it turns out that all the analysis that we performed above still holds. We can still construct the fundamental matrix, and we can still represent the system solution in terms of the state transition matrix .

We can show that the general solution to the state-space equations is actually the solution: