L2 gains and system approximation quality 1

Similar documents
Hankel Optimal Model Reduction 1

Problem set 5 solutions 1

Balanced Truncation 1

10 Transfer Matrix Models

ECEN 420 LINEAR CONTROL SYSTEMS. Lecture 2 Laplace Transform I 1/52

6.241 Dynamic Systems and Control

Laplace Transforms and use in Automatic Control

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science : MULTIVARIABLE CONTROL SYSTEMS by A.

ME Fall 2001, Fall 2002, Spring I/O Stability. Preliminaries: Vector and function norms

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

Problem Set 5 Solutions 1

ECE 301 Division 1 Exam 1 Solutions, 10/6/2011, 8-9:45pm in ME 1061.

LTI Systems (Continuous & Discrete) - Basics

Control Systems. Frequency domain analysis. L. Lanari

Lecture 8. Chapter 5: Input-Output Stability Chapter 6: Passivity Chapter 14: Passivity-Based Control. Eugenio Schuster.

Nonlinear Control Systems

Time Response of Systems

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

Problem Set 4 Solution 1

CDS Solutions to the Midterm Exam

Lecture 5: Lyapunov Functions and Storage Functions 1

QUANTITATIVE L P STABILITY ANALYSIS OF A CLASS OF LINEAR TIME-VARYING FEEDBACK SYSTEMS

Modeling and Analysis of Dynamic Systems

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

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

CDS Solutions to Final Exam

Laplace Transform Part 1: Introduction (I&N Chap 13)

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

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

06/12/ rws/jMc- modif SuFY10 (MPF) - Textbook Section IX 1

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

EE 380. Linear Control Systems. Lecture 10

EE Control Systems LECTURE 9

Lecture 10: Singular Perturbations and Averaging 1

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

Problem Set 2 Solutions 1

EC Signals and Systems

EE Homework 12 - Solutions. 1. The transfer function of the system is given to be H(s) = s j j

Identification Methods for Structural Systems

Lecture 4: Analysis of MIMO Systems

Introduction. Performance and Robustness (Chapter 1) Advanced Control Systems Spring / 31

Control Systems. Laplace domain analysis

Volterra/Wiener Representation of Non-Linear Systems

Nonlinear Control Lecture # 14 Input-Output Stability. Nonlinear Control

Prof. Krstic Nonlinear Systems MAE281A Homework set 1 Linearization & phase portrait

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

Lecture 9 Infinite Impulse Response Filters

Convex Optimization 1

Chapter 2: Linear systems & sinusoids OVE EDFORS DEPT. OF EIT, LUND UNIVERSITY

Nonlinear Control Systems

2.161 Signal Processing: Continuous and Discrete Fall 2008

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

Control Systems Design

6.241 Dynamic Systems and Control

Introduction to Nonlinear Control Lecture # 4 Passivity

CONTROL DESIGN FOR SET POINT TRACKING

Introduction to Modern Control MT 2016

Module 4. Related web links and videos. 1. FT and ZT

e st f (t) dt = e st tf(t) dt = L {t f(t)} s

Introduction & Laplace Transforms Lectures 1 & 2

2 Classification of Continuous-Time Systems

Chapter 7 Interconnected Systems and Feedback: Well-Posedness, Stability, and Performance 7. Introduction Feedback control is a powerful approach to o

Math Fall Linear Filters

2.161 Signal Processing: Continuous and Discrete Fall 2008

Linear Filters. L[e iωt ] = 2π ĥ(ω)eiωt. Proof: Let L[e iωt ] = ẽ ω (t). Because L is time-invariant, we have that. L[e iω(t a) ] = ẽ ω (t a).

Raktim Bhattacharya. . AERO 422: Active Controls for Aerospace Vehicles. Dynamic Response

ECE 3620: Laplace Transforms: Chapter 3:

Control Systems I. Lecture 7: Feedback and the Root Locus method. Readings: Jacopo Tani. Institute for Dynamic Systems and Control D-MAVT ETH Zürich

The Laplace Transform

Time Response Analysis (Part II)

Each problem is worth 25 points, and you may solve the problems in any order.

Zeros and zero dynamics

Computing inverse Laplace Transforms.

Analysis of systems containing nonlinear and uncertain components by using Integral Quadratic Constraints

Signals and Systems Chapter 2

