Structure of the Hessian
|
|
- Lilian Wilkerson
- 5 years ago
- Views:
Transcription
1 Structure of the Hessian Graham C. Goodwin September 2004
2 1. Introduction We saw in earlier lectures that a core ingredient in quadratic constrained optimisation problems is the Hessian matrix H. So far we have simply given an in principle approach to the evaluation of this matrix. That is, for a system with state equations x k+1 = Ax k + Bu k, we can compute the Hessian as H=Γ T QΓ+R, whereγ, Q, R.
3 This will be satisfactory for simple problems. However, for more complex problems (for example, high order systems or problems having mixed stable and unstable modes) this brute force approach may fail. A hint as to the source of the difficulties is that the direct way of computing the Hessian depends on powers of the system matrix A. Clearly, if the system has unstable modes, then some entries ofγwill diverge as N increases.
4 We will show in this lecture that this problem can be resolved by focusing attention on the stable and unstable parts of the system separately.
5 2. Separating Stable and Unstable Modes Our eventual goal in this lecture is to gain a better understanding of the structure of the Hessian matrix particularly for large optimisation horizons. However, as mentioned above, the straightforward approach to evaluating the Hessian will often meet difficulties for open loop unstable plants due to exponential divergence of the system impulse response.
6 One way of addressing this problem is to recognise that there is an intimate connection between stability and causality. In particular, a system having all modes unstable becomes stable if viewed in reverse time, that is, as an anti-causal system. This line of reasoning leads to an alternative viewpoint in which unstable modes are treated differently. We show below that this leads to an equivalent problem formulation with a different Hessian having different properties.
7 Consider a discrete time linear system and suppose that it has no eigenvalues on the unit circle. We can then partition the state vector x k R n as [ ] x s x k = k x u, k where the states x s k and xu are associated with the stable and k unstable modes, respectively.
8 We can then factor the state equations into stable and unstable parts as follows: ][ ] ] x s [ ] [ x s As 0 k+1 x u = 0 A k+1 u y k = C x k = [ C s k x u k + [ Bs B u ] [ ] x s C k u x u, k u k, (1) where u k R m and y k R p (p m). The eigenvalues of A s have moduli less than one, and the eigenvalues of A u have moduli greater than one.
9 We can then express the solution of the system equations as k 1 x s k = A s k xs 0 + j=0 A k 1 j s B s u j for k= 1,...,N, (2) N 1 x u k = A (N k) u µ A k 1 j u B u u j for k= 0,...,N 1. (3) j=k x u N µ,
10 We then need an equality constraint that bothµand the sequence of control signals{u 0,...,u N 1 } need to satisfy in order to bring the unstable states back to their correct initial values, that is, N 1 Au N µ A j 1 u B u u j = x u 0. (4) j=0
11 We are thus led to the following equivalent statement of the optimisation problem. P N (x) : V OPT N (x) min V N({x k },{u k },µ), (5) subject to: [ ] x s x k = k x u k k 1 x s k = A s k xs 0 + for k= 0,...,N, j=0 A k 1 j s B s u j for k= 1,...,N, N 1 x u k = A (N k) u µ A k 1 j u B u u j for k= 0,...,N 1, j=k (6)
12 where V N ({x k },{u k },µ) 1 2 [ ] x s x 0 = 0 x u = x, 0 u k U for k= 0,...,N 1, x k X for k= 0,...,N 1, [ ] x s x N = N X µ f X, [ ] x s T [ ] N x s P N + 1 N 1 (x T µ µ k 2 Qx k+ u T k Ru k ). (7) k=0
13 The above formulation of the problem, at the expense of the introduction of the additional optimisation variable µ, avoids exponentially diverging terms in the computation of the Hessian matrix. Thus, at least intuitively, it would seem to be more apposite for studying the structure of the problem for large horizons.
14 3. Numerical Issues in the Computation of the Hessian We represent the time evolution of the system output using the usual vector notation. Thus, let y= [ y T 1 y T 2... y T N] T, u= [ u T 0 u T 1... u T N 1 ] T. (8)
15 where C s A s C s A 2 s Ω s =. C s As N y=(γ s +Γ u ) u+ω } {{ } s x s 0 +Ω uµ, (9) Γ, Γ s = C s B s 0 0 C s A s B s C s B s 0.,..... C s A N 1 s B s C s A N 2 s B s C s B s
16 C u A (N 1) u 0 C u A 1 C u A (N 2) u B u C u A 2 u B u... C u A (N 1) u 0 0 C u A Ω u = u. 1 u B u... C u A (N 2) u, Γ u = C u A 1 u C u A 1 u C u B u B u B u
17 The matrix Γ Γ s +Γ u has the form h 0 h 1 h h (N 1) h 1 h0 h h (N 2).. Γ Γ s +Γ u = h N 1 hn h1 h0. h0 h 1, (10)
18 where{ hk : k= (N 1),...,N 1}, is a finite subsequence of the infinite sequence{ hk : k=,..., } defined by { hk : k= 0,..., } {C s B s, C s A s B s, C s A 2 s B s,...}, (11) { hk : k= 1,..., } { C u A 1 u B u, C u A 2 u B u, C u A 3 u B u,...}. (12)
19 Consider, P= Q and Q= C T C and R=ρI m > 0. V N as follows 1 : V N (x, u, y,µ)= 1 2 (xt Qx+ y T y+ρu T u). 1 We keep the function V N but change its arguments as appropriate.
20 V N (x, u,µ)= 1 2 [ x T Qx+ ( Γu+Ω s x s 0 +Ω uµ ) T( Γu+Ω s x s 0 +Ω uµ ) +ρu T u ] = 1 2 ut [ Γ T Γ+ρI]u+u T Γ T( Ω s x s 0 +Ω uµ ) + 1 ( Ωs x s 0 2 +Ω uµ ) T( Ωs x s 0 +Ω uµ ). (13)
21 With respect to the new optimisation variables (u, µ), the modified Hessian of the quadratic objective function is ] [ Γ H T Γ+ρI Γ T Ω u Ω T Γ u Ω T. (14) uω u
22 For future use, we extract the left-upper submatrix, which we call the regularised sub-hessian : H N Γ T Γ+ρI. (15)
23 The above problem formulation has the ability to ameliorate the numerical difficulties encountered when dealing with unstable plants. Indeed, we see that all terms depend only on exponentially decaying quantities.
24 Example Consider a single input-single output system with stable and unstable modes defined via the following matrices: A s = [ ] , B 1 0 s = [ ] 1, C 0 s = [ ] , and A u = 2, B u = 1, C u = 1.
25 we take Q= [ C s C u ] T [ Cs C u ], R= 0.1, P= Q. We consider input constraints of the form u k 1and no state constraints.
26 Standard Hessian Modified Hessian Condition number Horizon N Figure: Condition number of the modified Hessian (14) (circle-dashed line) and that of the standard Hessian (plus-solid line).
27 90 80 Modified Hessian Standard Hessian 70 Objective function value Horizon N Figure: Comparison of the objective function value for different prediction horizons: values achieved using the modified Hessian (circle-dashed line) and using the standard Hessian (plus-solid line).
28 4. Revision of System Frequency Response Consider again the system split into stable and unstable parts. The system transfer function is clearly where G(z)=G s (z)+g u (z), (16) G s (z)=c s (zi A s ) 1 B s, (17) G u (z)=c u (zi A u ) 1 B u, (18)
29 We will study properties of the frequency response of, G(e jω ), via its singular value decomposition [SVD], which has the form G(e jω )=U(e jω )Σ(ω)V H (e jω ). (19) where, U and V are matrices containing the left and right singular vectors of G, satisfying U C p p, U H U= UU H = I p, V C m m, V H V= VV H = I m, and Σ(ω)=diag{σ 1 (ω),...,σ m (ω)}, (20)
30 Lemma Let Ḡ(z) be the two-sided Z-transform of the sequence { hk : k=,..., } embedded in Γ. Then Ḡ(z) is given by Ḡ(z)=zG(z), (21) where G(z) is the system transfer function. Moreover, the region of convergence of Ḡ(z) is given by max{ λ i (A s ) }< z <min{ λ i (A u ) }, where{λ i ( )} is the set of eigenvalues of the corresponding matrix. Proof: By direct calculation.
31 5. Connecting the Singular Values of the Regularised Sub-Hessian to the System Frequency Response We show that there is a direct connection between the singular values of HN, for large N, and the system frequency response.
32 The result of the previous Lemma ensures that given anyε>0 there exists k 0 > 0 such that Ḡ(e jω ) k hk e jωk <ε for all w [ π,π], (22) k= k 0 since the sequence { hk } contains only exponentially decaying terms. 2
33 Recall the structure of Γ and using the definition ofψ l given above, we see that the regularised sub-hessian can be written as X Ψ 2k0... Ψ 0... Ψ 2k H N = ρi, Ψ 2k0... Ψ 0... Ψ 2k X 2 provided N (4k 0 + 1)m. Also, X 1 and X 2 are appropriate submatrices. (23)
34 Consider the Nm m matrix E N,ω [ e 1 N,ω em N,ω ] 1 N Ē N,ω V(e jω ), (24) where I m e jω I m Ē N,ω, ω= 2π l forl {0,...,N 1}.. N e j(n 1)ω I m
35 Consider the discrete time linear system, and the SVD of its frequency response. Let k 0 > 0 be such that the tails of the impulse response are negligible. Consider HN for N 4k and ρ=0, which is the regularised sub-hessian of the quadratic objective function V N withρ=0. Then, for every given frequency ω 0 = 2π N 0 l 0,l 0 {0,...,N 0 1}, we have that lim HN e i 2 N N,ω 0 =σ 2 i (ω 0) for i= 1,...,m, N 0 where e i N,ω 0 is the ith column of E N,ω0 defined in (24), and N/N 0 {1, 2,...}.
36 Proof The key idea is to note that the inner sub-matrix of HN has a simple shift structure which allows one to easily apply Fourier methods. We then simply have to bound the end effects due to the other terms.
37 Corollary Consider the same conditions of the above Theorem and choose ρ>0. Then lim HN e i 2 N N,ω 0 =σ 2 i (ω 0)+ρ for i= 1,...,m, (25) N 0 where N/N 0 {1, 2,...}.
38 Example Consider a 2 input-2 output system with stable and unstable modes defined via the following matrices. A s = [ ] , B 1 0 s = [ ] 1 0, C 0 0 s = [ ] , and A u = 2, B u = [ 0 1 ], C u = [ ]
39 Consider the finite horizon optimal control problem (5) (7) and select Q= [ C s C u ] T [ Cs C u ], R= 0, P= Q.
40 ω [rad/sec] (a)σ 1 (w) ω [rad/sec] (b)σ 2 (w) 2 Figure: Singular values of the regularised sub-hessian HN (circles) with N = 61. The continuous lines represent the square of the two principal gains of the system.
41 ω [rad/sec] (a)σ 1 (w) ω [rad/sec] (b)σ 2 (w) 2 Figure: Singular values of the regularised sub-hessian HN (circles) with N= 401. The continuous lines represent the square of the two principal gains of the system.
42 6. Discussion In this lecture, we have seen: (i) Numerical conditioning of the Hessian can be improved by solving the stable part in forward time and the unstable part in reverse time. This exploits the connection between stability and causality. (ii) That the singular values of HN converge to the Frequency Domain Principle gains of the system.
Cross Directional Control
Cross Directional Control Graham C. Goodwin Day 4: Lecture 4 16th September 2004 International Summer School Grenoble, France 1. Introduction In this lecture we describe a practical application of receding
More informationOn-off Control: Audio Applications
On-off Control: Audio Applications Graham C. Goodwin Day 4: Lecture 3 16th September 2004 International Summer School Grenoble, France 1 Background In this lecture we address the issue of control when
More informationGaussian Elimination without/with Pivoting and Cholesky Decomposition
Gaussian Elimination without/with Pivoting and Cholesky Decomposition Gaussian Elimination WITHOUT pivoting Notation: For a matrix A R n n we define for k {,,n} the leading principal submatrix a a k A
More informationAsymptotic behaviour of Toeplitz matrix in multi-input multi-output model predictive control
23 European Control Conference ECC) July 7-9, 23, Zürich, Switzerland Asymptotic behaviour of Toeplitz matrix in multi-input multi-output model predictive control Quang Tran, Leyla Özkan, Jobert Ludlage
More informationLecture 2 INF-MAT : , LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky
Lecture 2 INF-MAT 4350 2009: 7.1-7.6, LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky Tom Lyche and Michael Floater Centre of Mathematics for Applications, Department of Informatics,
More informationProblem Set 3: Solution Due on Mon. 7 th Oct. in class. Fall 2013
EE 56: Digital Control Systems Problem Set 3: Solution Due on Mon 7 th Oct in class Fall 23 Problem For the causal LTI system described by the difference equation y k + 2 y k = x k, () (a) By first finding
More informationLinear-Quadratic-Gaussian (LQG) Controllers and Kalman Filters
Linear-Quadratic-Gaussian (LQG) Controllers and Kalman Filters Emo Todorov Applied Mathematics and Computer Science & Engineering University of Washington Winter 204 Emo Todorov (UW) AMATH/CSE 579, Winter
More informationStability of Parameter Adaptation Algorithms. Big picture
ME5895, UConn, Fall 215 Prof. Xu Chen Big picture For ˆθ (k + 1) = ˆθ (k) + [correction term] we haven t talked about whether ˆθ(k) will converge to the true value θ if k. We haven t even talked about
More informationCLASSICAL ITERATIVE METHODS
CLASSICAL ITERATIVE METHODS LONG CHEN In this notes we discuss classic iterative methods on solving the linear operator equation (1) Au = f, posed on a finite dimensional Hilbert space V = R N equipped
More informationFull-State Feedback Design for a Multi-Input System
Full-State Feedback Design for a Multi-Input System A. Introduction The open-loop system is described by the following state space model. x(t) = Ax(t)+Bu(t), y(t) =Cx(t)+Du(t) () 4 8.5 A =, B =.5.5, C
More informationSection 3.9. Matrix Norm
3.9. Matrix Norm 1 Section 3.9. Matrix Norm Note. We define several matrix norms, some similar to vector norms and some reflecting how multiplication by a matrix affects the norm of a vector. We use matrix
More informationLecture 9: Discrete-Time Linear Quadratic Regulator Finite-Horizon Case
Lecture 9: Discrete-Time Linear Quadratic Regulator Finite-Horizon Case Dr. Burak Demirel Faculty of Electrical Engineering and Information Technology, University of Paderborn December 15, 2015 2 Previous
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationEE731 Lecture Notes: Matrix Computations for Signal Processing
EE731 Lecture Notes: Matrix Computations for Signal Processing James P. Reilly c Department of Electrical and Computer Engineering McMaster University September 22, 2005 0 Preface This collection of ten
More informationCS168: The Modern Algorithmic Toolbox Lecture #8: How PCA Works
CS68: The Modern Algorithmic Toolbox Lecture #8: How PCA Works Tim Roughgarden & Gregory Valiant April 20, 206 Introduction Last lecture introduced the idea of principal components analysis (PCA). The
More information4F3 - Predictive Control
4F3 Predictive Control - Lecture 2 p 1/23 4F3 - Predictive Control Lecture 2 - Unconstrained Predictive Control Jan Maciejowski jmm@engcamacuk 4F3 Predictive Control - Lecture 2 p 2/23 References Predictive
More informationLecture 2: Discrete-time Linear Quadratic Optimal Control
ME 33, U Berkeley, Spring 04 Xu hen Lecture : Discrete-time Linear Quadratic Optimal ontrol Big picture Example onvergence of finite-time LQ solutions Big picture previously: dynamic programming and finite-horizon
More informationMath (P)refresher Lecture 8: Unconstrained Optimization
Math (P)refresher Lecture 8: Unconstrained Optimization September 2006 Today s Topics : Quadratic Forms Definiteness of Quadratic Forms Maxima and Minima in R n First Order Conditions Second Order Conditions
More informationRegional Solution of Constrained LQ Optimal Control
Regional Solution of Constrained LQ Optimal Control José DeDoná September 2004 Outline 1 Recap on the Solution for N = 2 2 Regional Explicit Solution Comparison with the Maximal Output Admissible Set 3
More informationLecture Notes 3 Convergence (Chapter 5)
Lecture Notes 3 Convergence (Chapter 5) 1 Convergence of Random Variables Let X 1, X 2,... be a sequence of random variables and let X be another random variable. Let F n denote the cdf of X n and let
More information6.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 informationSuppose that we have a specific single stage dynamic system governed by the following equation:
Dynamic Optimisation Discrete Dynamic Systems A single stage example Suppose that we have a specific single stage dynamic system governed by the following equation: x 1 = ax 0 + bu 0, x 0 = x i (1) where
More informationA Necessary and Sufficient Condition for High-Frequency Robustness of Non-Strictly-Proper Feedback Systems
A Necessary and Sufficient Condition for High-Frequency Robustness of Non-Strictly-Proper Feedback Systems Daniel Cobb Department of Electrical Engineering University of Wisconsin Madison WI 53706-1691
More informationLecture 5: Linear Systems. Transfer functions. Frequency Domain Analysis. Basic Control Design.
ISS0031 Modeling and Identification Lecture 5: Linear Systems. Transfer functions. Frequency Domain Analysis. Basic Control Design. Aleksei Tepljakov, Ph.D. September 30, 2015 Linear Dynamic Systems Definition
More informationIntroduction to Signals and Systems Lecture #4 - Input-output Representation of LTI Systems Guillaume Drion Academic year
Introduction to Signals and Systems Lecture #4 - Input-output Representation of LTI Systems Guillaume Drion Academic year 2017-2018 1 Outline Systems modeling: input/output approach of LTI systems. Convolution
More informationMATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018
MATH 57: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 18 1 Global and Local Optima Let a function f : S R be defined on a set S R n Definition 1 (minimizers and maximizers) (i) x S
More informationChapter 13 Z Transform
Chapter 13 Z Transform 1. -transform 2. Inverse -transform 3. Properties of -transform 4. Solution to Difference Equation 5. Calculating output using -transform 6. DTFT and -transform 7. Stability Analysis
More informationSG2221 Wave Motion and Hydrodinamic Stability. MATLAB Project on 2D Poiseuille Flow Alessandro Ceci
SG2221 Wave Motion and Hydrodinamic Stability MATLAB Project on 2D Poiseuille Flow Alessandro Ceci Base Flow 2D steady Incompressible Flow Flow driven by a constant pressure gradient Fully developed flow
More informationModeling and Analysis of Systems Lecture #8 - Transfer Function. Guillaume Drion Academic year
Modeling and Analysis of Systems Lecture #8 - Transfer Function Guillaume Drion Academic year 2015-2016 1 Input-output representation of LTI systems Can we mathematically describe a LTI system using the
More informationFall 2011, EE123 Digital Signal Processing
Lecture 6 Miki Lustig, UCB September 11, 2012 Miki Lustig, UCB DFT and Sampling the DTFT X (e jω ) = e j4ω sin2 (5ω/2) sin 2 (ω/2) 5 x[n] 25 X(e jω ) 4 20 3 15 2 1 0 10 5 1 0 5 10 15 n 0 0 2 4 6 ω 5 reconstructed
More informationVery useful for designing and analyzing signal processing systems
z-transform z-transform The z-transform generalizes the Discrete-Time Fourier Transform (DTFT) for analyzing infinite-length signals and systems Very useful for designing and analyzing signal processing
More informationFrequency-Domain C/S of LTI Systems
Frequency-Domain C/S of LTI Systems x(n) LTI y(n) LTI: Linear Time-Invariant system h(n), the impulse response of an LTI systems describes the time domain c/s. H(ω), the frequency response describes the
More information7.2 Relationship between Z Transforms and Laplace Transforms
Chapter 7 Z Transforms 7.1 Introduction In continuous time, the linear systems we try to analyse and design have output responses y(t) that satisfy differential equations. In general, it is hard to solve
More information2 2 + x =
Lecture 30: Power series A Power Series is a series of the form c n = c 0 + c 1 x + c x + c 3 x 3 +... where x is a variable, the c n s are constants called the coefficients of the series. n = 1 + x +
More informationNotes on Householder QR Factorization
Notes on Householder QR Factorization Robert A van de Geijn Department of Computer Science he University of exas at Austin Austin, X 7872 rvdg@csutexasedu September 2, 24 Motivation A fundamental problem
More informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More informationEECE 460. Decentralized Control of MIMO Systems. Guy A. Dumont. Department of Electrical and Computer Engineering University of British Columbia
EECE 460 Decentralized Control of MIMO Systems Guy A. Dumont Department of Electrical and Computer Engineering University of British Columbia January 2011 Guy A. Dumont (UBC EECE) EECE 460 - Decentralized
More informationMATH 581D FINAL EXAM Autumn December 12, 2016
MATH 58D FINAL EXAM Autumn 206 December 2, 206 NAME: SIGNATURE: Instructions: there are 6 problems on the final. Aim for solving 4 problems, but do as much as you can. Partial credit will be given on all
More informationLecture 10 Linear Quadratic Stochastic Control with Partial State Observation
EE363 Winter 2008-09 Lecture 10 Linear Quadratic Stochastic Control with Partial State Observation partially observed linear-quadratic stochastic control problem estimation-control separation principle
More information4F3 - Predictive Control
4F3 Predictive Control - Lecture 3 p 1/21 4F3 - Predictive Control Lecture 3 - Predictive Control with Constraints Jan Maciejowski jmm@engcamacuk 4F3 Predictive Control - Lecture 3 p 2/21 Constraints on
More informationBalanced 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 informationEE 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 informationEE221A 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 informationMET Workshop: Exercises
MET Workshop: Exercises Alex Blumenthal and Anthony Quas May 7, 206 Notation. R d is endowed with the standard inner product (, ) and Euclidean norm. M d d (R) denotes the space of n n real matrices. When
More informationA Globally Stabilizing Receding Horizon Controller for Neutrally Stable Linear Systems with Input Constraints 1
A Globally Stabilizing Receding Horizon Controller for Neutrally Stable Linear Systems with Input Constraints 1 Ali Jadbabaie, Claudio De Persis, and Tae-Woong Yoon 2 Department of Electrical Engineering
More informationAlgebra C Numerical Linear Algebra Sample Exam Problems
Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric
More informationChapter 7: The z-transform
Chapter 7: The -Transform ECE352 1 The -Transform - definition Continuous-time systems: e st H(s) y(t) = e st H(s) e st is an eigenfunction of the LTI system h(t), and H(s) is the corresponding eigenvalue.
More informationLecture 4 Orthonormal vectors and QR factorization
Orthonormal vectors and QR factorization 4 1 Lecture 4 Orthonormal vectors and QR factorization EE263 Autumn 2004 orthonormal vectors Gram-Schmidt procedure, QR factorization orthogonal decomposition induced
More informationSupplementary Notes March 23, The subgroup Ω for orthogonal groups
The subgroup Ω for orthogonal groups 18.704 Supplementary Notes March 23, 2005 In the case of the linear group, it is shown in the text that P SL(n, F ) (that is, the group SL(n) of determinant one matrices,
More informationEigenvalue Problems in Surface Acoustic Wave Filter Simulations
Eigenvalue Problems in Surface Acoustic Wave Filter Simulations S. Zaglmayr, J. Schöberl, U. Langer FWF Start Project Y-192 3D hp-finite Elements: Fast Solvers and Adaptivity JKU + RICAM, Linz in collaboration
More informationMath Matrix Algebra
Math 44 - Matrix Algebra Review notes - (Alberto Bressan, Spring 7) sec: Orthogonal diagonalization of symmetric matrices When we seek to diagonalize a general n n matrix A, two difficulties may arise:
More informationProf. Dr.-Ing. Armin Dekorsy Department of Communications Engineering. Stochastic Processes and Linear Algebra Recap Slides
Prof. Dr.-Ing. Armin Dekorsy Department of Communications Engineering Stochastic Processes and Linear Algebra Recap Slides Stochastic processes and variables XX tt 0 = XX xx nn (tt) xx 2 (tt) XX tt XX
More informationSome of the different forms of a signal, obtained by transformations, are shown in the figure. jwt e z. jwt z e
Transform methods Some of the different forms of a signal, obtained by transformations, are shown in the figure. X(s) X(t) L - L F - F jw s s jw X(jw) X*(t) F - F X*(jw) jwt e z jwt z e X(nT) Z - Z X(z)
More informationLecture 9 Infinite Impulse Response Filters
Lecture 9 Infinite Impulse Response Filters Outline 9 Infinite Impulse Response Filters 9 First-Order Low-Pass Filter 93 IIR Filter Design 5 93 CT Butterworth filter design 5 93 Bilinear transform 7 9
More informationIntroduction to Nonlinear Control Lecture # 4 Passivity
p. 1/6 Introduction to Nonlinear Control Lecture # 4 Passivity È p. 2/6 Memoryless Functions ¹ y È Ý Ù È È È È u (b) µ power inflow = uy Resistor is passive if uy 0 p. 3/6 y y y u u u (a) (b) (c) Passive
More informationThe Singular Value Decomposition and Least Squares Problems
The Singular Value Decomposition and Least Squares Problems Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo September 27, 2009 Applications of SVD solving
More informationThe Z transform (2) 1
The Z transform (2) 1 Today Properties of the region of convergence (3.2) Read examples 3.7, 3.8 Announcements: ELEC 310 FINAL EXAM: April 14 2010, 14:00 pm ECS 123 Assignment 2 due tomorrow by 4:00 pm
More informationThe following definition is fundamental.
1. Some Basics from Linear Algebra With these notes, I will try and clarify certain topics that I only quickly mention in class. First and foremost, I will assume that you are familiar with many basic
More informationScattered Data Interpolation with Polynomial Precision and Conditionally Positive Definite Functions
Chapter 3 Scattered Data Interpolation with Polynomial Precision and Conditionally Positive Definite Functions 3.1 Scattered Data Interpolation with Polynomial Precision Sometimes the assumption on the
More informationReview of Basic Concepts in Linear Algebra
Review of Basic Concepts in Linear Algebra Grady B Wright Department of Mathematics Boise State University September 7, 2017 Math 565 Linear Algebra Review September 7, 2017 1 / 40 Numerical Linear Algebra
More informationExtreme Values and Positive/ Negative Definite Matrix Conditions
Extreme Values and Positive/ Negative Definite Matrix Conditions James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 8, 016 Outline 1
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 6: January 30, 2018 Inverse z-transform Lecture Outline! z-transform " Tie up loose ends " Regions of convergence properties! Inverse z-transform " Inspection " Partial
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More information10 Transfer Matrix Models
MIT EECS 6.241 (FALL 26) LECTURE NOTES BY A. MEGRETSKI 1 Transfer Matrix Models So far, transfer matrices were introduced for finite order state space LTI models, in which case they serve as an important
More informationEcon Slides from Lecture 8
Econ 205 Sobel Econ 205 - Slides from Lecture 8 Joel Sobel September 1, 2010 Computational Facts 1. det AB = det BA = det A det B 2. If D is a diagonal matrix, then det D is equal to the product of its
More informationEAD 115. Numerical Solution of Engineering and Scientific Problems. David M. Rocke Department of Applied Science
EAD 115 Numerical Solution of Engineering and Scientific Problems David M. Rocke Department of Applied Science Taylor s Theorem Can often approximate a function by a polynomial The error in the approximation
More informationLecture 6 Positive Definite Matrices
Linear Algebra Lecture 6 Positive Definite Matrices Prof. Chun-Hung Liu Dept. of Electrical and Computer Engineering National Chiao Tung University Spring 2017 2017/6/8 Lecture 6: Positive Definite Matrices
More informationOptimal Control. Quadratic Functions. Single variable quadratic function: Multi-variable quadratic function:
Optimal Control Control design based on pole-placement has non unique solutions Best locations for eigenvalues are sometimes difficult to determine Linear Quadratic LQ) Optimal control minimizes a quadratic
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationRobotics. Control Theory. Marc Toussaint U Stuttgart
Robotics Control Theory Topics in control theory, optimal control, HJB equation, infinite horizon case, Linear-Quadratic optimal control, Riccati equations (differential, algebraic, discrete-time), controllability,
More informationDigital Signal Processing Lecture 3 - Discrete-Time Systems
Digital Signal Processing - Discrete-Time Systems Electrical Engineering and Computer Science University of Tennessee, Knoxville August 25, 2015 Overview 1 2 3 4 5 6 7 8 Introduction Three components of
More informationConstrained Linear Quadratic Optimal Control
5 Constrained Linear Quadratic Optimal Control 51 Overview Up to this point we have considered rather general nonlinear receding horizon optimal control problems Whilst we have been able to establish some
More informationNumerical Methods - Numerical Linear Algebra
Numerical Methods - Numerical Linear Algebra Y. K. Goh Universiti Tunku Abdul Rahman 2013 Y. K. Goh (UTAR) Numerical Methods - Numerical Linear Algebra I 2013 1 / 62 Outline 1 Motivation 2 Solving Linear
More informationLinear-Quadratic Optimal Control: Full-State Feedback
Chapter 4 Linear-Quadratic Optimal Control: Full-State Feedback 1 Linear quadratic optimization is a basic method for designing controllers for linear (and often nonlinear) dynamical systems and is actually
More informationControl Systems I. Lecture 7: Feedback and the Root Locus method. Readings: Jacopo Tani. Institute for Dynamic Systems and Control D-MAVT ETH Zürich
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 November 2, 2018 J. Tani, E. Frazzoli (ETH) Lecture 7:
More informationLecture 6 Sept Data Visualization STAT 442 / 890, CM 462
Lecture 6 Sept. 25-2006 Data Visualization STAT 442 / 890, CM 462 Lecture: Ali Ghodsi 1 Dual PCA It turns out that the singular value decomposition also allows us to formulate the principle components
More informationSymmetric Matrices and Eigendecomposition
Symmetric Matrices and Eigendecomposition Robert M. Freund January, 2014 c 2014 Massachusetts Institute of Technology. All rights reserved. 1 2 1 Symmetric Matrices and Convexity of Quadratic Functions
More informationMath 497C Mar 3, Curves and Surfaces Fall 2004, PSU
Math 497C Mar 3, 2004 1 Curves and Surfaces Fall 2004, PSU Lecture Notes 10 2.3 Meaning of Gaussian Curvature In the previous lecture we gave a formal definition for Gaussian curvature K in terms of the
More informationAssignment #10: Diagonalization of Symmetric Matrices, Quadratic Forms, Optimization, Singular Value Decomposition. Name:
Assignment #10: Diagonalization of Symmetric Matrices, Quadratic Forms, Optimization, Singular Value Decomposition Due date: Friday, May 4, 2018 (1:35pm) Name: Section Number Assignment #10: Diagonalization
More informationAn LQ R weight selection approach to the discrete generalized H 2 control problem
INT. J. CONTROL, 1998, VOL. 71, NO. 1, 93± 11 An LQ R weight selection approach to the discrete generalized H 2 control problem D. A. WILSON², M. A. NEKOUI² and G. D. HALIKIAS² It is known that a generalized
More informationState Regulator. Advanced Control. design of controllers using pole placement and LQ design rules
Advanced Control State Regulator Scope design of controllers using pole placement and LQ design rules Keywords pole placement, optimal control, LQ regulator, weighting matrixes Prerequisites Contact state
More informationMath 304 (Spring 2010) - Lecture 2
Math 304 (Spring 010) - Lecture Emre Mengi Department of Mathematics Koç University emengi@ku.edu.tr Lecture - Floating Point Operation Count p.1/10 Efficiency of an algorithm is determined by the total
More informationThe Kalman-Yakubovich-Popov Lemma for Differential-Algebraic Equations with Applications
MAX PLANCK INSTITUTE Elgersburg Workshop Elgersburg February 11-14, 2013 The Kalman-Yakubovich-Popov Lemma for Differential-Algebraic Equations with Applications Timo Reis 1 Matthias Voigt 2 1 Department
More informationTopic # Feedback Control Systems
Topic #17 16.31 Feedback Control Systems Deterministic LQR Optimal control and the Riccati equation Weight Selection Fall 2007 16.31 17 1 Linear Quadratic Regulator (LQR) Have seen the solutions to the
More informationZ-Pencils. November 20, Abstract
Z-Pencils J. J. McDonald D. D. Olesky H. Schneider M. J. Tsatsomeros P. van den Driessche November 20, 2006 Abstract The matrix pencil (A, B) = {tb A t C} is considered under the assumptions that A is
More informationHermite normal form: Computation and applications
Integer Points in Polyhedra Gennady Shmonin Hermite normal form: Computation and applications February 24, 2009 1 Uniqueness of Hermite normal form In the last lecture, we showed that if B is a rational
More informationDigital Control: Part 2. ENGI 7825: Control Systems II Andrew Vardy
Digital Control: Part 2 ENGI 7825: Control Systems II Andrew Vardy Mapping the s-plane onto the z-plane We re almost ready to design a controller for a DT system, however we will have to consider where
More informationDidier HENRION henrion
POLYNOMIAL METHODS FOR ROBUST CONTROL PART I.1 ROBUST STABILITY ANALYSIS: SINGLE PARAMETER UNCERTAINTY Didier HENRION www.laas.fr/ henrion henrion@laas.fr Pont Neuf over river Garonne in Toulouse June
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 7: More on Householder Reflectors; Least Squares Problems Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 15 Outline
More informationChapter 3. LQ, LQG and Control System Design. Dutch Institute of Systems and Control
Chapter 3 LQ, LQG and Control System H 2 Design Overview LQ optimization state feedback LQG optimization output feedback H 2 optimization non-stochastic version of LQG Application to feedback system design
More informationTHE SINGULAR VALUE DECOMPOSITION MARKUS GRASMAIR
THE SINGULAR VALUE DECOMPOSITION MARKUS GRASMAIR 1. Definition Existence Theorem 1. Assume that A R m n. Then there exist orthogonal matrices U R m m V R n n, values σ 1 σ 2... σ p 0 with p = min{m, n},
More informationNumerical Methods for Differential Equations Mathematical and Computational Tools
Numerical Methods for Differential Equations Mathematical and Computational Tools Gustaf Söderlind Numerical Analysis, Lund University Contents V4.16 Part 1. Vector norms, matrix norms and logarithmic
More informationLecture 5 Linear Quadratic Stochastic Control
EE363 Winter 2008-09 Lecture 5 Linear Quadratic Stochastic Control linear-quadratic stochastic control problem solution via dynamic programming 5 1 Linear stochastic system linear dynamical system, over
More informationFinal Exam, Linear Algebra, Fall, 2003, W. Stephen Wilson
Final Exam, Linear Algebra, Fall, 2003, W. Stephen Wilson Name: TA Name and section: NO CALCULATORS, SHOW ALL WORK, NO OTHER PAPERS ON DESK. There is very little actual work to be done on this exam if
More information6 OUTPUT FEEDBACK DESIGN
6 OUTPUT FEEDBACK DESIGN When the whole sate vector is not available for feedback, i.e, we can measure only y = Cx. 6.1 Review of observer design Recall from the first class in linear systems that a simple
More informationAutomatique. A. Hably 1. Commande d un robot mobile. Automatique. A.Hably. Digital implementation
A. Hably 1 1 Gipsa-lab, Grenoble-INP ahmad.hably@grenoble-inp.fr Commande d un robot mobile (Gipsa-lab (DA)) ASI 1 / 25 Outline 1 2 (Gipsa-lab (DA)) ASI 2 / 25 of controllers Signals must be sampled and
More informationCME 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 informationLecture 12: Introduction to Spectral Graph Theory, Cheeger s inequality
CSE 521: Design and Analysis of Algorithms I Spring 2016 Lecture 12: Introduction to Spectral Graph Theory, Cheeger s inequality Lecturer: Shayan Oveis Gharan May 4th Scribe: Gabriel Cadamuro Disclaimer:
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 13
STAT 309: MATHEMATICAL COMPUTATIONS I FALL 208 LECTURE 3 need for pivoting we saw that under proper circumstances, we can write A LU where 0 0 0 u u 2 u n l 2 0 0 0 u 22 u 2n L l 3 l 32, U 0 0 0 l n l
More information18.06 Problem Set 10 - Solutions Due Thursday, 29 November 2007 at 4 pm in
86 Problem Set - Solutions Due Thursday, 29 November 27 at 4 pm in 2-6 Problem : (5=5+5+5) Take any matrix A of the form A = B H CB, where B has full column rank and C is Hermitian and positive-definite
More information