Problem 2 (Gaussian Elimination, Fundamental Spaces, Least Squares, Minimum Norm) Consider the following linear algebraic system of equations:

Size: px
Start display at page:

Download "Problem 2 (Gaussian Elimination, Fundamental Spaces, Least Squares, Minimum Norm) Consider the following linear algebraic system of equations:"

Transcription

1 EEE58 Exam, Fall 6 AA Rodriguez Rules: Closed notes/books, No calculators permitted, open minds GWC 35, Problem (Dynamic Augmentation: State Space Representation) Consider a dynamical system consisting of several subsystems The describing equations are as follows: y x a, ẋ a y p y y p y p C p x p + D p u p, ẋ p A p x p + B p u p u p u, u p x a, ẋ a x a + u Sketch a block diagram and determine a state space representation for the above dynamical system Problem (Gaussian Elimination, Fundamental Spaces, Least Squares, Minimum Norm) Consider the following linear algebraic system of equations: A 5 b () (a) Determine the general solution (b) Determine a basis for the four fundamental subspaces: R(A),R(A T ),N(A),N(A T ) Now let b T and consider the vector norm z def z T z (c) Determine the sef all possible x that minimizes the error b Ax (d) Determine the projection P R(A) b of the vector b onto the range of A (e) Determine the minimum norm x which minimizes the error b Ax Problem 3 (Controllability, State Transfer, Pole Placement) p z p Consider the LTI system defined by the state space dual A, B where z p p and z p Sketch a block diagram for the system (a) Is the system controllable? Explain your answer Are there any pole-zero cancellations? (b) Does there exist a control law which will transfer the state of the system from x o to x()? If so, show how to determine one Also, determine a minimum energy state transferring control law (c) Does there exist a full state feedback control law u Gx such that the closed loop system has poles at s ± j? If so, determine a suitable control gain matrix G If not, explain why Problem 4 (Controllability, State Transfer, Pole Placement) p z p Consider the LTI system defined by the state space dual A, B where z p p and z p (a) Is the system controllable? Explain your answer Are there any pole-zero cancellations? (b) Assuming x o, determine an expression for x(t) using modal analysis concepts Determine a basis for the sef states that are reachable from x o (c) Does there exist a control law which will transfer the state of the system from x o to x()? If so, determine one Also, determine a minimum energy state transferring control law (d) Does there exist a control law which will transfer the state of the system from x o to x()? If so, determine one If not, determine what state closest to x() is reachable Then determine a control law which will achieve the transfer to this reachable state Is your control law unique? If not, show how to determine another state transferring control law and determine the minimum energy state transferring control law (e) Does there exist a full state feedback control law u Gx such that the closed loop system has poles at s p, (where p )? If so, determine a suitable control gain matrix G If not, explain why (f) Does there exist a full state feedback control law u Gx such that the closed loop system has poles at

2 s, 5 (both distinct from p )? If so, determine a suitable control gain matrix G If not, explain why Problem 5 (Observability, State Reconstruction, Pole Placement) p Consider the LTI system defined by the state space triple A p where z p and z p Sketch a block diagram for the system, B, C z p (a) Is the system observable? Explain your answer Are there any pole-zero cancellations? (b) Suppose that u and y is known on t, Determine an expression for the sef all possible initial conditions x o Can x o be determined uniquely? Explain Determine the minimum norm initial condition (c) Can one design an observer with closed loop poles at s,? If not, explain why If so, determine a suitable observer gain matrix H Moreover, determine the state estimation error x def x ˆx when u, the initial system state is x o, and the initial state estimate (used in your observer) is ˆx o Problem 6 (Observability, State Reconstruction, Pole Placement) p Consider the LTI system defined by the state space triple A, B, C z p p where z p and z p (a) Is the system observable? Explain your answer Are there any pole-zero cancellations? (b) Suppose that u and y is known on t, Determine an expression for the sef all possible initial conditions x o Can x o be determined uniquely? Explain Determine the minimum norm initial condition (c) Can one design an observer with closed loop poles at s p, (where p )? If so, determine a suitable observer gain matrix H If not, explain why (d) Can one design an observer with closed loop poles at s, 5 (both distinct from p )? If so, determine a suitable observer gain matrix H If not, explain why (e) Discuss how the answers to (a)-(d) change if z p and z p? Hint: Examine block diagram Problem 7 (Model Based Compensator Design) Consider the linear time invariant plant P (s) s 5 with state space quadruple A p 5,B p,c p,d p (a) Show how to design a model based compensator which satisfies the following design specifications: (i) zero steady state error to step reference commands, (ii) closed loop poles at s 4 ± j3, s ± j (b) Discuss how one might minimize the overshoot due to a step reference command (c) Summarize the design process if one desires to follow sinusoidal reference commands with frequency ω o

3 EEE58 Exam Solutions, Fall 6 AA Rodriguez Rules: Closed notes/books, No calculators permitted, open minds GWC 35, Problem (Dynamic Augmentation: State Space Representation) Consider a dynamical system consisting of several subsystems The describing equations are as follows: y x a, ẋ a y p y y p y p C p x p + D p u p, ẋ p A p x p + B p u p u p u, u p x a, ẋ a x a + u Sketch a block diagram and determine a state space representation for the above dynamical system Problem -Partial Solution: u p u x a T () ẋ a y p (C p x p + D p u p ) (3) ẋ p A p x p + B p u p (4) ẋ a x a + u (5) y x a (6) y y p (C p x p + D p u p ) (7) B p B p B p (8) D p D p D p (9) ẋ a ẋ p ẋ a C p B p A p B p x a x p x a + B p B p u u () y y C p D p x a x p + D p u u () x a Problem (Gaussian Elimination, Fundamental Spaces, Least Squares, Minimum Norm) Consider the following linear algebraic system of equations: A b () 5 (a) Determine the general solution (b) Determine a basis for the four fundamental subspaces: R(A),R(A T ),N(A),N(A T ) (c) Determine the minimum norm solution Now let b T and consider the vector norm z def z T z (d) Determine the sef all possible x that minimizes the error b Ax (e) Determine the projection P R(A) b of the vector b onto the range of A (f) Determine the minimum norm x which minimizes the error b Ax Problem Solution: (a) Gaussian Elimination yields U ˆb b b b b 3 b (3)

4 From this, it follows that rank(a) This is also the number of basic variables The basic variables are x and x 4 From the last equation, we have x 4 b 3 b From this and the the first equation, it follows that x b x 4 b (b 3 b )5b b 3 The general solution is given by x 5b b 3 x + x x 3 + x 3 (4) x 4 b + b 3 b constrainn b; required for existence (5) Check, via substitution into Ax, that the above general solution does in fact satisfy Ax b b b b 3 T (b) Dimensions and bases for each of the 4 fundamnntal subspaces are as follows: From the above Gaussian elimination, it follows that dimr(a) rank(a) A basis for R(A) is:, (6) 5 Similarly, dimr(a H )rank(a) A basis for R(A H ) is as follows:, 5 (7) or, (8) From the above Gaussian elimination, it follows that dimn(a) n rank(a) 4 (number of free variables) A basis for N(A) is given by, (9) From the above Gaussian elimination, it follows that dimn(a H )m rank(a) 3 (number of constraints on b) A basis for N(A H ) is given by () This follows from the constraint equation (Equation (5)) that resulted from the above Gaussian elimination process (c) To determine the minimum norm solution (which is unique), we need to determine a solution that lies in the row space of A (or row space of U) Two approaches are used to address this componenf the problem Approach : Using U and ˆb It suffices to solve UU H z ˆb for any z and choose x U H z Doing so yields UU H z z 5 z ˆb b b b b 3 b ()

