Introduction to the Hankel -based model order reduction for linear systems D.Vasilyev Massachusetts Institute of Technology, 2004.

Slides:



Advertisements
Similar presentations
PROCESS MODELLING AND MODEL ANALYSIS © CAPE Centre, The University of Queensland Hungarian Academy of Sciences Analysis of Dynamic Process Models C13.
Advertisements

Digital Control Systems Controllability&Observability.
Properties of State Variables
B.Macukow 1 Lecture 12 Neural Networks. B.Macukow 2 Neural Networks for Matrix Algebra Problems.
1 Nonlinear Control Design for LDIs via Convex Hull Quadratic Lyapunov Functions Tingshu Hu University of Massachusetts, Lowell.
Graph Laplacian Regularization for Large-Scale Semidefinite Programming Kilian Weinberger et al. NIPS 2006 presented by Aggeliki Tsoli.
1cs542g-term High Dimensional Data  So far we’ve considered scalar data values f i (or interpolated/approximated each component of vector values.
Similarity transformations  Suppose that we are given a ss model as in (1).  Now define state vector v(t) that is the same order of x(t), such that the.
Some useful linear algebra. Linearly independent vectors span(V): span of vector space V is all linear combinations of vectors v i, i.e.
Curve-Fitting Regression
Multivariable Control Systems
Unconstrained Optimization Problem
1 Lavi Shpigelman, Dynamic Systems and control – – Linear Time Invariant systems  definitions,  Laplace transform,  solutions,  stability.
Modeling in the Time Domain - State-Space
Digital Control Systems
1 Lavi Shpigelman, Dynamic Systems and control – – Linear Time Invariant systems  definitions,  Laplace transform,  solutions,  stability.
1. The Simplex Method.
Table of Contents First note this equation has "quadratic form" since the degree of one of the variable terms is twice that of the other. When this occurs,
1 Linné Flow Centre KTH Mechanics Isaac Newton Institute Workshop 8-12 September, 2008 Dan Henningson collaborators Shervin Bagheri, Espen Åkervik Luca.
Iterative factorization of the error system in Moment Matching and applications to error bounds Heiko Panzer, Thomas Wolf, Boris Lohmann GAMM-Workshop.
CSDA Conference, Limassol, 2005 University of Medicine and Pharmacy “Gr. T. Popa” Iasi Department of Mathematics and Informatics Gabriel Dimitriu University.
Least SquaresELE Adaptive Signal Processing 1 Method of Least Squares.
Method of Least Squares. Least Squares Method of Least Squares:  Deterministic approach The inputs u(1), u(2),..., u(N) are applied to the system The.
A more reliable reduction algorithm for behavioral model extraction Dmitry Vasilyev, Jacob White Massachusetts Institute of Technology.
Chapter 7 Stability and Steady-State Error Analysis
Professor Walter W. Olson Department of Mechanical, Industrial and Manufacturing Engineering University of Toledo Transfer Functions.
A TBR-based Trajectory Piecewise-Linear Algorithm for Generating Accurate Low-order Models for Nonlinear Analog Circuits and MEMS Dmitry Vasilyev, Michał.
Introductory Control Theory. Control Theory The use of feedback to regulate a signal Controller Plant Desired signal x d Signal x Control input u Error.
Professor Walter W. Olson Department of Mechanical, Industrial and Manufacturing Engineering University of Toledo Observers/Estimators …  bnbn b n-1 b2b2.
Perturbation analysis of TBR model reduction in application to trajectory-piecewise linear algorithm for MEMS structures. Dmitry Vasilyev, Michał Rewieński,
Lecture 7: State-Space Modeling 1.Introduction to state-space modeling Definitions How it relates to other modeling formalisms 2.State-space examples 3.Transforming.
Motivation For analytical design of control systems,
1  Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
CHAPTER 10 Widrow-Hoff Learning Ming-Feng Yeh.
BART VANLUYTEN, JAN C. WILLEMS, BART DE MOOR 44 th IEEE Conference on Decision and Control December 2005 Model Reduction of Systems with Symmetries.
1 Espen Åkervik 7 th ERCOFTAC SIG33 WORKSHOP Low dimensional model for control of the Blasius boundary layer by balanced truncation Espen Åkervik in collaboration.
2/25/2001Industrial Process Control1 Dynamic Matrix Control - Introduction Developed at Shell in the mid 1970’s Evolved from representing process dynamics.
Textbook and Syllabus Textbook: Syllabus:
Optimization of Nonlinear Singularly Perturbed Systems with Hypersphere Control Restriction A.I. Kalinin and J.O. Grudo Belarusian State University, Minsk,
(COEN507) LECTURE III SLIDES By M. Abdullahi
DEPARTMENT OF MECHANICAL TECHNOLOGY VI -SEMESTER AUTOMATIC CONTROL 1 CHAPTER NO.6 State space representation of Continuous Time systems 1 Teaching Innovation.
Singular Systems Differential Algebraic Equations Introduction Systems & Control Theory Chemical Engineering & DAE Index for DAE Optimal Control Directions.
Nonlinear balanced model residualization via neural networks Juergen Hahn.
Eigenvalues, Zeros and Poles
EE611 Deterministic Systems Controllability and Observability of Continuous-time Systems Kevin D. Donohue Electrical and Computer Engineering University.
EE611 Deterministic Systems Multiple-Input Multiple-Output (MIMO) Feedback Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
EE611 Deterministic Systems State Observers Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Time Domain Analysis of Linear Systems Ch2
CEN352 Dr. Nassim Ammour King Saud University
The minimum cost flow problem
CHE 391 T. F. Edgar Spring 2012.
Mathematical Descriptions of Systems
Least Squares Approximations
Nuclear Norm Heuristic for Rank Minimization
CSE 245: Computer Aided Circuit Simulation and Verification
Least Squares Approximations
Multirate Output Feedback
§1-2 State-Space Description
Digital and Non-Linear Control
8. Stability, controllability and observability
Stability Analysis of Linear Systems
Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 – 14, Tuesday 8th November 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR)
Homework 3: Transfer Function to State Space
Recursively Adapted Radial Basis Function Networks and its Relationship to Resource Allocating Networks and Online Kernel Learning Weifeng Liu, Puskal.
Maths for Signals and Systems Linear Algebra in Engineering Lecture 6, Friday 21st October 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Observer Design & Output Feedback
Homework 3: Transfer Function to State Space
Unfolding with system identification
Linear Time Invariant systems
Presentation transcript:

