Homework 7

Transfer function in space state, Tuesday 1:00pm 200, Jun 11, 2019
Gutiérrez Martı́nez, Manuel Alejandro 1517068

 
Abstract—In this work we obtained the transfer function of a S −1 0
system in a state space, it is the second part of this document, = 1 s+1 0 
the matrix of eigenvectors was obtained and with that we can 0 0 s+2
diagonalize the matrix..
Index Terms—Matrix, linear algebra, inverse matrix the determinant of matrix (SI − A) is obtained, to obtain
the inverse matrix.
I. I NTRODUCTION det(SI − A) = S 3 + 3S 2 + 3S + 2
In many cases, the eigenvector information and eigenvalue where
contained within a matrix A can be represented in a nuance 1
of the form A = P DP −1 . (SI − A)−1 = (adj(SI − A)T
det(SI − A)
It is said that a square matrix A is diagonalizable if, and only
if, A is similar to a diagonal matrix, that is if A = P DP −1 then  s+1 1 
s2 +s+1 s2 +s+1 0
for some unversible P matrix and some diagonal matrix D.
(SI − A)−1 =  2 −1 s
0 
That is, A is diagonalizable if, and only if, if there are s +s+1 s2 +s+1
1
enough eigenvectors to form a base of Rn .A a base of this 0 0 s+2
type is called the base of eigenvectors. the transfer matrix was obtained by doing the corresponding
In linear algebra, the eigenvectors or eigenvectors of an algebra which is the following.
operator are nonzero vectors that, when they are transformed  s2 +2s+3 
by the operator, give rise to a scalar multiple of themselves, s3 +3s2 +3s+2
which does not change their direction[1]. C(SI − A)−1 B + D =  1
s2 +s+1

1
s+2
II. P ROBLEMS B. Diagonalization
A. Caculate F.T to diagonalize the matrix the first thing that was done was to
Calculate the transfer function of the following system. obtain the eigenvalues of the matrix SI −A which are actually
  the roots of det(SI − A), which are the following.
0 1 0
A = −1 −1 0  λ1 = −0.5 + 0.866
0 0 −2 λ2 = −0.5 − 0.866
 
0 λ3 = −2
B = 1
where the following expression is used to obtain the matrix
1
of eigenvalues, by λ1, λ2, λ3
 
1 0 1 λI − A
C = 1 0 0
0 0 1 and thus obtain the matrix of eigenvalues which is the
  following.
0  
0.7071 07071 0
D = 0
T = −0.3536 + 06124i −0.3536 − 6124i 0
0
0 0 1
The expression used to obtain the transfer function is as with the matrix of eigenvalues, the matrix can be obtained
follows in the diagonal form with the exrpesion T −1 AT .
G(S) = C(SI − A)−1 B + D  
−0.5000 + 0.8660i 0 0
−1
where T AT =  0 −0.5000 − 0.8660i 0 
    0 0 −2
S 0 0 0 1 0
(SI − A) =  0 S 0  − −1 −1 0 Next, you can see the block diagram with the system already
0 0 S 0 0 −2 diagonalized.
 Fig. 1. Blocks diagram

where
2i
X(S) =
s2i + 31/2 + 1i
2i
Y (S) =
s2i + 31/2 + 1i
1
Z(S) = (1)
s+2
which agrees with the transfer matrix.
 1 
s+2
C(SI − A)−1 B + D =  0 
1
s+2

III. C ONCLUSION
State space helps us when we have several inputs and several
outputs, and so we could get the different transfer functions
of the system and make a block diagram. It can be concluded
that the diagonalized matrix does not show the poles of the
system, which allows us to handle it in a better way.
R EFERENCES
[1] DAVID C. L AY álgeb́ra lineal y sus aplicaciones, tercera edición, Pearson,