Non-linear wave equations. Hans Ringström. Department of Mathematics, KTH, Stockholm, Sweden

EL2520 Control Theory and Practice

An introduction to Mathematical Theory of Control

1 Continuous-time Systems

Problem Weight Score Total 100

2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1

Lecture 29. Convolution Integrals and Their Applications

MAE143 A - Signals and Systems - Winter 11 Midterm, February 2nd

Problem Set 3: Solution Due on Mon. 7 th Oct. in class. Fall 2013

NOTES ON CALCULUS OF VARIATIONS. September 13, 2012

Linear System Theory

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

Notes on uniform convergence

ENGIN 211, Engineering Math. Laplace Transforms

2.161 Signal Processing: Continuous and Discrete Fall 2008

Discrete and continuous dynamic systems

1. The Transition Matrix (Hint: Recall that the solution to the linear equation ẋ = Ax + Bu is

GATE EE Topic wise Questions SIGNALS & SYSTEMS

12/20/2017. Lectures on Signals & systems Engineering. Designed and Presented by Dr. Ayman Elshenawy Elsefy

EE C128 / ME C134 Final Exam Fall 2014

ECE557 Systems Control

20.6. Transfer Functions. Introduction. Prerequisites. Learning Outcomes

Lecture 1 January 5, 2016

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

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

Transcription:

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.242, Fall 24: MODEL REDUCTION L2 gains and system approximation quality 1 This lecture discusses the utility of L2 gains and related measures in assessing quality of system approximation. 3.1 L2 gain and its calculation L2 gain is a popular measure of smallness for system approximation errors and dynamical perturbations. This section covers main definitions and L2 gain calculation methods. 3.1.1 H-Infinity norm and uniform matching of CT LTI system response Consider a causal convolution model of an LTI system, possibly of an infinite order, defined by the impulse response matrix g = g(t) or by a transfer matrix G = G(s). Remember that such system defines the output y as a convolution integral y(t) = h(τ)f(t τ)dτ, where f is assumed to vanish fast enough as t. Let ĝ = ĝ(t) and Ĝ = Ĝ(s) be the impulse response and the transfer matrix of another convolution model, intended to serve as a simplified approximation of the original one. How does one quantify the quality of this approximation? c A. Megretski, 24 1 Version of September 19, 24

2 One common way of measuring approximation quality is by comparing system responses y = y (t) and ŷ = ŷ (t) to a particular testing input f = f (t), as shown on Figure 3.1. G y f Ĝ ŷ e Figure 3.1: Output matching error In particular, the Gaussian f (t) = exp( ρt 2 ) and unit step {, t <, f (t) = u(t) = 1, t, are frequently used as test signals. While comparing time domain responses to special testing inputs is a valuable way of measuring approximation quality, it is usually not easy to justify a particular selection of a test signal, and even more difficult to give a formal proof of benefits of reducing this particular type of approximation error. In this class, when evaluating quality of reduced LTI models, we will be most interested in a matching frequency responses of LTI systems. This leads to the so-called H-Infinity norm of the difference H(s) = G(s) Ĝ(s) as the approximation error measure of choice. Definition Let H = H(s) be the Laplace transform of an impulse response matrix h = h(t) such that h(t) = for t <. The H-Infinity norm of H, denoted by H, is given by H = sup H(s) Re(s)> when H(s) is well defined in the open right half plane, and equals + otherwise. For example, H-Infinity norm of H(s) = 1/(s + a) equals 1/a for a >, and + for a. H-Infinity norm of H(s) = exp( as) equals 1 for a, and is not defined for a < since H is not a transfer function of a causal LTI system in this case. Note that using an H-Infinity model reduction error measure G Ĝ automatically requires exact matching of all unstable poles, because H-Infinity norm of a transfer matrix with a pole in the closed right half plane equals infinity.

3 The following theorem (presented without a proof here) shows the relation between the H-Infinity norm and maximal norm of the frequency response. Theorem 3.1 Let where Then τ k, h(t) = h c (t) + h k δ(t τ k ), k= h k <, k= H = sup H(jω). ω R h(t) dt <. As it follows from the theorem, an important interpretation of the H-Infinity norm is that of a maximal amplification the corresponding LTI system can give to a sinusoidal input. An variety of model reduction error measures can be obtained by using weighted H-Infinity norms, such as W o (G(s) Ĝ(s))W i(s), where W o, W i are given rational transfer matrices without poles in the closed right half plane. 3.1.2 H-Infinity norm as L2 gain A very important characteristic of an input/output system is its L2 gain. Definition A system is said to have finite L2 gain if there exists a γ > such that inf t>t t T { γ 2 f(τ) 2 y(τ) 2 }dτ > for every input/output pair (f, y) and every T R. The infimum of such γ > is called the L2 gain of the system. The fact that a system has finite L2 gain serves well as a definition of stability, and the L2 gain itself can be viewed as a measure of size of a system. For example, the memoryless nonlinear system defined by y(t) = sin(f(t))

4 has L2 gain 1. To prove this, note first that for all ȳ R, and hence τ T sin(ȳ) ȳ { f(t) 2 y(t) 2 }dt for all input/output pairs. This implies that L2 gain is finite and is not larger than 1. On the other hand, for every γ < 1 there exists ǫ > such that sin(ǫ) > γǫ. Since a constant input f(t) ǫ produces a constant output y(t) sin(ǫ), the integral τ T { f(t) 2 y(t) 2 }dt converges to as τ. Another instructive example of L2 gain calculation is for the linear time-varying system defined by y(t) = k(t)f(t), k(t) = e t2. It is tempting to say that L2 gain equals 1, but it is actually equal to zero, since the definition of the L2 gain concerns only with the asymptotic behavior of k = k(t) as t. The following theorems (offered here without a proof) state that, for a causal LTI system, L2 gain equals the H-Infinity norm of the transfer matrix. Theorem 3.2 L2 gain of a causal LTI convolution model equals H-Infinity norm of its transfer matrix. In the following theorem we consider a state space model dx/dt = Ax + Bf, y = Cx + Df, x() not fixed, (3.1) in which every initial condition x() generates an admissible output, so that one input f = f(t) produces many outputs y = y(t). Theorem 3.3 If A is a Hurwitz matrix (i.e. all eigenvalues have negative real part) then L2 gain of system (3.1) equals H-Infinity norm of its transfer matrix H(s) = D + C(sI A) 1 B.

5 In particular, while formally the state space model dx/dt = x + f, y = x, x() not fixed, and the impulse response h(t) = exp( t)u(t) define two different systems H 1 and H 2 (the second has outputs uniquely defined by the inputs, while the first is multi-valued), L2 gain of the difference = H 1 H 2 equals zero, which means that the two systems are equivalent for most practical purposes. 3.1.3 Incremental L2 gain Sometimes L2 gain is too primitive as a measure of model reduction quality. A frequently used alternative is the so-called incremental L2 gain. Definition A system with input f and output y is said to have finite incremental L2 gain if there exists a constant γ such that the inequality {γ 2 f 1 (t) f 2 (t) 2 y 1 (t) y 2 (t) 2 }dt holds for all input/output pairs (f 1, y 1 ) and (f 2, y 2 ) such that f 1 (t) f 2 (t) 2 dt <. The minimal γ satisfying this condition is called the incremental L2 gain of the system. According to the definition, systems with finite incremental gain have a unique output corresponding to each input. It is also easy to see that, for LTI convolution models, the incremental L2 gain equals the usual L2 gain. However, for nonlinear or time-varying systems, these two gains are different. This can be illustrated by the following statement. Theorem 3.4 For a given function φ : R R, (a) L2 gain of system f(t) y(t) = φ(f(t)) equals inf{γ > : φ( f) γ f f R}; (b) incremental L2 gain of system f(t) y(t) = φ(f(t)) equals φ( sup f 1 ) φ( f 2 ) f 1 f 2 f 1 f ; 2

6 (c) L2 gain of system f(t) y(t) = φ(t)f(t) equals lim sup φ(t) ; T + (d) incremental L2 gain of system f(t) y(t) = φ(t)f(t) equals t>t sup φ(t). t R For example, incremental L2 gain of system f(t) f(t) cosf(t) equals infinity, while its L2 gain equals 1. On the other hand, incremental gain of system f(t) exp( t 2 )f(t) equals 1, while its L2 gain equals. 3.2 Small gain theorems Small gain theorems are among the main reasons to minimize model error gains as measures of model reduction quality. The main motivation for the techniques described in this section comes from the following setup. f G Ĝ y ŷ e Figure 3.2: Model reduction error system Let G and Ĝ be the original system and its reduced model, respectively. Let = G Ĝ be the model reduction error system f e, defined by the block diagram on Figure 3.2. Consider the situation when one has to derive properties of a feedback system which has G as a subsystem (the left diagram on Figure 3.3) from the properties of a similar interconnection in which G is replaced by Ĝ (the left diagram on Figure 3.3). Let system H with inputs w, ē and outputs z, f be defined by the block diagram on Figure 3.4. In terms of H and, the system perturbation described on Figure 3.3 has an equivalent description given by Figure 3.5, in which is being replaced by zero. Two major interpretations of quality of a subsystem approximation are as follows:

7 w y S G f z w ŷ S Ĝ ˆf ẑ Figure 3.3: Replacing G by Ĝ in an interconnection w z e S f + ȳ Ĝ Figure 3.4: System H (a) A bound on the L2 gain of the full interconnection system (left block diagrams on Figures 3.3 and 3.5) can be derived from a description of H and a gain bound of ); (b) A bound on the energy z(t) ẑ(t) 2 dt of the output error can be derived from a description of H and an L2 gain bound of ). 3.2.1 Small gain theorem for L2 gain estimation The following theorem, a version of the famous small gain condition, allows one to estimate L2 gain of the full interconnection system (left block diagram on Figure 3.5) by using the information on L2 gains of H and. Theorem 3.5 If L2 gains of H and are not larger than 1 then the feedback interconnection on the left block diagram of Figure 3.5 has L2 gain (from w to z) not larger than 1.