Introduction to the Hankel -based model order reduction for linear systems D.Vasilyev Massachusetts Institute of Technology, 2004

State-space description MIMO LTI CT dynamical system: Here we assume a system to be stable, i.e matrix A is Hurwitz.

Model order reduction problem G(s) (original) G r (s) (reduced) + - Problem: find a dynamical system G r (s) of a smaller degree q (McMillan degree – size of a minimal realization), such that the error of approximation e is “small” over all inputs! u(t) y r (t) y(t) e(t) Question: small in what sense??

Signals/system norms t u L 2 – space of square-summable functions with 2- norm, or energy: LTI system, as a linear operator on this space, has an induced 2-norm (maximum energy amplification, or L 2 gain), which equals H-infinity-norm of a system’s transfer function: Now we know how to state our problem!

Model order reduction problem G(s) (original) G r (s) (reduced) + - Problem formulation: find G r (s) of a smaller degree that minimizes u(t) y r (t) y(t) e(t) Unfortunately, we cannot solve this problem  Instead, we use another system norm.

Hankel operator LTI SYSTEM X (state) t u t y Hankel operator Past input (u(t>0)=0) Future output Hankel operator: - maps past inputs to future system outputs - ignores any system response before time 0. - Has finite rank (connection only by the state at t=0) - As an operator on L 2 it has an induced norm (energy amplification)!

Hankel optimal MOR G(s) (original) G r (s) (reduced) + - u(t) y r (t) y(t) e(t) Problem formulation: find G r (s) of a smaller degree that minimizes (Hankel norm of an error) This problem has been solved and explicit algorithm is given for state-space LTI systems in Glover[84].

Controllability/observability LTI SYSTEM X (state) t u t y Hankel operator Past input Future output P (controllability) Which states are easier to reach? Q (observability) Which states produces more output? Since we are interested in Hankel norm, we need to know how energy is transferred between input, state and output

Observability X (0) t y Future output How much energy in the output we shall observe if the system is released from some state x(0) ? Observability Gramian Satisfies Lyapunov equation: A T Q +QA = -C T C Q is SPD iff system is observable

Controllability X (0) Past input What is the minimal energy of input signal needed to drive system to the state x(0)? Controllability Gramian Satisfies Lyapunov equation: t u State AP + PA T = -BB T P is SPD iff system is controllable

Side note about Lyapunov equations Assume some LTI CT system: AP + PA ′ = -R, R - hermitian This equation has a unique solution P=P ′ if and only if: Moreover, if R is SPD and A is Hurwitz, then P is SPD. Lyapunov function: V(x)=x’Px >0 (reformulation of stability criterion)

Hankel singular values X (state) t u t y Hankel operator - This operator has finite rank (equal to degree of G). Hankel singular values are square roots of an eigenvalues of the product PQ - If we approximate this operator by different one with lower rank, we cannot do better in the Hankel norm than the first removed HSV: Amazingly, this bound is tight (Adamjan et al., 71)

Truncated balanced reduction Gramians are transformed with the change of basis as a quadratic forms: x → Tx, P → TPT T, Q → T -T QT -1 We can find a basis, in which both gramians are equal and diagonal. Such transformation is called balancing transformation. P = R T RUΣ 2 U T = RQR T T = R T U Σ -1/2 P = Q = diag(σ 1, …, σ n ), σ 1 ≥ … ≥ σ n

Truncated balanced reduction- cont’d In the balanced realization we can perform truncation of the least observable and controllable modes! Truncated system (A 11, B 1, C 1, D) will be stable (if σ q ≠ σ q+1, otherwise stable for almost all T ) and have the following H-infinity error bound: “twice sum of a tail” rule

Truncated balanced reduction vs. Hankel optimal reduction For the balanced truncation procedure we have the following error bounds: TBR is not optimal in terms of the Hankel norm! For the Hankel optimal MOR the following bounds hold:

References: Keith Glover, “All optimal Hankel-norm approximations of linear multivariable systems and their L-infinity error bounds”