Problem set 5 solutions 1

Similar documents
Hankel Optimal Model Reduction 1

Balanced Truncation 1

L2 gains and system approximation quality 1

Problem Set 5 Solutions 1

Model Reduction for Unstable Systems

Problem Set 4 Solution 1

Robust Multivariable Control

CDS Solutions to the Midterm Exam

6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski. Solutions to Problem Set 1 1. Massachusetts Institute of Technology

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τ

BALANCING-RELATED MODEL REDUCTION FOR DATA-SPARSE SYSTEMS

Problem Set 2 Solutions 1

10 Transfer Matrix Models

Raktim Bhattacharya. . AERO 632: Design of Advance Flight Control System. Norms for Signals and Systems

Zeros and zero dynamics

Model Reduction for Linear Dynamical Systems

Problem Set 4 Solutions 1

Nonlinear Control. Nonlinear Control Lecture # 6 Passivity and Input-Output Stability

6.241 Dynamic Systems and Control

Model reduction for linear systems by balancing

Model reduction of large-scale systems

Fluid flow dynamical model approximation and control

Iterative Rational Krylov Algorithm for Unstable Dynamical Systems and Generalized Coprime Factorizations

Gramians based model reduction for hybrid switched systems

9.5 The Transfer Function

Stability preserving post-processing methods applied in the Loewner framework

Model reduction via tangential interpolation

An iterative SVD-Krylov based method for model reduction of large-scale dynamical systems

On the continuity of the J-spectral factorization mapping

ECE504: Lecture 9. D. Richard Brown III. Worcester Polytechnic Institute. 04-Nov-2008

Mathematics for Control Theory

Control Systems I. Lecture 5: Transfer Functions. Readings: Emilio Frazzoli. Institute for Dynamic Systems and Control D-MAVT ETH Zürich

Introduction to Nonlinear Control Lecture # 4 Passivity

MODEL REDUCTION BY A CROSS-GRAMIAN APPROACH FOR DATA-SPARSE SYSTEMS

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

Krylov Techniques for Model Reduction of Second-Order Systems

Nonlinear Control. Nonlinear Control Lecture # 18 Stability of Feedback Systems

Model reduction of large-scale dynamical systems

Fourier Model Reduction for Large-Scale Applications in Computational Fluid Dynamics

Control Systems Design

Class 13 Frequency domain analysis

EL2520 Control Theory and Practice

Model reduction of interconnected systems

Hankel Optimal Model Order Reduction 1

EE 3054: Signals, Systems, and Transforms Summer It is observed of some continuous-time LTI system that the input signal.

Mapping MIMO control system specifications into parameter space

EEE 184: Introduction to feedback systems

Semidefinite Programming Duality and Linear Time-invariant Systems

This homework will not be collected or graded. It is intended to help you practice for the final exam. Solutions will be posted.

Model Reduction of Inhomogeneous Initial Conditions

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

Denis ARZELIER arzelier

Grades will be determined by the correctness of your answers (explanations are not required).

Problem Set 8 Solutions 1

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

An iterative SVD-Krylov based method for model reduction of large-scale dynamical systems

CDS Solutions to Final Exam

System Identification by Nuclear Norm Minimization

Chris Beattie and Serkan Gugercin

Chapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors

Projection of state space realizations

Lecture 4: Analysis of MIMO Systems

SiMpLIfy: A Toolbox for Structured Model Reduction

Jordan Canonical Form

6 Optimal Model Order Reduction in the Hankel Norm

Lecture 5: Linear Systems. Transfer functions. Frequency Domain Analysis. Basic Control Design.

Grades will be determined by the correctness of your answers (explanations are not required).

Module 4 : Laplace and Z Transform Problem Set 4

Model reduction of large-scale systems by least squares

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

Fourier Series for Accurate, Stable, Reduced-Order Models for Linear CFD Applications.

Method of unsteady aerodynamic forces approximation for aeroservoelastic interactions

EECS C128/ ME C134 Final Thu. May 14, pm. Closed book. One page, 2 sides of formula sheets. No calculators.

Step Response Analysis. Frequency Response, Relation Between Model Descriptions

Module 02 CPS Background: Linear Systems Preliminaries

An Interpolation-Based Approach to the Optimal H Model Reduction

Control Systems. Laplace domain analysis

Exam. 135 minutes + 15 minutes reading time

Lecture 13: H(s) Poles-Zeros & BIBO Stability. (a) What are poles and zeros? Answer: HS math and calculus review.

CME 345: MODEL REDUCTION

Model Order Reduction via Matlab Parallel Computing Toolbox. Istanbul Technical University

Chapter 5. Standard LTI Feedback Optimization Setup. 5.1 The Canonical Setup

Lecture 3. Chapter 4: Elements of Linear System Theory. Eugenio Schuster. Mechanical Engineering and Mechanics Lehigh University.

Subspace-based Identification

Control Systems I. Lecture 9: The Nyquist condition

H 2 -optimal model reduction of MIMO systems

GATE EE Topic wise Questions SIGNALS & SYSTEMS

6.241 Dynamic Systems and Control

A Simple Derivation of Right Interactor for Tall Transfer Function Matrices and its Application to Inner-Outer Factorization Continuous-Time Case

Control Systems I. Lecture 9: The Nyquist condition

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