8 w e H f z w H ˆf ẑ Figure 3.5: Replacing by zero in an interconnection Proof Consider the signals consistent with the block diagram. By assumption about, By assumption about H, T inf T> { f 2 e 2 }dt >. inf T> T Adding these two inequalities yields { w 2 + e 2 z 2 f 2 }dt >. T inf T> { w 2 z 2 }dt >. For simplicity, the L2 small gain theorem is formulated for the case of unit L2 gain bounds. By re-scaling inputs and outputs of H, one obtains a more general condition, which applies to the case of arbitrary L2 bound of and the closed loop L2 bound to be proven. 3.2.2 Output matching error estimation Let us say that system with input f and output e has L2 norm not exceeding γ if the inequality y(y) 2 dt γ 2 f(t) 2 dt holds for every input/output pair (f, y) of. Note that a system with a finite L2 norm bound must respond with a zero output to a zero input. Informally speaking, L2 norm bound acts as a stronger version of the familiar L2 gain bound, applicable to systems with zero initial conditions.

9 In order to estimate the energy ẑ(t) z(t) 2 dt of the output matching error ẑ z on Figure 3.5, one can use an incremental L2 gain bound for H, and an L2 norm bound for. Theorem 3.6 For the systems defined by Figure 3.5, assume that the incremental L2 gain of H is not larger than 1, and the L2 norm bound of D is not larger than γ [, 1). Then for every finite energy input w. γ2 z(t) ẑ(t) 2 dt 1 γ 2 ˆf(t) 2 dt Proof Let g 2 denote the energy of signal g. Let signals w, z, e, f, ẑ, ˆf be consistent with the block diagrams on Figure 3.5. By the incremental L2 gain bound imposed on H, By the L2 norm assumption about, By the Cauchy-Schwartz inequality, z ẑ 2 + f ˆf 2 e 2. e 2 γ 2 f 2. γ 2 f 2 f ˆf 2 γ2 1 γ 2 ˆf 2, which implies the desired upper bound for ẑ z 2. This theorem can be used to prove upper bounds of system simulation errors caused by replacing a complex subsystem by its reduced model. The assumptions, in particular, mean that the initial conditions of the error subsystem are set to zero at t =, and the bound is given in terms of the ˆf output of the reduced system H. 3.2.3 Small incremental gain theorem Finding upper bounds for L2 gains of non-linear systems can be quite challenging, even in a low order case. Just as in the case of non-incremental L2 gains, a small gain theorem provides an easy (though not always accurate enough) way for bounding incremental gains of feedback systems.

1 Theorem 3.7 For the system defined by the left block diagram on Figure 3.5, the incremental L2 gain is not larger than 1 whenever the incremental L2 gains of H and are not larger than 1. The proof of this statement is similar to the non-incremental version described earlier in this lecture.