5 Performing Gaussian elimination on this yields 4 b z b b or 5 5b 3 b 4 z b b b 5b 3 b () From this, it follows that z is free, z and z 3 are basic, z 3 b +5b 3, z b 4z 3 b 4( b +5b 3 )b +48b b 3 5b b 3 The general z solution is then z 5b b 3 z + z (3) z 3 b +5b 3 From this, we obtain the minimum norm solution z 5b b 3 x U H z z + z (4) z 3 b +5b 3 5b b 3 5b b 3 (5) b 4b 3 b +5b 3 b + b 3 Approach : Using A and b Note that using the pair AA H w b, x A H w, yields the same result; but it generally involves more cumbersome arithmetic Lets show this: 5 5 b AA H w w 5 5 w b b (6) 5 9 b 3 5 Gaussian elimination on this yields b w b b b b 3 or 44 6 w b b b b 5b 3 b (7) From this, we obtain w 3 5b 3 b and w b 44 6 w 3 w b 44 6 (5b 3 b ) w b b 3 +88b w 9b b 3 w From this, it follows that w 9b b 3 w + w (8) w 3 b +5b 3 This yields the minimum norm solution 9b b 3 4b +b 3 5b b 3 9b b 3 x A H w + w b +5b b 4b 3 6b +5b 3 b + b 3 (9)

6 It should be noted that the minimum norm solution is the unique projection of any solution onto the row space of A (or U) (d) To determine the sef all vectors x that minimize b Ax, it is necessary and sufficient to determine the sef all vectors x that satisfy the normal equations A H Ax A H b To do so, we proceed as follows: 6 4 A H Ax x x A H b b b b 3 (3) This yields A H Ax x A H b b + b +b 3 b +b +5b 3 (3) From this, it follows that x x b + b +b 3 b +b +5b b + b +b b +b +5b b + b +b 3 (3) 7 3 b +b +5b 3 65(b + b +b 3 ) 7(b +b +5b 3 ) (33) 7(b + b +b 3 ) + 3(b +b +5b 3 ) 5b +5b b 3 (34) b b + b 3 (35) The general solution is then given by x x x 3 x 4 5b +5b b 3 b b + b 3 + x + x 3 (36) (e) To determine the unique projection of b onto R(A), we need any solution to the normal equations A H Ax A H b and then P R(A) b Ax Using the result from (d) yields P R(A) b 5b +5b b 3 Ax + x + 5 b b + b 3 (5b +5b b 3 )+( b b + b 3 ) 5b +5b (5b +5b b 3 )+( b b + b 3 ) 5b +5b (5b +5b b 3 )+5( b b + b 3 ) b 3 x 3 (37) (38)

7 Recall that b R(A) if and only if b b In such a case, we note that P R(A) b b b b 3 as expected (f) To determine the minimum norm x that minimizes b Ax, we must solve AA H z P R(A) b for any z and then take x A H z Doing so yields AA H z z w P R(A)b 9 5b +5b 5b +5b b 3 (39) Gaussian elimination yields z b +6b 5b 3 or 44 6 z P R(A)b b +b 6b 6b +5b 3 (4) The latter equations yield z 3 6b 6b +5b 3 and z b +b 44 6 z 3 z b +b +44b + 44b b 3 z 45b +45b b 3 z From this, we obtain the general solution z z z 3 45b +45b b 3 6b 6b +5b 3 + From this, the minimum norm x that minimizes b Ax is given by x A H z z (4) 45b +45b b 3 + z 5b 5b +5b 3 5 (45b +45b b 3 )+( 6b 6b +5b 3 ) 5b +5b b 3 (4) (43) (45b +45b b 3 )+5( 6b 6b +5b 3 ) b b + b 3 Finally, it is worth noting that if b b then b R(A), P R(A) b b, and the above minimum norm x that minimizes Ax b takes the form x A H z 5b b 3 b + b 3 T which is in agreement with the answer obtained in (c) Problem 3 (Controllability, State Transfer, Pole Placement) p z p Consider the LTI system defined by the state space dual A, B where z p p and z p Sketch a block diagram for the system (a) Is the system controllable? Explain your answer Are there any pole-zero cancellations? (b) Does there exist a control law which will transfer the state of the system from x o to x()? If so, show how to determine one Also, determine a minimum energy state transferring control law (c) Does there exist a full state feedback control law u Gx such that the closed loop system has poles at s ± j? If so, determine a suitable control gain matrix G If not, explain why Problem 3-Partial Solution: (a) From the block diagram, one can identify two systems in series One system (the input system) has

8 transfer function z p s+p + s+z s+p This system feeds into a system (the output system) with transfer s+z function s+p The transfer function of the composite system is therefore s+p s+p From this, one sees that we have a pole-zero cancellation, the state x is uncontrollable, and p is an uncontrollable mode if and only if z p The controllability matrix is given by z p p C B AB (44) p From this, we see that det C p +p +p z p z Given this, the system is uncontrollable if and only if z p Since z p, it follows that the system is controllable and there are no pole-zero cancellations It should be noted that the condition z p is NOT needed for controllability (b) Since the system is controllable, there exists a control u that will transfer the state from any initial state x( )x o to any final state x(t f )x f in finite time Such a state transferring control law is provided by any u satisfying tf e A(to t f ) x f x o e A(to τ) Bu(τ)dτ (45) Such a u is given by ( tf ) u M(t) e A(to τ) BM(τ)dτ e A(to t f ) x f x o (46) where M(t) is any matrix -valued function of t such that the above inverse exists A particular control law that does the job is the minimum energy control law This control law is obtained when M(t) B H e AH ( t) In such a case, we have the following Gramian formula: u B H e AH ( t) G c (,t f ) e A(to t f ) x f x o (47) where G c (,t f ) tf For our problem, e At may be computed as follows ( s + p p z ) (si A) s + p e A(to τ) BB H e A H ( τ) dτ (48) ( ) s + p z p (49) (s + p )(s + p ) s + p ( z p ) s+p (s+p )(s+p ) (5) s+p From this, it follows that e At ( e p t z p p p e pt e pt ) e pt (5) (c) Since the system is controllable, there exists a full state feedback control gain matrix G which will place the eigenvalues of A BG anywhere in the complex plane - modulo complex conjugate constraints For our problem, p z p A BG p g g p g z p g g p g (5) To place closed loop poles at ± j, we require det(si A + BG) s + p + g det g + p z g s + p + g (53) s +(p + g + p + g )s +(p + g )(p + g )+g (z p g ) (54) s +(g + g + p + p )s + p p + g (p + z p )+g p (55) s +s + (56)