Transform Solutions to LTI Systems Part 3

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM. COURSE: ECE 3084A (Prof. Michaels)

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Mechanical Engineering Dynamics and Control II Fall K(s +1)(s +2) G(s) =.

Massachusetts Institute of Technology

Spline Interpolation Based PMOR

1 + z 1 x (2x y)e x2 xy. xe x2 xy. x x3 e x, lim x log(x). (3 + i) 2 17i + 1. = 1 2e + e 2 = cosh(1) 1 + i, 2 + 3i, 13 exp i arctan

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

2.161 Signal Processing: Continuous and Discrete Fall 2008

Lecture 9 Infinite Impulse Response Filters

Transcription:

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.242, Fall 24: MODEL REDUCTION Problem set 5 solutions Problem 5. For each of the stetements below, state if it is true or false. For false statements, give a counterexample. For correct statements, give a brief sketch of a proof. (a) H-Infinity norm of system with transfer function is not smaller than D. H(s) = D + C(sI A) B True. Since H(jω) D as ω, the supremum of H(jω) is not smaller than D. (b) If A, B, C, D are matrices of dimensions n-by-n, n-by-, -by-n, and - c A. Megretski, 24 Version of November 2, 24.

2 by- respectively, and matrices M c = [ B AB A 2 B... A n B, M o = C CA CA 2. CA n have rank n then order of system with transfer function equals n. H(s) = D + C(sI A) B False. For example, with n = 3, A =, B = both matrices M c =, C = [, D =,, M o = have rank n = 2, but H(s) = /s has order. (c) If Aq = for some vector q then lim sc(si s A) B = Cq. False. For example, with A =, B = C =, q = 2, we have Cq = 2 but sc(si A) B as s. (d) If A is a Hurwitz matrix, and matrix V is such that V V = I then V AV is a Hurwitz matrix as well.

3 False. For example, if A = [ [, V = then A is a Hurwitz matrix, and V V =, but V AV = is not a Hurwitz matrix. (e) If A is a Hurwitz matrix, the pair (A, B) is controllable, the pair (C, A) is observable, and W > is a diagonal matrix such that AW + WA = BB, WA + A W = C C, then A <, where A is the upper left corner element of A. False. for example, if [ A =.5 [, B = then all conditions are satisfied, but A =., C = [ [, W = (f) If a proper rational transfer function G = G(s) without poles in the closed right half plane satisfies G(jω) for all ω R, all Hankel singular numbers of G are not larger than., True. Since G can be approximated by (a zero order transfer function) with H- Infinity norm of the modeling error not larger than one, the largest Hankel singular number of G, which is a lower bound for such error, must be not larger than. Problem 5.2 What is the order of the LTI system with transfer matrix [ /(s + ) /(s + 2) H(s) =? /(s + 3) /(s + 3) The system has order 3. Indeed, the system has state space model with [ A = 2, B =, C =, D =, 3

4 which is both controllable and observable. Problem 5.3 Knowing that G(jω) = +j for ω =, G() =, G( ) = 5, and G( ) = 4, what is the best lower bound of the H-Infinity norm of a rational function G? The best lower bound is 4. Indeed, since the points, j, are on the extended imaginary axis, the H-Infinity norm cannot be smaller than any of the numbers + j = 2,, 4. On the other hand, transfer function G(s) = 6(s2 + )(s + ) 5s(s2 + ) s(s + )(4 + 38s) + + 4s(s2 + )(s + ) (s + 2) 4 2(s + 2) 4 (s + 2) 5 (s + 2) 4 satisfies all interpolation constraints, and its H-Infinity norm is exactly 4. Problem 5.4 Find L2 gain of the system which maps scalar inputs f(t) into outputs y(t) = f(t )/( + t 2 + f(t ) 2 ). The L2 gain equals zero. To see this, note that the system is a series connection of delay by, f(t) g(t) = f(t ) and a memoryless system g(t) y(t) = g(t)/( + t 2 + g(t) 2 ). Note that the delay has L2 gain. Also, since the maximal possible value of y(t) / g(t) converges to zero as t, L2 gain of the memoryless block equals zero. Hence the overall L2 gain is zero. Problem 5.5 A, B, C, D are matrices of dimensions n-by-n, n-by-, -by-n, and -by- respectively, such that CA 3 B = and matrix UV, where [ C U = CA, V = [ B A B,

5 is not singular. Is this information sufficient to find ĈÂ 3 ˆB, where Ĉ = CV, ˆB = UB, Â = UAV? The information is not sufficient. Problem 5.6 What is the value of the 7th largest Hankel singular value of H(s) = (s 2 2s + 2) 5 /(s 2 + 2s + 2) 5? Since H is a stable all-pass tranfer function of th order, all of its ten positive singular numbers are equal to. Problem 5.7 A fifth order transfer function Ĝ is obtained by applying the standard balanced truncation algorithm to a seventh order transfer function G which has Hankel singular numbers 7, 6, 5, 4, 3, 2,. What are the Hankel singular numbers of Ĝ? What is the range of possible values of G Ĝ? The Hankel singular numbers of Ĝ are the 5 largest singular numbers of G, i.e. 7, 6, 5, 4, 3. The range of possible values of G Ĝ is from σ 6 to 2(σ 6 + σ 7 ), i.e. [2, 6.