Linear Algebra. P R E R E Q U I S I T E S A S S E S S M E N T Ahmad F. Taha August 24, 2015

Similar documents
Module 02 CPS Background: Linear Systems Preliminaries

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

Module 07 Controllability and Controller Design of Dynamical LTI Systems

Module 08 Observability and State Estimator Design of Dynamical LTI Systems

Problem 1 Cost of an Infinite Horizon LQR

Module 03 Linear Systems Theory: Necessary Background

Identification Methods for Structural Systems

1. Type your solutions. This homework is mainly a programming assignment.

Constrained Optimization

Example Linear Algebra Competency Test

ECE504: Lecture 8. D. Richard Brown III. Worcester Polytechnic Institute. 28-Oct-2008

Module 02 Control Systems Preliminaries, Intro to State Space

Digital Control Engineering Analysis and Design

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

1. Find the solution of the following uncontrolled linear system. 2 α 1 1

Math 110 (Fall 2018) Midterm II (Monday October 29, 12:10-1:00)

Lecture 18: Optimization Programming

1. Background: The SVD and the best basis (questions selected from Ch. 6- Can you fill in the exercises?)

Modern Control Systems

Time-Invariant Linear Quadratic Regulators Robert Stengel Optimal Control and Estimation MAE 546 Princeton University, 2015

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

Time-Invariant Linear Quadratic Regulators!

Cherry-Picking Control Nodes and Sensors in Dynamic Networks

Optimization Tutorial 1. Basic Gradient Descent

Name Solutions Linear Algebra; Test 3. Throughout the test simplify all answers except where stated otherwise.

Linear System Theory. Wonhee Kim Lecture 1. March 7, 2018

Primal-Dual Interior-Point Methods for Linear Programming based on Newton s Method

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

Linear Algebra Exercises

Module 04 Optimization Problems KKT Conditions & Solvers

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

System Identification by Nuclear Norm Minimization

Full-State Feedback Design for a Multi-Input System

EK102 Linear Algebra PRACTICE PROBLEMS for Final Exam Spring 2016

More on Lagrange multipliers

Modern Optimal Control

CONTROL DESIGN FOR SET POINT TRACKING

Structural and Multidisciplinary Optimization. P. Duysinx and P. Tossings

Control Systems Design, SC4026. SC4026 Fall 2010, dr. A. Abate, DCSC, TU Delft

PARAMETERIZATION OF STATE FEEDBACK GAINS FOR POLE PLACEMENT

Definition (T -invariant subspace) Example. Example

Gradient Descent. Dr. Xiaowei Huang

Semidefinite Programming Duality and Linear Time-invariant Systems

Final A. Problem Points Score Total 100. Math115A Nadja Hempel 03/23/2017

The norms can also be characterized in terms of Riccati inequalities.

Math 5311 Constrained Optimization Notes

to have roots with negative real parts, the necessary and sufficient conditions are that:

Control Systems Design

Continuous Dynamics Solving LTI state-space equations גרא וייס המחלקה למדעי המחשב אוניברסיטת בן-גוריון

ECEN 420 LINEAR CONTROL SYSTEMS. Lecture 6 Mathematical Representation of Physical Systems II 1/67

State Regulator. Advanced Control. design of controllers using pole placement and LQ design rules

Nonlinear Optimization: What s important?

Linear Systems. Class 27. c 2008 Ron Buckmire. TITLE Projection Matrices and Orthogonal Diagonalization CURRENT READING Poole 5.4

Subject: Optimal Control Assignment-1 (Related to Lecture notes 1-10)

Control Systems Design, SC4026. SC4026 Fall 2009, dr. A. Abate, DCSC, TU Delft

Chapter 3. LQ, LQG and Control System Design. Dutch Institute of Systems and Control

ECE 388 Automatic Control

UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems

Homework sheet 4: EIGENVALUES AND EIGENVECTORS. DIAGONALIZATION (with solutions) Year ? Why or why not? 6 9

Diagonalization of Matrix

EE C128 / ME C134 Final Exam Fall 2014

4/3/2018 SECOND MIDTERM Math 21b, Spring Name:

Stability lectures. Stability of Linear Systems. Stability of Linear Systems. Stability of Continuous Systems. EECE 571M/491M, Spring 2008 Lecture 5

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τ

EE363 homework 7 solutions

1 Continuous-time Systems

Eigenspaces. (c) Find the algebraic multiplicity and the geometric multiplicity for the eigenvaules of A.

Contents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2

ẋ 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)

An Introduction to Correlation Stress Testing

Interior Point Methods. We ll discuss linear programming first, followed by three nonlinear problems. Algorithms for Linear Programming Problems

E5295/5B5749 Convex optimization with engineering applications. Lecture 5. Convex programming and semidefinite programming

Module 06 Stability of Dynamical Systems

ECE580 Partial Solution to Problem Set 3

MATH2070 Optimisation

Linear System Theory

Semidefinite Programming

Interior-Point Methods for Linear Optimization

CSL361 Problem set 4: Basic linear algebra