9 The above yields the algebraic system of equations: g p p z p g p p (57) As expected, this system possesses a solution if and only if z p ; ie if and only if the system is controllable In such a case, the solution is given by g p p p p p (58) g z p p p p z z p p p ( p p ) ( p p ) (59) p z z( p p ) + ( p p ) Problem 4 (Controllability, State Transfer, Pole Placement) p z p Consider the LTI system defined by the state space dual A, B where z p p and z p (a) Is the system controllable? Explain your answer Are there any pole-zero cancellations? (b) Assuming x o, determine an expression for x(t) using modal analysis concepts Determine a basis for the sef states that are reachable from x o (c) Does there exist a control law which will transfer the state of the system from x o to x()? If so, determine one Also, determine a minimum energy state transferring control law (d) Does there exist a control law which will transfer the state of the system from x o to x()? If so, determine one If not, determine what state closest to x() is reachable Then determine a control law which will achieve the transfer to this reachable state Is your control law unique? If not, show how to determine another state transferring control law and determine the minimum energy state transferring control law (e) Does there exist a full state feedback control law u Gx such that the closed loop system has poles at s p, (where p )? If so, determine a suitable control gain matrix G If not, explain why (f) Does there exist a full state feedback control law u Gx such that the closed loop system has poles at s, 5 (both distinct from p )? If so, determine a suitable control gain matrix G If not, explain why Problem 4 - Solution: (a) From the block diagram, one sees that we have a pole-zero cancellation, the state x is uncontrollable, and p is an uncontrollable mode if and only if z p The controllability matrix is given by z p p C B AB (6) p From this, we see that det C p + p + p z p z Given this, the system is uncontrollable if and only if z p Since z p, it follows that the system is uncontrollable and there is a pole-zero cancellation at s p It should be noted that the condition z p is NOT needed for controllability We now use PBH eigenvalue-eigenvector ideas to show that p is an uncontrollable mode Since A is diagonal, it follows that the system eigenvalues can be determined by inspection to be λ p and λ p We s + p p note that that (si A) p s + p For s p, we have (si A) p p It follows that v p p T is an eigenvector associated with p p p For s p, we have (si A) p p It follows that v T is an eigenvector associated with p

10 The matrix of right eigenvectors is given by V v v (6) Since the eigenvectors ar linearly independent, this matrix is invertible, and the system A matrix is said to be diagonalizable The corresponding matrix of left eigenvectors is then given by w H W w H V (6) Next, we note that w H B It thus follows from the PBH eigenvalue-eigenvector modal controllability test that p is an uncontrollable mode This, of course, was expected from the pole-zero cancellation within the system block diagram (b) To determine an expression for x(t), we use the above modal information Specifically, we note that e At B e λt v w H B + e λt v w H B e λt v w H B e pt It thus follows that x() x f A basis for the sef all reachable states from x o is then v e pt (63) e p( τ) u(τ)dτ (64) (c) There exists a control law which transfers the state from x o to satisfying In fact, any control law e p( τ) u(τ)dτ e p e pτ u(τ)dτ (65) will do the job The following is such a control law: u e p (66) epτ dτ where it is assumed that the integral in the denominator is non-zero This will be the case for any finite p One can also determine the minimum energy control law that will perform the desired state transfer To do so, we apply our minimum energy control law Gramian formula with x o,,x f,t f,a p, B This works because x f t f e A(t f τ) Bu(τ)dτ matches the above (desired) integral constraint for the selected values For the above selected values, we get the following from our minimum energy Gramian formula tf G c (,t f ) e A(to τ) BB H e A H ( τ) dτ e pτ dτ e p (67) p for p Forp, we obtain u B H e AH ( t) G c (,t f ) e A(to t f ) x f x o G c (,t f ) tf e pt p e p ep (68) e A(to τ) BB H e A H ( τ) dτ e pτ dτ (69) u B H e AH ( t) G c (,t f ) e A(to t f ) x f x o e pt e p (7)

11 (d) Given the analysis in (b), it follows that there does not exist a control law that will transfer the state from x o tox() x f because does not lie along the span of v In such a case, we can determine a control law that will minimize b Ax x where x e p( τ) u(τ)dτ To determine x, we solve the normal equations A H Ax A H b or x This yields x orx We thus need to determine a u such that e p( τ) u(τ)dτ One u that does the job is u e p ep τ dτ There are infinitely many control laws that will do the job Using x o,, x f, t f,a p, B, the minimum energy control law is given by G c (,t f ) tf e A(to τ) BB H e A H ( τ) dτ e pτ dτ p e p (7) u B H e AH ( t) G c (,t f ) e A(to t f ) x f x o e pt p e p e p (7) for p Forp, we obtain G c (,t f ) tf e A(to τ) BB H e A H ( τ) dτ e pτ dτ (73) u B H e AH ( t) G c (,t f ) e A(to t f ) x f x o e pt e p (74) (e) Since p is an uncontrollable mode, it cannot be moved via full state feedback (linear or otherwise) Given this, it is possible to find a control gain matrix G such that A BG has eigenvalues at p and where p That is, one pole stays fixed at p ; the other can be moved to any desired (real) location With z p, it follows that det(si A + BG) s + p + g det g + p p g s + p + g (75) s +(p + g + p + g )s +(p + g )(p + g )+g (p p g ) (76) s +(g + g + p + p )s + p (g + g + p ) (77) (s + p )(s + g + g + p ) (78) This corroborates the above; namely that p cannot be moved; the other closed loop eigenvalue (pole) can be placed at any desired real location g + g + p will, for example, place the other pole at (f) Since p is uncontrollable and hence cannot be moved, it is NOT possible to move both poles to arbitrary locations If and 5 are distinct from p, then no G exists If one of these are p, then from above, a G can be found Problem 5 (Observability, State Reconstruction, Pole Placement) p Consider the LTI system defined by the state space triple A p where z p and z p Sketch a block diagram for the system, B, C z p (a) Is the system observable? Explain your answer Are there any pole-zero cancellations? (b) Suppose that u and y is known on t, Determine an expression for the sef all possible initial conditions x o Can x o be determined uniquely? Explain Determine the minimum norm initial condition (c) Can one design an observer with closed loop poles at s,? If not, explain why If so, determine a suitable observer gain matrix H Moreover, determine the state estimation error x def x ˆx when u, the initial system state is x o, and the initial state estimate (used in your observer) is ˆx o

12 Problem 5-Partial Solution: (a) From the block diagram, one can identify two systems in series One system (the input system) has transfer function s+p This system feeds into a system (the output system) with transfer function z p s+p + s+z s+p s+z The transfer function of the composite system is therefore s+p s+p From this, one sees that we have a pole-zero cancellation, the state x is unobservable, and p is an unobservable mode if and only if z p Problem 6 (Observability, State Reconstruction, Pole Placement) p Consider the LTI system defined by the state space triple A, B, C z p p where z p and z p (a) Is the system observable? Explain your answer Are there any pole-zero cancellations? (b) Suppose that u and y is known on t, Determine an expression for the sef all possible initial conditions x o Can x o be determined uniquely? Explain Determine the minimum norm initial condition (c) Can one design an observer with closed loop poles at s p, (where p )? If so, determine a suitable observer gain matrix H If not, explain why (d) Can one design an observer with closed loop poles at s, 5 (both distinct from p )? If so, determine a suitable observer gain matrix H If not, explain why (e) Discuss how the answers to (a)-(d) change if z p and z p? Hint: Examine block diagram Problem 7 (Model Based Compensator Design) Consider the linear time invariant plant P (s) s 5 with state space quadruple A p 5,B p,c p,d p (a) Show how to design a model based compensator which satisfies the following design specifications: (i) zero steady state error to step reference commands, (ii) closed loop poles at s 4 ± j3, s ± j (b) Discuss how one might minimize the overshoot due to a step reference command (c) Summarize the design process if one desires to follow sinusoidal reference commands with frequency ω o

