On Dominant Poles and Model Reduction of Second Order Time-Delay Systems
|
|
- Iris Jackson
- 5 years ago
- Views:
Transcription
1 On Dominant Poles and Model Reduction of Second Order Time-Delay Systems Maryam Saadvandi Joint work with: Prof. Karl Meerbergen and Dr. Elias Jarlebring Department of Computer Science, KULeuven ModRed 2010, Berlin December 4, 2010
2 Outline 1 Introduction 2 Frequency Response Function (FRF) 3 Dominant Pole Algorithm (DPA) 4 Subspace Projection 5 Deflation 6 Numerical Results 7 Conclusion On Dominant Poles and MOR of Second Order TDS Maryam Saadvandi
3 Outline 1 Introduction 2 Frequency Response Function (FRF) 3 Dominant Pole Algorithm (DPA) 4 Subspace Projection 5 Deflation 6 Numerical Results 7 Conclusion
4 Introduction Why do we need model order reduction techniques? Size of the original system is too large. Solving the system is time consuming.
5 Introduction Second order dynamical system Large-scale second order dynamical system arise in Electrical circuit simulation Acoustics Vibrating systems Second order dynamical system { Mẍ(t) + Cẋ(t) + Kx(t) = fu(t) y(t) = d x(t)
6 Introduction Second order dynamical system { Mẍ(t) + Cẋ(t) + Kx(t) = fu(t) y(t) = d x(t) Matrices M, C, K R n n x(t), f, d R n Stiffness Matrix Damping Matrix Mass Matrix u(t), y(t) R State Output vector Input vector Output Input
7 Introduction Second order dynamical system { Mẍ(t) + Cẋ(t) + Kx(t) = fu(t) y(t) = d x(t) Second order time-delay systems To improve the stability of system add control term { Mẍ(t) + Cẋ(t) + Kx(t) + Gẋ(t τ) + Fx(t τ) = fu(t) y(t) = d x(t) where G, F R n n : Control matrices τ: delay
8 Outline 1 Introduction 2 Frequency Response Function (FRF) 3 Dominant Pole Algorithm (DPA) 4 Subspace Projection 5 Deflation 6 Numerical Results 7 Conclusion
9 Frequency Response Function (FRF) FRF shows a relation between output and input H(iω) = Y(iω) U(iω) where Y(iω) and U(iω) are the Fourier transforms of y(t) and u(t). FRF is used for Simulation Stability analysis FRF H(iω) : C C H(iω) = d ( ω 2 M + iωc + K + iωge iτω + Fe iτω ) 1 f,
10 Frequency Response Function (FRF) Transfer function s = iω Change frequency domain to time domain Apply Laplace transform under the condition x(0) = 0 H(s) = d (s 2 M + sc + K + sge τs + Fe τs ) 1 f
11 Frequency Response Function (FRF) For simplicity The polynomial eigenvalue problem A(s) = s 2 M + sc + K + sge sτ + Fe sτ, and the derivative of A(s) respect to s is A (s) = 2sM + C + Ge sτ sτge sτ τfe sτ. Time-delay eigenvalue problem (TDEP) (λ i, x i, y i ) are eigentriplets (i N) { A(λi )x i = 0, x i 0 y i A(λ i) = 0, y i 0 Note Poles of FRF eigenvalues of the TDEP
12 Frequency Response Function (FRF) Modal expansion For the case that the system is linear If all eigenvalues are simple, then it is possible to express transfer function as: n R i H(s) =, s λ i where R i are the residues. i=1
13 Frequency Response Function (FRF) Theorem: Modal expansion Consider a system with simple eigenvalues. Suppose there is a sequence of matrices P i, i N such that A(λ) 1 P i =. λ λ i Then, P i = i=1 x i yi, i A (λ i )x i where (λ i, x i, y i ) is an eigentriplet. Moreover, H(s) = d A(s) 1 R i f =, s λ i where R i is called the residue y i=1 R i = (d x i )(yi f ) yi. A (λ i )x i
14 Frequency Response Function (FRF) Weighted residue ρ i is called the weighted residue if ρ i = R i Re(λ i ) where R i is the associated residue of eigenvalue λ i. Dominant pole The pole λ i of H(s) with corresponding weighted residue ρ i is called the dominant pole if and only if for all j i. ρ i > ρ j
15 Frequency Response Function (FRF) Transfer function If all eigenvalues are simple, then it is possible to express transfer function as: R j H(s) =, s λ j where R j are the residues. j=1 Idea Dominant Poles λ 1,..., λ k to be ordered ρ 1 ρ 2 ρ 3 Effective transfer function behavior: k R j H(s) =, s λ j hopefully k n, (λ j, R j ) are ordered by decreasing dominance. j=1
16 Outline 1 Introduction 2 Frequency Response Function (FRF) 3 Dominant Pole Algorithm (DPA) 4 Subspace Projection 5 Deflation 6 Numerical Results 7 Conclusion
17 Dominant Pole Algorithm (DPA) DPA for time-delay system If λ is pole Define lim H(s) =. s λ Q(s) = 1 H(s). Poles of H(s) Roots of Q(s) Apply Newton method for finding root of Q(s) s k+1 = s k Q(s k) Q(s k ) = s k + = s k + d A(s k ) 1 f d A(s k ) 1 A(s k ) A(s k ) 1 f d v k w k A(s k ) v k
18 Dominant Pole Algorithm (DPA) DPATD Input: System (M, C, K, G, F, f, d, τ), initial value s, TOL 1 Output: Dominant pole s, x, y right and left eigenvectors 1 Repeat 2 Solve v C from A(s)v = f 3 Solve w C from A(s) w = c 4 5 x = v v, y = 6 Until w w s = s d v w A (s)v max( A(λ)x, A(λ) y ) < TOL Note DPATD computes only one dominant pole.
19 Outline 1 Introduction 2 Frequency Response Function (FRF) 3 Dominant Pole Algorithm (DPA) 4 Subspace Projection 5 Deflation 6 Numerical Results 7 Conclusion
20 Subspace Projection Subspace projection DPA for TDS (SPDPATD) 1 Solve A(s)v = f and A(s) w = d 2 Let V = orthogonal(v, v), W = orthogonal(w, w)] 3 Petrov-Galerkin leads to projected eigenvalue problem of TDS
21 Subspace Projection Subspace projection DPA for TDS (SPDPATD) 1 Solve A(s)v = f and A(s) w = d 2 Let V = orthogonal(v, v), W = orthogonal(w, w)] 3 Petrov-Galerkin leads to projected eigenvalue problem of TDS eigenvalue problem of TDS ( λ 2 i ( λ 2 i M + λ i C + K + λ Ge λ i τ + F e λ i τ ) x i = 0, x i 0, M + λ i C + K + λ Ge λ i τ + F e λ i τ ) ỹ i = 0, ỹ i 0, where M = W MV, C = W CV, K = W KV, G = W GV, F = W FV
22 Subspace Projection Subspace projection DPA for TDS (SPDPATD) 1 Solve A(s)v = f and A(s) w = d 2 Let V = orthogonal(v, v), W = orthogonal(w, w)] 3 Petrov-Galerkin leads to projected eigenvalue problem of TDS 4 [ Λ, X, Ỹ ] = solve eigenvalue problem 5 [ Λ, X, Ỹ ] = sort the [ Λ, X, Ỹ ] in decreasing R i Re(λ i ) order eigenvalue problem of TDS ( λ 2 i ( λ 2 i M + λ i C + K + λ Ge λ i τ + F e λ i τ ) x i = 0, x i 0, M + λ i C + K + λ Ge λ i τ + F e λ i τ ) ỹ i = 0, ỹ i 0, Note The method for solving second order TDEP based on first order TD
23 Subspace Projection First order time-delay system { (λi E A 0 A 1 e λ i τ ) ϕ i = 0, where[ I 0 E = 0 M (λ i E A 0 A 1 e λ i τ ) ψ i = 0, ] [ 0 I, A 0 = K C ] [ 0 0, A 1 = F G ], where the eigentriplet is ( [ ] [ xi 1/ λi (K λ i, ϕ i =, ψ λ i x i = + F e λ i τ )y i i y i ]).
24 Subspace Projection First order time-delay system { (λi E A 0 A 1 e λ i τ ) ϕ i = 0, (λ i E A 0 A 1 e λ i τ ) ψ i = 0, where the eigentriplet is ( [ xi λ i, ϕ i = λ i x i ] [ 1/ λi (K, ψ i = + F e λ i τ )y i y i ]). equivalent eigentriplet for second order TD (λ i, x i = ϕ i (1 : n, 1), ỹ i = ψ i (n + 1 : 2n, 1)) sort them by largest R i / Re(λ i ).
25 Subspace Projection Subspace projection DPA for TDS (SPDPATD) 1 Solve A(s)v = f and A(s) w = d 2 Let V = orthogonal(v, v), W = orthogonal(w, w)] 3 Petrov-Galerkin leads to projected eigenvalue problem of TDS 4 [ Λ, X, Ỹ ] = solve eigenvalue problem 5 [ Λ, X, Ỹ ] = sort the [ Λ, X, Ỹ ] in decreasing R i Re(λ i ) order 6 Dominant approximate of original system (λ, x, y)
26 Subspace Projection Subspace projection DPA for TDS (SPDPATD) 1 Solve A(s)v = f and A(s) w = d 2 Let V = orthogonal(v, v), W = orthogonal(w, w)] 3 Petrov-Galerkin leads to projected eigenvalue problem of TDS 4 [ Λ, X, Ỹ ] = solve eigenvalue problem 5 [ Λ, X, Ỹ ] = sort the [ Λ, X, Ỹ ] in decreasing R i Re(λ i ) order 6 Dominant approximate of original system (λ, x, y) Approximate eigentriplet of the original problem λ = λ i, x i = V x i, y i = W ỹ i
27 Subspace Projection Subspace projection DPA for TDS (SPDPATD) 1 Solve A(s)v = f and A(s) w = d 2 Let V = [V, v], W = [W, w] and orthogonal V and W 3 Petrov-Galerkin leads to projected eigenvalue problem of TDS 4 [ Λ, X, Ỹ ] = solve eigenvalue problem 5 [ Λ, X, Ỹ ] = sort the [ Λ, X, Ỹ ] in decreasing R i Re(λ i ) order 6 Dominant approximate of original system (λ, x, y) 7 If max( A(λ)x, A(λ) y ) < TOL 8 End (λ, x, y) is dominant triplet X = [X x], Y = [Y y]
28 Subspace Projection Reduced second order time-delay system Keep the right and left dominant eigenvectors in matrices X, Y. { ˆM ˆx(t) + Ĉ ˆx(t) + ˆK ˆx(t) + Ĝ ˆx(t τ) + ˆF ˆx(t τ) = ˆf u(t) ŷ(t) = ˆd ˆx(t) ˆM = Y MX, Ĉ = Y CX, ˆK = Y KX R k k Ĝ = Y GX, ˆF = Y FX R k k ˆf = Y f, ˆd = X d R k 1 k n
29 Outline 1 Introduction 2 Frequency Response Function (FRF) 3 Dominant Pole Algorithm (DPA) 4 Subspace Projection 5 Deflation 6 Numerical Results 7 Conclusion
30 Deflation Why do we need deflation? DPATD computes one dominant pole. SPDPATD computes several dominant poles. Deflation prevents the SPDPATD from recomputing the found dominant poles.
31 Deflation Why do we need deflation? DPATD computes one dominant pole. SPDPATD computes several dominant poles. Deflation prevents the SPDPATD from recomputing the found dominant poles. Idea of deflation λ i is dominant pole residue R i is largest one. R i = (d x i )(y i f ) y i Z (λ i )x i deflation R i = 0 Then we are sure in coming iterations λ i is not dominant anymore. How? Deflation replaces f and d by f and d s.t. y i f = d x i = 0
32 Deflation Modified System { Mẍ(t) + Cẋ(t) + Kx(t) + Gẋ(t τ) + Fx(t τ) = f u(t) y(t) = d x(t) The idea of deflation can be controlled by playing with f and d so that: the residue of the deflated poles become zero the residues of the other poles remain unchanged
33 Deflation Find the formula for deflation We determine a m = [α 1,..., α m ] T and b m = [β 1,..., β m ] T { f (s) = f A(s)X m a m d(s) = d A(s) Y m b m where X m = [x 1, x 2,, x m ], Y m = [y 1, y 2,, y m ] are right and left dominant eigenvectors matrices, so that Y m f (s) = 0 and d (s)x m = 0 These conditions leads to { am = (Y ma(s)x m ) 1 (Y mf ) b m = (Y ma(s)x m ) (X md).
34 Deflation Second condition Theorem: The change of the residue R j corresponding to eigentriplet (λ j, x j, y j ) during the deflation is O(s λ j ).
35 Deflation Second condition Theorem: The change of the residue R j corresponding to eigentriplet (λ j, x j, y j ) during the deflation is O(s λ j ). For proof the Theorem we need following Lemma. Lemma: Let X m and Y m denote the right and left eigenvectors associated with λ 1, λ m, respectively, and (λ j, x j, y j ) be an eigentriplet of the original system with j > m. Then, for s C { Y m A(s)x j = (s λ j )Y ma (λ j )x j + O ( (s λ j ) 2) y j A(s)X m = (s λ j )y j A (λ j )X m + O ( (s λ j ) 2).
36 Deflation Note dominant pole λ i C λ i is also dominant pole. λ i and λ i are counted as one dominant pole. λ i can be deflated.
37 Outline 1 Introduction 2 Frequency Response Function (FRF) 3 Dominant Pole Algorithm (DPA) 4 Subspace Projection 5 Deflation 6 Numerical Results 7 Conclusion
38 Numerical Results The Mass-Spring-Damper [Hu, 1998] x 1 x 2 x n k k k k m m m f c 1 c 2 c 1 c Figure: mass-dual system under the state feedback with time-delay
39 Numerical Results Matrices C = M = diag(m), m: mass, m = 1. c 1 + c 2 c 1 c 1 c 1 + c 2 c 2 c 2 c 1 + c 2 c c 2 c 1 + c 2 c 1 c 1 c 1 + c 2 c 1, c 2 : damper c 1 = 0.4 c 2 = 0.2., K = tridiag( k, 2k, k), k: spring constant, k = 1. f = d = [0,, 0, 1], τ = 2
40 Numerical Results Matrices F = , G =
41 Numerical Results 10 4 Original (n=1000) Reduce (k=2) H(iω) ω x 10 3 Figure: Catching one dominant pole by the DPA successfully, #iteration 4.
42 Numerical Results Original (n=1000) Reduce (k=20) Error ω Figure: 10 dominant poles are matched, #iteration 20.
43 Numerical Results Original (n=1000) Reduce (k=30) Error ω Figure: 15 dominant poles are matched, #iteration 28.
44 Outline 1 Introduction 2 Frequency Response Function (FRF) 3 Dominant Pole Algorithm (DPA) 4 Subspace Projection 5 Deflation 6 Numerical Results 7 Conclusion
45 Conclusion DPATD is based on original matrices. DPATD computes a dominant pole. SPDPATD computes several dominant poles. Deflation prevents the algorithm from recomputing the found dominant pole. Structure of the system is preserved.
46 Conclusion Thank you for your attention!
Computing Transfer Function Dominant Poles of Large Second-Order Systems
Computing Transfer Function Dominant Poles of Large Second-Order Systems Joost Rommes Mathematical Institute Utrecht University rommes@math.uu.nl http://www.math.uu.nl/people/rommes joint work with Nelson
More informationEfficient computation of transfer function dominant poles of large second-order dynamical systems
Chapter 6 Efficient computation of transfer function dominant poles of large second-order dynamical systems Abstract This chapter presents a new algorithm for the computation of dominant poles of transfer
More informationKU Leuven Department of Computer Science
Parametric Dominant Pole Algorithm for Parametric Model Order Reduction Maryam Saadvandi Karl Meerbergen Wim Desmet Report TW 625, March 2013 KU Leuven Department of Computer Science Celestijnenlaan 200A
More informationModel order reduction of large-scale dynamical systems with Jacobi-Davidson style eigensolvers
MAX PLANCK INSTITUTE International Conference on Communications, Computing and Control Applications March 3-5, 2011, Hammamet, Tunisia. Model order reduction of large-scale dynamical systems with Jacobi-Davidson
More informationGramians of structured systems and an error bound for structure-preserving model reduction
Gramians of structured systems and an error bound for structure-preserving model reduction D.C. Sorensen and A.C. Antoulas e-mail:{sorensen@rice.edu, aca@rice.edu} September 3, 24 Abstract In this paper
More informationNumerical Methods for Large Scale Eigenvalue Problems
MAX PLANCK INSTITUTE Summer School in Trogir, Croatia Oktober 12, 2011 Numerical Methods for Large Scale Eigenvalue Problems Patrick Kürschner Max Planck Institute for Dynamics of Complex Technical Systems
More informationEfficient computation of multivariable transfer function dominant poles
Chapter 4 Efficient computation of multivariable transfer function dominant poles Abstract. This chapter describes a new algorithm to compute the dominant poles of a high-order multi-input multi-output
More informationTwo-sided Eigenvalue Algorithms for Modal Approximation
Two-sided Eigenvalue Algorithms for Modal Approximation Master s thesis submitted to Faculty of Mathematics at Chemnitz University of Technology presented by: Supervisor: Advisor: B.sc. Patrick Kürschner
More informationA Multi-Step Hybrid Method for Multi-Input Partial Quadratic Eigenvalue Assignment with Time Delay
A Multi-Step Hybrid Method for Multi-Input Partial Quadratic Eigenvalue Assignment with Time Delay Zheng-Jian Bai Mei-Xiang Chen Jin-Ku Yang April 14, 2012 Abstract A hybrid method was given by Ram, Mottershead,
More informationDynamic Response of Structures With Frequency Dependent Damping
Dynamic Response of Structures With Frequency Dependent Damping Blanca Pascual & S Adhikari School of Engineering, Swansea University, Swansea, UK Email: S.Adhikari@swansea.ac.uk URL: http://engweb.swan.ac.uk/
More informationIdentification Methods for Structural Systems
Prof. Dr. Eleni Chatzi System Stability Fundamentals Overview System Stability Assume given a dynamic system with input u(t) and output x(t). The stability property of a dynamic system can be defined from
More informationChris Beattie and Serkan Gugercin
Krylov-based model reduction of second-order systems with proportional damping Chris Beattie and Serkan Gugercin Department of Mathematics, Virginia Tech, USA 44th IEEE Conference on Decision and Control
More informationBALANCING-RELATED MODEL REDUCTION FOR DATA-SPARSE SYSTEMS
BALANCING-RELATED Peter Benner Professur Mathematik in Industrie und Technik Fakultät für Mathematik Technische Universität Chemnitz Computational Methods with Applications Harrachov, 19 25 August 2007
More informationCONTROL DESIGN FOR SET POINT TRACKING
Chapter 5 CONTROL DESIGN FOR SET POINT TRACKING In this chapter, we extend the pole placement, observer-based output feedback design to solve tracking problems. By tracking we mean that the output is commanded
More informationECE 388 Automatic Control
Controllability and State Feedback Control Associate Prof. Dr. of Mechatronics Engineeering Çankaya University Compulsory Course in Electronic and Communication Engineering Credits (2/2/3) Course Webpage:
More informationIntroduction to Modern Control MT 2016
CDT Autonomous and Intelligent Machines & Systems Introduction to Modern Control MT 2016 Alessandro Abate Lecture 2 First-order ordinary differential equations (ODE) Solution of a linear ODE Hints to nonlinear
More informationApproximation of the Linearized Boussinesq Equations
Approximation of the Linearized Boussinesq Equations Alan Lattimer Advisors Jeffrey Borggaard Serkan Gugercin Department of Mathematics Virginia Tech SIAM Talk Series, Virginia Tech, April 22, 2014 Alan
More informationOutline. Classical Control. Lecture 2
Outline Outline Outline Review of Material from Lecture 2 New Stuff - Outline Review of Lecture System Performance Effect of Poles Review of Material from Lecture System Performance Effect of Poles 2 New
More informationA global Arnoldi method for the model reduction of second-order structural dynamical systems
A global Arnoldi method for the model reduction of second-order structural dynamical systems Thomas Bonin b, Heike Faßbender a, Andreas Soppa,a, Michael Zaeh,b a TU Braunschweig, Carl-Friedrich-Gauß Fakultät,
More informationModel Reduction for Unstable Systems
Model Reduction for Unstable Systems Klajdi Sinani Virginia Tech klajdi@vt.edu Advisor: Serkan Gugercin October 22, 2015 (VT) SIAM October 22, 2015 1 / 26 Overview 1 Introduction 2 Interpolatory Model
More information22.2. Applications of Eigenvalues and Eigenvectors. Introduction. Prerequisites. Learning Outcomes
Applications of Eigenvalues and Eigenvectors 22.2 Introduction Many applications of matrices in both engineering and science utilize eigenvalues and, sometimes, eigenvectors. Control theory, vibration
More informationModel Reduction for Linear Dynamical Systems
Summer School on Numerical Linear Algebra for Dynamical and High-Dimensional Problems Trogir, October 10 15, 2011 Model Reduction for Linear Dynamical Systems Peter Benner Max Planck Institute for Dynamics
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 informationNonlinear Eigenvalue Problems: An Introduction
Nonlinear Eigenvalue Problems: An Introduction Cedric Effenberger Seminar for Applied Mathematics ETH Zurich Pro*Doc Workshop Disentis, August 18 21, 2010 Cedric Effenberger (SAM, ETHZ) NLEVPs: An Introduction
More informationModule 08 Observability and State Estimator Design of Dynamical LTI Systems
Module 08 Observability and State Estimator Design of Dynamical LTI Systems Ahmad F. Taha EE 5143: Linear Systems and Control Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ataha November
More informationThe Finite Element Method for the Analysis of Non-Linear and Dynamic Systems: Thermomechanics
The Finite Element Method for the Analysis of Non-Linear and Dynamic Systems: Thermomechanics Prof. Dr. Eleni Chatzi Dr. Giuseppe Abbiati, Dr. Konstantinos Agathos Lecture 13-14 December, 2017 1 / 30 Forewords
More informationAA242B: MECHANICAL VIBRATIONS
AA242B: MECHANICAL VIBRATIONS 1 / 17 AA242B: MECHANICAL VIBRATIONS Solution Methods for the Generalized Eigenvalue Problem These slides are based on the recommended textbook: M. Géradin and D. Rixen, Mechanical
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 informationIdentification of Damping Using Proper Orthogonal Decomposition
Identification of Damping Using Proper Orthogonal Decomposition M Khalil, S Adhikari and A Sarkar Department of Aerospace Engineering, University of Bristol, Bristol, U.K. Email: S.Adhikari@bristol.ac.uk
More informationModule 03 Linear Systems Theory: Necessary Background
Module 03 Linear Systems Theory: Necessary Background Ahmad F. Taha EE 5243: Introduction to Cyber-Physical Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ taha/index.html September
More informationLinear dynamical systems with inputs & outputs
EE263 Autumn 215 S. Boyd and S. Lall Linear dynamical systems with inputs & outputs inputs & outputs: interpretations transfer function impulse and step responses examples 1 Inputs & outputs recall continuous-time
More informationAutomatic Order Reduction for Finite Element Models
Automatic Order Reduction for Finite Element Models Andreas Greiner, Jan Lienemann, Evgenii Rudnyi, and Jan G. Korvink IMTEK, Albert-Ludwigs-Universität Freiburg Geroges-Köhler-Allee 103, D-79110 Freiburg,
More informationModern Control Systems
Modern Control Systems Matthew M. Peet Illinois Institute of Technology Lecture 18: Linear Causal Time-Invariant Operators Operators L 2 and ˆL 2 space Because L 2 (, ) and ˆL 2 are isomorphic, so are
More informationKrylov Techniques for Model Reduction of Second-Order Systems
Krylov Techniques for Model Reduction of Second-Order Systems A Vandendorpe and P Van Dooren February 4, 2004 Abstract The purpose of this paper is to present a Krylov technique for model reduction of
More informationParametric Model Order Reduction for Linear Control Systems
Parametric Model Order Reduction for Linear Control Systems Peter Benner HRZZ Project Control of Dynamical Systems (ConDys) second project meeting Zagreb, 2 3 November 2017 Outline 1. Introduction 2. PMOR
More informationPH.D. PRELIMINARY EXAMINATION MATHEMATICS
UNIVERSITY OF CALIFORNIA, BERKELEY SPRING SEMESTER 207 Dept. of Civil and Environmental Engineering Structural Engineering, Mechanics and Materials NAME PH.D. PRELIMINARY EXAMINATION MATHEMATICS Problem
More informationProblem Set 5 Solutions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Problem Set 5 Solutions The problem set deals with Hankel
More informationLMI Methods in Optimal and Robust Control
LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 15: Nonlinear Systems and Lyapunov Functions Overview Our next goal is to extend LMI s and optimization to nonlinear
More information1 Continuous-time Systems
Observability Completely controllable systems can be restructured by means of state feedback to have many desirable properties. But what if the state is not available for feedback? What if only the output
More informationLMI Methods in Optimal and Robust Control
LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 4: LMIs for State-Space Internal Stability Solving the Equations Find the output given the input State-Space:
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 informationKrylov Subspace Methods for Nonlinear Model Reduction
MAX PLANCK INSTITUT Conference in honour of Nancy Nichols 70th birthday Reading, 2 3 July 2012 Krylov Subspace Methods for Nonlinear Model Reduction Peter Benner and Tobias Breiten Max Planck Institute
More informationODE Homework 1. Due Wed. 19 August 2009; At the beginning of the class
ODE Homework Due Wed. 9 August 2009; At the beginning of the class. (a) Solve Lẏ + Ry = E sin(ωt) with y(0) = k () L, R, E, ω are positive constants. (b) What is the limit of the solution as ω 0? (c) Is
More informationMODEL REDUCTION BY A CROSS-GRAMIAN APPROACH FOR DATA-SPARSE SYSTEMS
MODEL REDUCTION BY A CROSS-GRAMIAN APPROACH FOR DATA-SPARSE SYSTEMS Ulrike Baur joint work with Peter Benner Mathematics in Industry and Technology Faculty of Mathematics Chemnitz University of Technology
More informationBIBO STABILITY AND ASYMPTOTIC STABILITY
BIBO STABILITY AND ASYMPTOTIC STABILITY FRANCESCO NORI Abstract. In this report with discuss the concepts of bounded-input boundedoutput stability (BIBO) and of Lyapunov stability. Examples are given to
More informationthat determines x up to a complex scalar of modulus 1, in the real case ±1. Another condition to normalize x is by requesting that
Chapter 3 Newton methods 3. Linear and nonlinear eigenvalue problems When solving linear eigenvalue problems we want to find values λ C such that λi A is singular. Here A F n n is a given real or complex
More informationReflected Brownian Motion
Chapter 6 Reflected Brownian Motion Often we encounter Diffusions in regions with boundary. If the process can reach the boundary from the interior in finite time with positive probability we need to decide
More informationIntroduction to Controls
EE 474 Review Exam 1 Name Answer each of the questions. Show your work. Note were essay-type answers are requested. Answer with complete sentences. Incomplete sentences will count heavily against the grade.
More informationME scope Application Note 28
App Note 8 www.vibetech.com 3/7/17 ME scope Application Note 8 Mathematics of a Mass-Spring-Damper System INTRODUCTION In this note, the capabilities of ME scope will be used to build a model of the mass-spring-damper
More informationSubspace accelerated DPA and Jacobi-Davidson style methods
Chapter 3 Subspace accelerated DPA and Jacobi-Davidson style methods Abstract. This chapter describes a new algorithm for the computation of the dominant poles of a high-order scalar transfer function.
More informationMatrix Iteration. Giacomo Boffi.
http://intranet.dica.polimi.it/people/boffi-giacomo Dipartimento di Ingegneria Civile Ambientale e Territoriale Politecnico di Milano April 12, 2016 Outline Second -Ritz Method Dynamic analysis of MDOF
More informationẋ 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)
EEE582 Topical Outline A.A. Rodriguez Fall 2007 GWC 352, 965-3712 The following represents a detailed topical outline of the course. It attempts to highlight most of the key concepts to be covered and
More informationME8230 Nonlinear Dynamics
ME8230 Nonlinear Dynamics Lecture 1, part 1 Introduction, some basic math background, and some random examples Prof. Manoj Srinivasan Mechanical and Aerospace Engineering srinivasan.88@osu.edu Spring mass
More informationLecture 3 January 23
EE 123: Digital Signal Processing Spring 2007 Lecture 3 January 23 Lecturer: Prof. Anant Sahai Scribe: Dominic Antonelli 3.1 Outline These notes cover the following topics: Eigenvectors and Eigenvalues
More informationSubject: Optimal Control Assignment-1 (Related to Lecture notes 1-10)
Subject: Optimal Control Assignment- (Related to Lecture notes -). Design a oil mug, shown in fig., to hold as much oil possible. The height and radius of the mug should not be more than 6cm. The mug must
More informationKrylov methods for the solution of parameterized linear systems in the simulation of structures and vibrations: theory, applications and challenges
Krylov methods for the solution of parameterized linear systems in the simulation of structures and vibrations: theory, applications and challenges Karl Meerbergen K.U. Leuven Autumn School on Model Order
More informationECEN 420 LINEAR CONTROL SYSTEMS. Lecture 6 Mathematical Representation of Physical Systems II 1/67
1/67 ECEN 420 LINEAR CONTROL SYSTEMS Lecture 6 Mathematical Representation of Physical Systems II State Variable Models for Dynamic Systems u 1 u 2 u ṙ. Internal Variables x 1, x 2 x n y 1 y 2. y m Figure
More informationModern Optimal Control
Modern Optimal Control Matthew M. Peet Arizona State University Lecture 19: Stabilization via LMIs Optimization Optimization can be posed in functional form: min x F objective function : inequality constraints
More informationIdentification Methods for Structural Systems. Prof. Dr. Eleni Chatzi Lecture March, 2016
Prof. Dr. Eleni Chatzi Lecture 4-09. March, 2016 Fundamentals Overview Multiple DOF Systems State-space Formulation Eigenvalue Analysis The Mode Superposition Method The effect of Damping on Structural
More informationControl Systems Design
ELEC4410 Control Systems Design Lecture 18: State Feedback Tracking and State Estimation Julio H. Braslavsky julio@ee.newcastle.edu.au School of Electrical Engineering and Computer Science Lecture 18:
More informationComputational Methods for Feedback Control in Damped Gyroscopic Second-order Systems 1
Computational Methods for Feedback Control in Damped Gyroscopic Second-order Systems 1 B. N. Datta, IEEE Fellow 2 D. R. Sarkissian 3 Abstract Two new computationally viable algorithms are proposed for
More informationLinear systems, small signals, and integrators
Linear systems, small signals, and integrators CNS WS05 Class Giacomo Indiveri Institute of Neuroinformatics University ETH Zurich Zurich, December 2005 Outline 1 Linear Systems Crash Course Linear Time-Invariant
More informationx R d, λ R, f smooth enough. Goal: compute ( follow ) equilibrium solutions as λ varies, i.e. compute solutions (x, λ) to 0 = f(x, λ).
Continuation of equilibria Problem Parameter-dependent ODE ẋ = f(x, λ), x R d, λ R, f smooth enough. Goal: compute ( follow ) equilibrium solutions as λ varies, i.e. compute solutions (x, λ) to 0 = f(x,
More informationVectors in Function Spaces
Jim Lambers MAT 66 Spring Semester 15-16 Lecture 18 Notes These notes correspond to Section 6.3 in the text. Vectors in Function Spaces We begin with some necessary terminology. A vector space V, also
More informationSystem Identification and Model Updating of the Four Seasons Building
System Identification and Model Updating of the Four Seasons Building Eunjong Yu, Ying Lei, Derek Skolnik, John W. Wallace OVERVIEW Building Description Testing & Data Acquisition System Identification
More informationZeros and zero dynamics
CHAPTER 4 Zeros and zero dynamics 41 Zero dynamics for SISO systems Consider a linear system defined by a strictly proper scalar transfer function that does not have any common zero and pole: g(s) =α p(s)
More informationControl Systems I. Lecture 4: Diagonalization, Modal Analysis, Intro to Feedback. Readings: Emilio Frazzoli
Control Systems I Lecture 4: Diagonalization, Modal Analysis, Intro to Feedback Readings: Emilio Frazzoli Institute for Dynamic Systems and Control D-MAVT ETH Zürich October 13, 2017 E. Frazzoli (ETH)
More informationINC 341 Feedback Control Systems: Lecture 2 Transfer Function of Dynamic Systems I Asst. Prof. Dr.-Ing. Sudchai Boonto
INC 341 Feedback Control Systems: Lecture 2 Transfer Function of Dynamic Systems I Asst. Prof. Dr.-Ing. Sudchai Boonto Department of Control Systems and Instrumentation Engineering King Mongkut s University
More informationAn Arnoldi method with structured starting vectors for the delay eigenvalue problem
An Arnoldi method with structured starting vectors for the delay eigenvalue problem Elias Jarlebring, Karl Meerbergen, Wim Michiels Department of Computer Science, K.U. Leuven, Celestijnenlaan 200 A, 3001
More informationSpectral methods for fuzzy structural dynamics: modal vs direct approach
Spectral methods for fuzzy structural dynamics: modal vs direct approach S Adhikari Zienkiewicz Centre for Computational Engineering, College of Engineering, Swansea University, Wales, UK IUTAM Symposium
More informationThe Finite Element Method for the Analysis of Non-Linear and Dynamic Systems: Non-Linear Dynamics Part I
The Finite Element Method for the Analysis of Non-Linear and Dynamic Systems: Non-Linear Dynamics Part I Prof. Dr. Eleni Chatzi Dr. Giuseppe Abbiati, Dr. Konstantinos Agathos Lecture 5/Part A - 23 November,
More informationStructured Krylov Subspace Methods for Eigenproblems with Spectral Symmetries
Structured Krylov Subspace Methods for Eigenproblems with Spectral Symmetries Fakultät für Mathematik TU Chemnitz, Germany Peter Benner benner@mathematik.tu-chemnitz.de joint work with Heike Faßbender
More informationTransform Solutions to LTI Systems Part 3
Transform Solutions to LTI Systems Part 3 Example of second order system solution: Same example with increased damping: k=5 N/m, b=6 Ns/m, F=2 N, m=1 Kg Given x(0) = 0, x (0) = 0, find x(t). The revised
More informationAutonomous system = system without inputs
Autonomous system = system without inputs State space representation B(A,C) = {y there is x, such that σx = Ax, y = Cx } x is the state, n := dim(x) is the state dimension, y is the output Polynomial representation
More informationLinear Systems Theory
ME 3253 Linear Systems Theory Review Class Overview and Introduction 1. How to build dynamic system model for physical system? 2. How to analyze the dynamic system? -- Time domain -- Frequency domain (Laplace
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 informationGEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM. COURSE: ECE 3084A (Prof. Michaels)
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM DATE: 30-Apr-14 COURSE: ECE 3084A (Prof. Michaels) NAME: STUDENT #: LAST, FIRST Write your name on the front page
More informationKrylov-Subspace Based Model Reduction of Nonlinear Circuit Models Using Bilinear and Quadratic-Linear Approximations
Krylov-Subspace Based Model Reduction of Nonlinear Circuit Models Using Bilinear and Quadratic-Linear Approximations Peter Benner and Tobias Breiten Abstract We discuss Krylov-subspace based model reduction
More informationECEN 605 LINEAR SYSTEMS. Lecture 7 Solution of State Equations 1/77
1/77 ECEN 605 LINEAR SYSTEMS Lecture 7 Solution of State Equations Solution of State Space Equations Recall from the previous Lecture note, for a system: ẋ(t) = A x(t) + B u(t) y(t) = C x(t) + D u(t),
More informationTHEOREM OF OSELEDETS. We recall some basic facts and terminology relative to linear cocycles and the multiplicative ergodic theorem of Oseledets [1].
THEOREM OF OSELEDETS We recall some basic facts and terminology relative to linear cocycles and the multiplicative ergodic theorem of Oseledets []. 0.. Cocycles over maps. Let µ be a probability measure
More informationPhysics 202 Laboratory 5. Linear Algebra 1. Laboratory 5. Physics 202 Laboratory
Physics 202 Laboratory 5 Linear Algebra Laboratory 5 Physics 202 Laboratory We close our whirlwind tour of numerical methods by advertising some elements of (numerical) linear algebra. There are three
More informationFFTs in Graphics and Vision. The Laplace Operator
FFTs in Graphics and Vision The Laplace Operator 1 Outline Math Stuff Symmetric/Hermitian Matrices Lagrange Multipliers Diagonalizing Symmetric Matrices The Laplacian Operator 2 Linear Operators Definition:
More informationChapter 2 SDOF Vibration Control 2.1 Transfer Function
Chapter SDOF Vibration Control.1 Transfer Function mx ɺɺ( t) + cxɺ ( t) + kx( t) = F( t) Defines the transfer function as output over input X ( s) 1 = G( s) = (1.39) F( s) ms + cs + k s is a complex number:
More informationMath 205 A B Final Exam page 1 12/12/2012 Name
Math 205 A B Final Exam page 1 12/12/2012 Name 1. Let F be the vector space of continuous functions f : R R that we have been using in class. Let H = {f F f has the same y-coordinate at x = 1 as it does
More informationModern Control Systems
Modern Control Systems Matthew M. Peet Arizona State University Lecture 09: Observability Observability For Static Full-State Feedback, we assume knowledge of the Full-State. In reality, we only have measurements
More informationOrder reduction numerical methods for the algebraic Riccati equation. V. Simoncini
Order reduction numerical methods for the algebraic Riccati equation V. Simoncini Dipartimento di Matematica Alma Mater Studiorum - Università di Bologna valeria.simoncini@unibo.it 1 The problem Find X
More informationABSTRACT. Name: Daniil R. Sarkissian Department: Mathematical Sciences
ABSTRACT Name: Daniil R. Sarkissian Department: Mathematical Sciences Title: Theory and Computations of Partial Eigenvalue and Eigenstructure Assignment Problems in Matrix Second-Order and Distributed-Parameter
More informationH 2 optimal model approximation by structured time-delay reduced order models
H 2 optimal model approximation by structured time-delay reduced order models I. Pontes Duff, Charles Poussot-Vassal, C. Seren 27th September, GT MOSAR and GT SAR meeting 200 150 100 50 0 50 100 150 200
More informationCollocated versus non-collocated control [H04Q7]
Collocated versus non-collocated control [H04Q7] Jan Swevers September 2008 0-0 Contents Some concepts of structural dynamics Collocated versus non-collocated control Summary This lecture is based on parts
More informationApplied Mathematics Masters Examination Fall 2016, August 18, 1 4 pm.
Applied Mathematics Masters Examination Fall 16, August 18, 1 4 pm. Each of the fifteen numbered questions is worth points. All questions will be graded, but your score for the examination will be the
More informationControl System Design
ELEC ENG 4CL4: Control System Design Notes for Lecture #4 Monday, January 13, 2003 Dr. Ian C. Bruce Room: CRL-229 Phone ext.: 26984 Email: ibruce@mail.ece.mcmaster.ca Impulse and Step Responses of Continuous-Time
More informationEC Control Engineering Quiz II IIT Madras
EC34 - Control Engineering Quiz II IIT Madras Linear algebra Find the eigenvalues and eigenvectors of A, A, A and A + 4I Find the eigenvalues and eigenvectors of the following matrices: (a) cos θ sin θ
More informationPolynomial Jacobi Davidson Method for Large/Sparse Eigenvalue Problems
Polynomial Jacobi Davidson Method for Large/Sparse Eigenvalue Problems Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan April 28, 2011 T.M. Huang (Taiwan Normal Univ.)
More informationCollocation approximation of the monodromy operator of periodic, linear DDEs
p. Collocation approximation of the monodromy operator of periodic, linear DDEs Ed Bueler 1, Victoria Averina 2, and Eric Butcher 3 13 July, 2004 SIAM Annual Meeting 2004, Portland 1=Dept. of Math. Sci.,
More informationControl Systems Design, SC4026. SC4026 Fall 2009, dr. A. Abate, DCSC, TU Delft
Control Systems Design, SC4026 SC4026 Fall 2009, dr. A. Abate, DCSC, TU Delft Lecture 4 Controllability (a.k.a. Reachability) vs Observability Algebraic Tests (Kalman rank condition & Hautus test) A few
More informationMASS, STIFFNESS AND DAMPING IDENTIFICATION OF A TWO-STORY BUILDING MODEL
COMPDYN 2 3 rd ECCOMAS Thematic Conference on Computational Methods in Structural Dynamics and Earthquake Engineering M. Papadrakakis, M. Fragiadakis, V. Plevris (eds.) Corfu, Greece, 25-28 May 2 MASS,
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science : Dynamic Systems Spring 2011
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.4: Dynamic Systems Spring Homework Solutions Exercise 3. a) We are given the single input LTI system: [
More informationLecture 13 Spectral Graph Algorithms
COMS 995-3: Advanced Algorithms March 6, 7 Lecture 3 Spectral Graph Algorithms Instructor: Alex Andoni Scribe: Srikar Varadaraj Introduction Today s topics: Finish proof from last lecture Example of random
More informationYORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #1. July 11, 2013 Solutions
YORK UNIVERSITY Faculty of Science Department of Mathematics and Statistics MATH 222 3. M Test # July, 23 Solutions. For each statement indicate whether it is always TRUE or sometimes FALSE. Note: For
More informationNonlinear Control Systems
Nonlinear Control Systems António Pedro Aguiar pedro@isr.ist.utl.pt 7. Feedback Linearization IST-DEEC PhD Course http://users.isr.ist.utl.pt/%7epedro/ncs1/ 1 1 Feedback Linearization Given a nonlinear
More information