Discussion on: Measurable signal decoupling with dynamic feedforward compensation and unknown-input observation for systems with direct feedthrough

EE C128 / ME C134 Midterm Fall 2014

2.098/6.255/ Optimization Methods Practice True/False Questions

Question: Total. Points:

Diagonalization. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

OPTIMAL CONTROL. Sadegh Bolouki. Lecture slides for ECE 515. University of Illinois, Urbana-Champaign. Fall S. Bolouki (UIUC) 1 / 28

Part 4: Active-set methods for linearly constrained optimization. Nick Gould (RAL)

Matrix Mathematics. Theory, Facts, and Formulas with Application to Linear Systems Theory. Dennis S. Bernstein

HOSTOS COMMUNITY COLLEGE DEPARTMENT OF MATHEMATICS

Family Feud Review. Linear Algebra. October 22, 2013

Numerical optimization. Numerical optimization. Longest Shortest where Maximal Minimal. Fastest. Largest. Optimization problems

Full State Feedback for State Space Approach

An Introduction to Algebraic Multigrid (AMG) Algorithms Derrick Cerwinsky and Craig C. Douglas 1/84

Mathematical Methods for Engineers 1 (AMS10/10A)

I.3. LMI DUALITY. Didier HENRION EECI Graduate School on Control Supélec - Spring 2010

Homework 5. Convex Optimization /36-725

Remark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

Intro. Computer Control Systems: F8

Solution to Final, MATH 54, Linear Algebra and Differential Equations, Fall 2014

Final: Signal, Systems and Control (BME )

5.) For each of the given sets of vectors, determine whether or not the set spans R 3. Give reasons for your answers.

Transcription:

THE UNIVERSITY OF TEXAS AT SAN ANTONIO EE 5243 INTRODUCTION TO CYBER-PHYSICAL SYSTEMS P R E R E Q U I S I T E S A S S E S S M E N T Ahmad F. Taha August 24, 2015 The objective of this exercise is to assess your knowledge of the course prerequisites. This will give me a good indication of your background. You are not supposed to do so much work for this assignment it s only assessment, remember! You will receive a perfect grade whether you know the answers to the questions or not. I ll read your solutions and try to fill the corresponding gaps in class. Many of the answers to following problems can be easily found online or can be computed using MATLAB. Please do not consult with any online references or computational software tools! If you do not know the answer to any of the questions, leave it blank you re getting credit anyway. Linear Algebra Show your work. 1. Find the eigenvalues, eigenvectors, and inverse of matrix [ ] 1 4 A =. 3 2 1

2. Write A in the matrix diagonal transformation, i.e., A = TDT 1 D is the diagonal matrix containing the eigenvalues of A. 3. Find the determinant, rank, and null-space set of this matrix: 0 1 2 1 2 1. 2 7 8 2

4. Is there a relationship between the determinant and the rank of a matrix? 5. True or False? Prove or give counter examples. AB = BA for all A and B A and B are invertible (A + B) is invertible 3

Linear Dynamical Systems A state-space representation of a linear, time-invariant (LTI) dynamical system can be represented as follows: ẋ(t) = Ax(t) + Bu(t), x initial = x t0, (1) y(t) = Cx(t) + Du(t), (2) where x(t) is the dynamic state-vector of the LTI system; u(t) is the control input-vector; y(t) is the output, all for the above LTI system; matrices A, B, C, D are constants of appropriate dimensions. 1. What is the closed-form, state solution to the above differential equation for any time-varying control input, i.e., x(t) =? 2. What are the poles of the above dynamical system? Define asymptotic stability. What s the difference between marginal and asymptotic stability? 3. Under what conditions is the above dynamical system controllable? Observable? Stabilizable? Detectable? 4

( 4. What is the transfer function H(s) = Y(s) ) of the above system? U(s) 5. What is the state-transition matrix for the above system? 5

Optimal Control and Dynamic Observers 1. Define the linear quadratic regulator problem for LTI systems in both, words and equations. 2. What is the optimal solution to an optimal control problem? What does it physically mean for CPSs? 3. What is an optimal state-feedback control strategy for linear systems? Define it in words and equations. 6

4. What is a generic dynamic observer? Luenberger observer? Convex Optimization 1. Let f (x) be a multi-variable function of three variables, as follows: f (x 1, x 2, x 3 ) = x 1 x 2 x 3 + 2x2 3 x2 1 4 cos(x 3x 2 ) + log(cos(x 2 ) 2 ) + 4x 3 2x 1. Find the gradient and then the Hessian of f (x). 7

2. What is an optimization problem? An unfeasible, feasible solution, an optimal solution to a generic optimization problem? If you do not know the answer to the above question, you can skip the rest of questions in this section. 3. What is a convex optimization problem? Define it rigorously. Give an example a numerical example, if possible. 8

4. What is a semi-definite program (SDP)? Define it rigorously. 5. Given the following optimization problem, minimize x c(x) subject to h(x) 0 (3) g(x) = 0, what are the corresponding Karush Kuhn Tucker (KKT) conditions? 6. What do you know about convex relaxations of non-convex optimization problems? Please be very explicit. 9