ẋ n = f n (x 1,...,x n,u 1,...,u m ) (5) y 1 = g 1 (x 1,...,x n,u 1,...,u m ) (6) y p = g p (x 1,...,x n,u 1,...,u m ) (7)

ẋ n = f n (x 1,...,x n,u 1,...,u m ) (5) y 1 = g 1 (x 1,...,x n,u 1,...,u m ) (6) y p = g p (x 1,...,x n,u 1,...,u m ) (7) EEE582 Topical Outline A.A. Rodriguez Fall 2007 GWC 352, 965-3712 The following represents a detailed topical outline of the course. It attempts to highlight most of the key concepts to be covered and

More information

SECTION 3.3. PROBLEM 22. The null space of a matrix A is: N(A) = {X : AX = 0}. Here are the calculations of AX for X = a,b,c,d, and e. =

SECTION 3.3. PROBLEM 22. The null space of a matrix A is: N(A) = {X : AX = 0}. Here are the calculations of AX for X = a,b,c,d, and e. = SECTION 3.3. PROBLEM. The null space of a matrix A is: N(A) {X : AX }. Here are the calculations of AX for X a,b,c,d, and e. Aa [ ][ ] 3 3 [ ][ ] Ac 3 3 [ ] 3 3 [ ] 4+4 6+6 Ae [ ], Ab [ ][ ] 3 3 3 [ ]

More information

Linear System Theory

Linear System Theory Linear System Theory Wonhee Kim Chapter 6: Controllability & Observability Chapter 7: Minimal Realizations May 2, 217 1 / 31 Recap State space equation Linear Algebra Solutions of LTI and LTV system Stability

More information

Math 224, Fall 2007 Exam 3 Thursday, December 6, 2007

Math 224, Fall 2007 Exam 3 Thursday, December 6, 2007 Math 224, Fall 2007 Exam 3 Thursday, December 6, 2007 You have 1 hour and 20 minutes. No notes, books, or other references. You are permitted to use Maple during this exam, but you must start with a blank

More information

Linear Algebra- Final Exam Review

Linear Algebra- Final Exam Review Linear Algebra- Final Exam Review. Let A be invertible. Show that, if v, v, v 3 are linearly independent vectors, so are Av, Av, Av 3. NOTE: It should be clear from your answer that you know the definition.

More information

AMS10 HW7 Solutions. All credit is given for effort. (-5 pts for any missing sections) Problem 1 (20 pts) Consider the following matrix 2 A =

AMS10 HW7 Solutions. All credit is given for effort. (-5 pts for any missing sections) Problem 1 (20 pts) Consider the following matrix 2 A = AMS1 HW Solutions All credit is given for effort. (- pts for any missing sections) Problem 1 ( pts) Consider the following matrix 1 1 9 a. Calculate the eigenvalues of A. Eigenvalues are 1 1.1, 9.81,.1

More information

EK102 Linear Algebra PRACTICE PROBLEMS for Final Exam Spring 2016

EK102 Linear Algebra PRACTICE PROBLEMS for Final Exam Spring 2016 EK102 Linear Algebra PRACTICE PROBLEMS for Final Exam Spring 2016 Answer the questions in the spaces provided on the question sheets. You must show your work to get credit for your answers. There will

More information

Kalman Decomposition B 2. z = T 1 x, where C = ( C. z + u (7) T 1, and. where B = T, and

Kalman Decomposition B 2. z = T 1 x, where C = ( C. z + u (7) T 1, and. where B = T, and Kalman Decomposition Controllable / uncontrollable decomposition Suppose that the controllability matrix C R n n of a system has rank n 1

More information

Module 07 Controllability and Controller Design of Dynamical LTI Systems

Module 07 Controllability and Controller Design of Dynamical LTI Systems Module 07 Controllability and Controller Design of Dynamical LTI Systems Ahmad F. Taha EE 5143: Linear Systems and Control Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ataha October

More information

LINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS

LINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS LINEAR ALGEBRA, -I PARTIAL EXAM SOLUTIONS TO PRACTICE PROBLEMS Problem (a) For each of the two matrices below, (i) determine whether it is diagonalizable, (ii) determine whether it is orthogonally diagonalizable,

More information

MATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION

MATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION MATH (LINEAR ALGEBRA ) FINAL EXAM FALL SOLUTIONS TO PRACTICE VERSION Problem (a) For each matrix below (i) find a basis for its column space (ii) find a basis for its row space (iii) determine whether

More information

Module 09 From s-domain to time-domain From ODEs, TFs to State-Space Modern Control

Module 09 From s-domain to time-domain From ODEs, TFs to State-Space Modern Control Module 09 From s-domain to time-domain From ODEs, TFs to State-Space Modern Control Ahmad F. Taha EE 3413: Analysis and Desgin of Control Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/

More information

Lecture notes: Applied linear algebra Part 1. Version 2

Lecture notes: Applied linear algebra Part 1. Version 2 Lecture notes: Applied linear algebra Part 1. Version 2 Michael Karow Berlin University of Technology karow@math.tu-berlin.de October 2, 2008 1 Notation, basic notions and facts 1.1 Subspaces, range and

More information

POLE PLACEMENT. Sadegh Bolouki. Lecture slides for ECE 515. University of Illinois, Urbana-Champaign. Fall S. Bolouki (UIUC) 1 / 19

POLE PLACEMENT. Sadegh Bolouki. Lecture slides for ECE 515. University of Illinois, Urbana-Champaign. Fall S. Bolouki (UIUC) 1 / 19 POLE PLACEMENT Sadegh Bolouki Lecture slides for ECE 515 University of Illinois, Urbana-Champaign Fall 2016 S. Bolouki (UIUC) 1 / 19 Outline 1 State Feedback 2 Observer 3 Observer Feedback 4 Reduced Order

More information

Module 03 Linear Systems Theory: Necessary Background

Module 03 Linear Systems Theory: Necessary Background Module 03 Linear Systems Theory: Necessary Background Ahmad F. Taha EE 5243: Introduction to Cyber-Physical Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ taha/index.html September

More information

(a) II and III (b) I (c) I and III (d) I and II and III (e) None are true.

(a) II and III (b) I (c) I and III (d) I and II and III (e) None are true. 1 Which of the following statements is always true? I The null space of an m n matrix is a subspace of R m II If the set B = {v 1,, v n } spans a vector space V and dimv = n, then B is a basis for V III

More information

MODULE 8 Topics: Null space, range, column space, row space and rank of a matrix

MODULE 8 Topics: Null space, range, column space, row space and rank of a matrix MODULE 8 Topics: Null space, range, column space, row space and rank of a matrix Definition: Let L : V 1 V 2 be a linear operator. The null space N (L) of L is the subspace of V 1 defined by N (L) = {x

More information

Balanced Truncation 1

Balanced Truncation 1 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.242, Fall 2004: MODEL REDUCTION Balanced Truncation This lecture introduces balanced truncation for LTI

More information

Controllability, Observability, Full State Feedback, Observer Based Control

Controllability, Observability, Full State Feedback, Observer Based Control Multivariable Control Lecture 4 Controllability, Observability, Full State Feedback, Observer Based Control John T. Wen September 13, 24 Ref: 3.2-3.4 of Text Controllability ẋ = Ax + Bu; x() = x. At time

More information

Eigenvalues, Eigenvectors. Eigenvalues and eigenvector will be fundamentally related to the nature of the solutions of state space systems.

Eigenvalues, Eigenvectors. Eigenvalues and eigenvector will be fundamentally related to the nature of the solutions of state space systems. Chapter 3 Linear Algebra In this Chapter we provide a review of some basic concepts from Linear Algebra which will be required in order to compute solutions of LTI systems in state space form, discuss

More information

PRACTICE FINAL EXAM. why. If they are dependent, exhibit a linear dependence relation among them.

PRACTICE FINAL EXAM. why. If they are dependent, exhibit a linear dependence relation among them. Prof A Suciu MTH U37 LINEAR ALGEBRA Spring 2005 PRACTICE FINAL EXAM Are the following vectors independent or dependent? If they are independent, say why If they are dependent, exhibit a linear dependence

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science : Dynamic Systems Spring 2011

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science : Dynamic Systems Spring 2011 MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.4: Dynamic Systems Spring Homework Solutions Exercise 3. a) We are given the single input LTI system: [

More information

Solutions to Review Problems for Chapter 6 ( ), 7.1

Solutions to Review Problems for Chapter 6 ( ), 7.1 Solutions to Review Problems for Chapter (-, 7 The Final Exam is on Thursday, June,, : AM : AM at NESBITT Final Exam Breakdown Sections % -,7-9,- - % -9,-,7,-,-7 - % -, 7 - % Let u u and v Let x x x x,

More information

] [ 200. ] 3 [ 10 4 s. [ ] s + 10 [ P = s [ 10 8 ] 3. s s (s 1)(s 2) series compensator ] 2. s command pre-filter [ 0.

] [ 200. ] 3 [ 10 4 s. [ ] s + 10 [ P = s [ 10 8 ] 3. s s (s 1)(s 2) series compensator ] 2. s command pre-filter [ 0. EEE480 Exam 2, Spring 204 A.A. Rodriguez Rules: Calculators permitted, One 8.5 sheet, closed notes/books, open minds GWC 352, 965-372 Problem (Analysis of a Feedback System) Consider the feedback system

More information

ECEEN 5448 Fall 2011 Homework #4 Solutions

ECEEN 5448 Fall 2011 Homework #4 Solutions ECEEN 5448 Fall 2 Homework #4 Solutions Professor David G. Meyer Novemeber 29, 2. The state-space realization is A = [ [ ; b = ; c = [ which describes, of course, a free mass (in normalized units) with

More information

Linear Algebra Practice Problems

Linear Algebra Practice Problems Linear Algebra Practice Problems Math 24 Calculus III Summer 25, Session II. Determine whether the given set is a vector space. If not, give at least one axiom that is not satisfied. Unless otherwise stated,

More information

1 Continuous-time Systems

1 Continuous-time Systems Observability Completely controllable systems can be restructured by means of state feedback to have many desirable properties. But what if the state is not available for feedback? What if only the output

More information

CONTROL DESIGN FOR SET POINT TRACKING

CONTROL DESIGN FOR SET POINT TRACKING Chapter 5 CONTROL DESIGN FOR SET POINT TRACKING In this chapter, we extend the pole placement, observer-based output feedback design to solve tracking problems. By tracking we mean that the output is commanded

More information

MATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP)

MATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP) MATH 20F: LINEAR ALGEBRA LECTURE B00 (T KEMP) Definition 01 If T (x) = Ax is a linear transformation from R n to R m then Nul (T ) = {x R n : T (x) = 0} = Nul (A) Ran (T ) = {Ax R m : x R n } = {b R m

More information

3 Gramians and Balanced Realizations

3 Gramians and Balanced Realizations 3 Gramians and Balanced Realizations In this lecture, we use an optimization approach to find suitable realizations for truncation and singular perturbation of G. It turns out that the recommended realizations

More information

SYSTEMTEORI - ÖVNING 5: FEEDBACK, POLE ASSIGNMENT AND OBSERVER

SYSTEMTEORI - ÖVNING 5: FEEDBACK, POLE ASSIGNMENT AND OBSERVER SYSTEMTEORI - ÖVNING 5: FEEDBACK, POLE ASSIGNMENT AND OBSERVER Exercise 54 Consider the system: ẍ aẋ bx u where u is the input and x the output signal (a): Determine a state space realization (b): Is the

More information

MIT Final Exam Solutions, Spring 2017

MIT Final Exam Solutions, Spring 2017 MIT 8.6 Final Exam Solutions, Spring 7 Problem : For some real matrix A, the following vectors form a basis for its column space and null space: C(A) = span,, N(A) = span,,. (a) What is the size m n of

More information

Contents. 1 State-Space Linear Systems 5. 2 Linearization Causality, Time Invariance, and Linearity 31

Contents. 1 State-Space Linear Systems 5. 2 Linearization Causality, Time Invariance, and Linearity 31 Contents Preamble xiii Linear Systems I Basic Concepts 1 I System Representation 3 1 State-Space Linear Systems 5 1.1 State-Space Linear Systems 5 1.2 Block Diagrams 7 1.3 Exercises 11 2 Linearization

More information

Math 314/ Exam 2 Blue Exam Solutions December 4, 2008 Instructor: Dr. S. Cooper. Name:

Math 314/ Exam 2 Blue Exam Solutions December 4, 2008 Instructor: Dr. S. Cooper. Name: Math 34/84 - Exam Blue Exam Solutions December 4, 8 Instructor: Dr. S. Cooper Name: Read each question carefully. Be sure to show all of your work and not just your final conclusion. You may not use your

More information

Math 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam

Math 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam Math 8, Linear Algebra, Lecture C, Spring 7 Review and Practice Problems for Final Exam. The augmentedmatrix of a linear system has been transformed by row operations into 5 4 8. Determine if the system

More information

Topic # Feedback Control

Topic # Feedback Control Topic #11 16.31 Feedback Control State-Space Systems State-space model features Observability Controllability Minimal Realizations Copyright 21 by Jonathan How. 1 Fall 21 16.31 11 1 State-Space Model Features

More information

Math 323 Exam 2 Sample Problems Solution Guide October 31, 2013

Math 323 Exam 2 Sample Problems Solution Guide October 31, 2013 Math Exam Sample Problems Solution Guide October, Note that the following provides a guide to the solutions on the sample problems, but in some cases the complete solution would require more work or justification

More information

Modal Decomposition and the Time-Domain Response of Linear Systems 1

Modal Decomposition and the Time-Domain Response of Linear Systems 1 MASSACHUSETTS INSTITUTE OF TECHNOLOGY DEPARTMENT OF MECHANICAL ENGINEERING.151 Advanced System Dynamics and Control Modal Decomposition and the Time-Domain Response of Linear Systems 1 In a previous handout

More information

Control Systems I. Lecture 4: Diagonalization, Modal Analysis, Intro to Feedback. Readings: Emilio Frazzoli

Control Systems I. Lecture 4: Diagonalization, Modal Analysis, Intro to Feedback. Readings: Emilio Frazzoli Control Systems I Lecture 4: Diagonalization, Modal Analysis, Intro to Feedback Readings: Emilio Frazzoli Institute for Dynamic Systems and Control D-MAVT ETH Zürich October 13, 2017 E. Frazzoli (ETH)

More information

Dynamic interpretation of eigenvectors

Dynamic interpretation of eigenvectors EE263 Autumn 2015 S. Boyd and S. Lall Dynamic interpretation of eigenvectors invariant sets complex eigenvectors & invariant planes left eigenvectors modal form discrete-time stability 1 Dynamic interpretation

More information

EE221A Linear System Theory Final Exam

EE221A Linear System Theory Final Exam EE221A Linear System Theory Final Exam Professor C. Tomlin Department of Electrical Engineering and Computer Sciences, UC Berkeley Fall 2016 12/16/16, 8-11am Your answers must be supported by analysis,

More information

Problem # Max points possible Actual score Total 120

Problem # Max points possible Actual score Total 120 FINAL EXAMINATION - MATH 2121, FALL 2017. Name: ID#: Email: Lecture & Tutorial: Problem # Max points possible Actual score 1 15 2 15 3 10 4 15 5 15 6 15 7 10 8 10 9 15 Total 120 You have 180 minutes to

More information

Final Exam - Take Home Portion Math 211, Summer 2017

Final Exam - Take Home Portion Math 211, Summer 2017 Final Exam - Take Home Portion Math 2, Summer 207 Name: Directions: Complete a total of 5 problems. Problem must be completed. The remaining problems are categorized in four groups. Select one problem

More information

Control Systems Design

Control Systems Design ELEC4410 Control Systems Design Lecture 14: Controllability Julio H. Braslavsky julio@ee.newcastle.edu.au School of Electrical Engineering and Computer Science Lecture 14: Controllability p.1/23 Outline

More information

Topic # /31 Feedback Control Systems

Topic # /31 Feedback Control Systems Topic #7 16.30/31 Feedback Control Systems State-Space Systems What are the basic properties of a state-space model, and how do we analyze these? Time Domain Interpretations System Modes Fall 2010 16.30/31

More information

CME 345: MODEL REDUCTION

CME 345: MODEL REDUCTION CME 345: MODEL REDUCTION Balanced Truncation Charbel Farhat & David Amsallem Stanford University cfarhat@stanford.edu These slides are based on the recommended textbook: A.C. Antoulas, Approximation of

More information

Control Systems I. Lecture 6: Poles and Zeros. Readings: Emilio Frazzoli. Institute for Dynamic Systems and Control D-MAVT ETH Zürich

Control Systems I. Lecture 6: Poles and Zeros. Readings: Emilio Frazzoli. Institute for Dynamic Systems and Control D-MAVT ETH Zürich Control Systems I Lecture 6: Poles and Zeros Readings: Emilio Frazzoli Institute for Dynamic Systems and Control D-MAVT ETH Zürich October 27, 2017 E. Frazzoli (ETH) Lecture 6: Control Systems I 27/10/2017

More information

João P. Hespanha. January 16, 2009

João P. Hespanha. January 16, 2009 LINEAR SYSTEMS THEORY João P. Hespanha January 16, 2009 Disclaimer: This is a draft and probably contains a few typos. Comments and information about typos are welcome. Please contact the author at hespanha@ece.ucsb.edu.

More information

ME 234, Lyapunov and Riccati Problems. 1. This problem is to recall some facts and formulae you already know. e Aτ BB e A τ dτ

ME 234, Lyapunov and Riccati Problems. 1. This problem is to recall some facts and formulae you already know. e Aτ BB e A τ dτ ME 234, Lyapunov and Riccati Problems. This problem is to recall some facts and formulae you already know. (a) Let A and B be matrices of appropriate dimension. Show that (A, B) is controllable if and

More information

MATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible.

MATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible. MATH 2331 Linear Algebra Section 2.1 Matrix Operations Definition: A : m n, B : n p ( 1 2 p ) ( 1 2 p ) AB = A b b b = Ab Ab Ab Example: Compute AB, if possible. 1 Row-column rule: i-j-th entry of AB:

More information

A SHORT SUMMARY OF VECTOR SPACES AND MATRICES

A SHORT SUMMARY OF VECTOR SPACES AND MATRICES A SHORT SUMMARY OF VECTOR SPACES AND MATRICES This is a little summary of some of the essential points of linear algebra we have covered so far. If you have followed the course so far you should have no

More information

For each problem, place the letter choice of your answer in the spaces provided on this page.

For each problem, place the letter choice of your answer in the spaces provided on this page. Math 6 Final Exam Spring 6 Your name Directions: For each problem, place the letter choice of our answer in the spaces provided on this page...... 6. 7. 8. 9....... 6. 7. 8. 9....... B signing here, I

More information

Chapter 6: Orthogonality

Chapter 6: Orthogonality Chapter 6: Orthogonality (Last Updated: November 7, 7) These notes are derived primarily from Linear Algebra and its applications by David Lay (4ed). A few theorems have been moved around.. Inner products

More information

16.31 Fall 2005 Lecture Presentation Mon 31-Oct-05 ver 1.1

16.31 Fall 2005 Lecture Presentation Mon 31-Oct-05 ver 1.1 16.31 Fall 2005 Lecture Presentation Mon 31-Oct-05 ver 1.1 Charles P. Coleman October 31, 2005 1 / 40 : Controllability Tests Observability Tests LEARNING OUTCOMES: Perform controllability tests Perform

More information

Chapter 30 Minimality and Stability of Interconnected Systems 30.1 Introduction: Relating I/O and State-Space Properties We have already seen in Chapt

Chapter 30 Minimality and Stability of Interconnected Systems 30.1 Introduction: Relating I/O and State-Space Properties We have already seen in Chapt Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology 1 1 c Chapter

More information

DIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix

DIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix DIAGONALIZATION Definition We say that a matrix A of size n n is diagonalizable if there is a basis of R n consisting of eigenvectors of A ie if there are n linearly independent vectors v v n such that

More information

Linear System Theory

Linear System Theory Linear System Theory Wonhee Kim Lecture 4 Apr. 4, 2018 1 / 40 Recap Vector space, linear space, linear vector space Subspace Linearly independence and dependence Dimension, Basis, Change of Basis 2 / 40

More information

Linear Algebra Final Exam Study Guide Solutions Fall 2012

Linear Algebra Final Exam Study Guide Solutions Fall 2012 . Let A = Given that v = 7 7 67 5 75 78 Linear Algebra Final Exam Study Guide Solutions Fall 5 explain why it is not possible to diagonalize A. is an eigenvector for A and λ = is an eigenvalue for A diagonalize

More information

ECE 388 Automatic Control

ECE 388 Automatic Control Controllability and State Feedback Control Associate Prof. Dr. of Mechatronics Engineeering Çankaya University Compulsory Course in Electronic and Communication Engineering Credits (2/2/3) Course Webpage:

More information

Some solutions of the written exam of January 27th, 2014

Some solutions of the written exam of January 27th, 2014 TEORIA DEI SISTEMI Systems Theory) Prof. C. Manes, Prof. A. Germani Some solutions of the written exam of January 7th, 0 Problem. Consider a feedback control system with unit feedback gain, with the following

More information

(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax =

(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax = . (5 points) (a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? dim N(A), since rank(a) 3. (b) If we also know that Ax = has no solution, what do we know about the rank of A? C(A)

More information

EECS C128/ ME C134 Final Wed. Dec. 15, am. Closed book. Two pages of formula sheets. No calculators.

EECS C128/ ME C134 Final Wed. Dec. 15, am. Closed book. Two pages of formula sheets. No calculators. Name: SID: EECS C28/ ME C34 Final Wed. Dec. 5, 2 8- am Closed book. Two pages of formula sheets. No calculators. There are 8 problems worth points total. Problem Points Score 2 2 6 3 4 4 5 6 6 7 8 2 Total

More information

There are six more problems on the next two pages

There are six more problems on the next two pages Math 435 bg & bu: Topics in linear algebra Summer 25 Final exam Wed., 8/3/5. Justify all your work to receive full credit. Name:. Let A 3 2 5 Find a permutation matrix P, a lower triangular matrix L with

More information

6.241 Dynamic Systems and Control

6.241 Dynamic Systems and Control 6.241 Dynamic Systems and Control Lecture 24: H2 Synthesis Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology May 4, 2011 E. Frazzoli (MIT) Lecture 24: H 2 Synthesis May

More information

Math 118, Fall 2014 Final Exam

Math 118, Fall 2014 Final Exam Math 8, Fall 4 Final Exam True or false Please circle your choice; no explanation is necessary True There is a linear transformation T such that T e ) = e and T e ) = e Solution Since T is linear, if T

More information

Practice Final Exam Solutions

Practice Final Exam Solutions MAT 242 CLASS 90205 FALL 206 Practice Final Exam Solutions The final exam will be cumulative However, the following problems are only from the material covered since the second exam For the material prior

More information

Discrete and continuous dynamic systems

Discrete and continuous dynamic systems Discrete and continuous dynamic systems Bounded input bounded output (BIBO) and asymptotic stability Continuous and discrete time linear time-invariant systems Katalin Hangos University of Pannonia Faculty

More information

YORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #2 Solutions

YORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #2 Solutions YORK UNIVERSITY Faculty of Science Department of Mathematics and Statistics MATH 3. M Test # Solutions. (8 pts) For each statement indicate whether it is always TRUE or sometimes FALSE. Note: For this

More information

Grammians. Matthew M. Peet. Lecture 20: Grammians. Illinois Institute of Technology

Grammians. Matthew M. Peet. Lecture 20: Grammians. Illinois Institute of Technology Grammians Matthew M. Peet Illinois Institute of Technology Lecture 2: Grammians Lyapunov Equations Proposition 1. Suppose A is Hurwitz and Q is a square matrix. Then X = e AT s Qe As ds is the unique solution

More information

Multivariable Control. Lecture 03. Description of Linear Time Invariant Systems. John T. Wen. September 7, 2006

Multivariable Control. Lecture 03. Description of Linear Time Invariant Systems. John T. Wen. September 7, 2006 Multivariable Control Lecture 3 Description of Linear Time Invariant Systems John T. Wen September 7, 26 Outline Mathematical description of LTI Systems Ref: 3.1-3.4 of text September 7, 26Copyrighted

More information

2018 Fall 2210Q Section 013 Midterm Exam I Solution

2018 Fall 2210Q Section 013 Midterm Exam I Solution 8 Fall Q Section 3 Midterm Exam I Solution True or False questions ( points = points) () An example of a linear combination of vectors v, v is the vector v. True. We can write v as v + v. () If two matrices

More information

Math 265 Linear Algebra Sample Spring 2002., rref (A) =

Math 265 Linear Algebra Sample Spring 2002., rref (A) = Math 265 Linear Algebra Sample Spring 22. It is given that A = rref (A T )= 2 3 5 3 2 6, rref (A) = 2 3 and (a) Find the rank of A. (b) Find the nullityof A. (c) Find a basis for the column space of A.

More information

Ir O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )

Ir O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v ) Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O

More information

LINEAR ALGEBRA SUMMARY SHEET.

LINEAR ALGEBRA SUMMARY SHEET. LINEAR ALGEBRA SUMMARY SHEET RADON ROSBOROUGH https://intuitiveexplanationscom/linear-algebra-summary-sheet/ This document is a concise collection of many of the important theorems of linear algebra, organized

More information

EE451/551: Digital Control. Chapter 8: Properties of State Space Models

EE451/551: Digital Control. Chapter 8: Properties of State Space Models EE451/551: Digital Control Chapter 8: Properties of State Space Models Equilibrium State Definition 8.1: An equilibrium point or state is an initial state from which the system nevers departs unless perturbed

More information

Intro. Computer Control Systems: F8

Intro. Computer Control Systems: F8 Intro. Computer Control Systems: F8 Properties of state-space descriptions and feedback Dave Zachariah Dept. Information Technology, Div. Systems and Control 1 / 22 dave.zachariah@it.uu.se F7: Quiz! 2

More information

Perspective. ECE 3640 Lecture 11 State-Space Analysis. To learn about state-space analysis for continuous and discrete-time. Objective: systems

Perspective. ECE 3640 Lecture 11 State-Space Analysis. To learn about state-space analysis for continuous and discrete-time. Objective: systems ECE 3640 Lecture State-Space Analysis Objective: systems To learn about state-space analysis for continuous and discrete-time Perspective Transfer functions provide only an input/output perspective of

More information

A Brief Outline of Math 355

A Brief Outline of Math 355 A Brief Outline of Math 355 Lecture 1 The geometry of linear equations; elimination with matrices A system of m linear equations with n unknowns can be thought of geometrically as m hyperplanes intersecting

More information

BASIC ALGORITHMS IN LINEAR ALGEBRA. Matrices and Applications of Gaussian Elimination. A 2 x. A T m x. A 1 x A T 1. A m x

BASIC ALGORITHMS IN LINEAR ALGEBRA. Matrices and Applications of Gaussian Elimination. A 2 x. A T m x. A 1 x A T 1. A m x BASIC ALGORITHMS IN LINEAR ALGEBRA STEVEN DALE CUTKOSKY Matrices and Applications of Gaussian Elimination Systems of Equations Suppose that A is an n n matrix with coefficents in a field F, and x = (x,,

More information

Lecture 1: Systems of linear equations and their solutions

Lecture 1: Systems of linear equations and their solutions Lecture 1: Systems of linear equations and their solutions Course overview Topics to be covered this semester: Systems of linear equations and Gaussian elimination: Solving linear equations and applications

More information

Advanced Control Theory

Advanced Control Theory State Space Solution and Realization chibum@seoultech.ac.kr Outline State space solution 2 Solution of state-space equations x t = Ax t + Bu t First, recall results for scalar equation: x t = a x t + b

More information

Math Final December 2006 C. Robinson

Math Final December 2006 C. Robinson Math 285-1 Final December 2006 C. Robinson 2 5 8 5 1 2 0-1 0 1. (21 Points) The matrix A = 1 2 2 3 1 8 3 2 6 has the reduced echelon form U = 0 0 1 2 0 0 0 0 0 1. 2 6 1 0 0 0 0 0 a. Find a basis for the

More information

Study Guide for Linear Algebra Exam 2

Study Guide for Linear Algebra Exam 2 Study Guide for Linear Algebra Exam 2 Term Vector Space Definition A Vector Space is a nonempty set V of objects, on which are defined two operations, called addition and multiplication by scalars (real

More information

Control Systems. Laplace domain analysis

Control Systems. Laplace domain analysis Control Systems Laplace domain analysis L. Lanari outline introduce the Laplace unilateral transform define its properties show its advantages in turning ODEs to algebraic equations define an Input/Output

More information

Systems and Control Theory Lecture Notes. Laura Giarré

Systems and Control Theory Lecture Notes. Laura Giarré Systems and Control Theory Lecture Notes Laura Giarré L. Giarré 2018-2019 Lesson 14: Rechability Reachability (DT) Reachability theorem (DT) Reachability properties (DT) Reachability gramian (DT) Reachability

More information

Robust Control 2 Controllability, Observability & Transfer Functions

Robust Control 2 Controllability, Observability & Transfer Functions Robust Control 2 Controllability, Observability & Transfer Functions Harry G. Kwatny Department of Mechanical Engineering & Mechanics Drexel University /26/24 Outline Reachable Controllability Distinguishable

More information

Chapter 3. State Feedback - Pole Placement. Motivation

Chapter 3. State Feedback - Pole Placement. Motivation Chapter 3 State Feedback - Pole Placement Motivation Whereas classical control theory is based on output feedback, this course mainly deals with control system design by state feedback. This model-based

More information

(b) If a multiple of one row of A is added to another row to produce B then det(b) =det(a).

(b) If a multiple of one row of A is added to another row to produce B then det(b) =det(a). .(5pts) Let B = 5 5. Compute det(b). (a) (b) (c) 6 (d) (e) 6.(5pts) Determine which statement is not always true for n n matrices A and B. (a) If two rows of A are interchanged to produce B, then det(b)

More information

Department of Aerospace Engineering AE602 Mathematics for Aerospace Engineers Assignment No. 4

Department of Aerospace Engineering AE602 Mathematics for Aerospace Engineers Assignment No. 4 Department of Aerospace Engineering AE6 Mathematics for Aerospace Engineers Assignment No.. Decide whether or not the following vectors are linearly independent, by solving c v + c v + c 3 v 3 + c v :

More information

The value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N.

The value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N. Math 410 Homework Problems In the following pages you will find all of the homework problems for the semester. Homework should be written out neatly and stapled and turned in at the beginning of class

More information

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2 EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 2 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 5, 2012 Andre Tkacenko

More information

Solutions to Final Practice Problems Written by Victoria Kala Last updated 12/5/2015

Solutions to Final Practice Problems Written by Victoria Kala Last updated 12/5/2015 Solutions to Final Practice Problems Written by Victoria Kala vtkala@math.ucsb.edu Last updated /5/05 Answers This page contains answers only. See the following pages for detailed solutions. (. (a x. See

More information

2.3. VECTOR SPACES 25

2.3. VECTOR SPACES 25 2.3. VECTOR SPACES 25 2.3 Vector Spaces MATH 294 FALL 982 PRELIM # 3a 2.3. Let C[, ] denote the space of continuous functions defined on the interval [,] (i.e. f(x) is a member of C[, ] if f(x) is continuous

More information

Chapter 5 Eigenvalues and Eigenvectors

Chapter 5 Eigenvalues and Eigenvectors Chapter 5 Eigenvalues and Eigenvectors Outline 5.1 Eigenvalues and Eigenvectors 5.2 Diagonalization 5.3 Complex Vector Spaces 2 5.1 Eigenvalues and Eigenvectors Eigenvalue and Eigenvector If A is a n n

More information

EE C128 / ME C134 Final Exam Fall 2014

EE C128 / ME C134 Final Exam Fall 2014 EE C128 / ME C134 Final Exam Fall 2014 December 19, 2014 Your PRINTED FULL NAME Your STUDENT ID NUMBER Number of additional sheets 1. No computers, no tablets, no connected device (phone etc.) 2. Pocket

More information

MTH 5102 Linear Algebra Practice Final Exam April 26, 2016

MTH 5102 Linear Algebra Practice Final Exam April 26, 2016 Name (Last name, First name): MTH 5 Linear Algebra Practice Final Exam April 6, 6 Exam Instructions: You have hours to complete the exam. There are a total of 9 problems. You must show your work and write

More information

Math 1060 Linear Algebra Homework Exercises 1 1. Find the complete solutions (if any!) to each of the following systems of simultaneous equations:

Math 1060 Linear Algebra Homework Exercises 1 1. Find the complete solutions (if any!) to each of the following systems of simultaneous equations: Homework Exercises 1 1 Find the complete solutions (if any!) to each of the following systems of simultaneous equations: (i) x 4y + 3z = 2 3x 11y + 13z = 3 2x 9y + 2z = 7 x 2y + 6z = 2 (ii) x 4y + 3z =

More information

Practice Exam. 2x 1 + 4x 2 + 2x 3 = 4 x 1 + 2x 2 + 3x 3 = 1 2x 1 + 3x 2 + 4x 3 = 5

Practice Exam. 2x 1 + 4x 2 + 2x 3 = 4 x 1 + 2x 2 + 3x 3 = 1 2x 1 + 3x 2 + 4x 3 = 5 Practice Exam. Solve the linear system using an augmented matrix. State whether the solution is unique, there are no solutions or whether there are infinitely many solutions. If the solution is unique,

More information

MATH 235. Final ANSWERS May 5, 2015

MATH 235. Final ANSWERS May 5, 2015 MATH 235 Final ANSWERS May 5, 25. ( points) Fix positive integers m, n and consider the vector space V of all m n matrices with entries in the real numbers R. (a) Find the dimension of V and prove your

More information

The goal of this chapter is to study linear systems of ordinary differential equations: dt,..., dx ) T

The goal of this chapter is to study linear systems of ordinary differential equations: dt,..., dx ) T 1 1 Linear Systems The goal of this chapter is to study linear systems of ordinary differential equations: ẋ = Ax, x(0) = x 0, (1) where x R n, A is an n n matrix and ẋ = dx ( dt = dx1 dt,..., dx ) T n.

More information