MODEL REDUCTION BY A CROSS-GRAMIAN APPROACH FOR DATA-SPARSE SYSTEMS
|
|
- Elwin Bruce
- 5 years ago
- Views:
Transcription
1 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 baur@mathematik.tu-chemnitz.de Computational Methods with Applications Harrachov, August /19 Ulrike Baur Cross-Gramian model reduction
2 Outline Balancing-related model reduction by a data-sparse cross-gramian approach Large-scale systems Model reduction - cross-gramian approach The sign function method H-matrix implementation Numerical results 2/19 Ulrike Baur Cross-Gramian model reduction
3 Large-scale dynamical systems d dt x(t) = Ax(t) + Bu(t), x(0) = x 0, y(t) = Cx(t), where x(t) R n,u(t) R m,y(t) R p. Assumptions on (A,B,C,D) R n n R n m R p n R p p : A asymptotically stable, i.e. λ(a) C large-scale, e.g. n = O(10 5 ), and n m,p controllable and observable We consider large-scale systems arising from control problems for instationary PDEs semi-discretized by FEM, FDM or BEM. 3/19 Ulrike Baur Cross-Gramian model reduction
4 Model reduction - main issues Find a reduced-order model of order r n d dt ˆx(t) = ˆx(t) + ˆBu(t), ˆx(0) = ˆx 0 ŷ(t) = Ĉˆx(t) + Du(t), t 0 (Â, ˆB,Ĉ,D) Rr r R r m R p r R p p  is asymptotically stable small error G Ĝ, y ŷ 2 G Ĝ u 2, where G(s) = C(sI n A) 1 B + D, Ĝ(s) = Ĉ(sI r Â) 1 ˆB + D. 4/19 Ulrike Baur Cross-Gramian model reduction
5 Model reduction - balanced truncation [Moore 81] Balanced truncation computes reduced order system  = W T AV, ˆB = W T B, Ĉ = CV where V, W R n r are computed from T which diagonalizes controllability Gramian P and observability Gramian Q: T PT T = T T QT 1 = diag(σ 1,,σ n ), σ 1 σ 2 σ n V, W can be computed by wk T(PQ)v k = σk 2, k = 1,...,r 1 λ(â) C 2 y ŷ 2 G Ĝ u 2 2 n k=r+1 σ k u 2 5/19 Ulrike Baur Cross-Gramian model reduction
6 System Gramians Controllability Gramian P and observability Gramian Q defined by P = e At BB T e AT t dt, Q = e AT t CC T e At dt. 0 0 Gramians equivalently given by solutions of Lyapunov equations AP + PA T + BB T = 0, A T Q + QA + C T C = 0 Thus, main computational task in balanced truncation: Compute solutions of large-scale matrix equations! 6/19 Ulrike Baur Cross-Gramian model reduction
7 Model reduction - cross-gramian approach Define the cross-gramian X for square systems (m = p) by AX + XA + BC = 0 and project the system onto the dominant invariant subspace of X corresponding to r largest eigenvalues. 7/19 Ulrike Baur Cross-Gramian model reduction
8 Model reduction - cross-gramian approach Define the cross-gramian X for square systems (m = p) by AX + XA + BC = 0 and project the system onto the dominant invariant subspace of X corresponding to r largest eigenvalues. If then system is SISO (p = m = 1) [Fernando/Nicholson 83] or symmetric MIMO [Laub/Silverman/Verma 83, Fernando/Nicholson 84]. X 2 = PQ and σ k = λ k (X). 7/19 Ulrike Baur Cross-Gramian model reduction
9 Model reduction - cross-gramian approach Define the cross-gramian X for square systems (m = p) by AX + XA + BC = 0 and project the system onto the dominant invariant subspace of X corresponding to r largest eigenvalues. If then system is SISO (p = m = 1) [Fernando/Nicholson 83] or symmetric MIMO [Laub/Silverman/Verma 83, Fernando/Nicholson 84]. X 2 = PQ and σ k = λ k (X). Model order reduction with cross-gramian: Aldhaheri 91, Antoulas/Sorensen 00 7/19 Ulrike Baur Cross-Gramian model reduction
10 Low rank solution of Sylvester equation Sylvester equation AX + XA + BC = 0 In many situations: rank(x,τ) = n τ n, e.g. n τ = O(log(1/τ)log(n)) [Grasedyck 04]. Compute low-rank factors of X: X YZ, Y R n nτ, Z R nτ n singular values machine precision 10 0 low-rank ADI [Benner 05] analogous to [Penzl 00, Li/White 02] implicitly restarted method [Antoulas/Sorensen 00] multigrid method [Grasedyck/Hackbusch 04] sign function method [Benner 04, B. 05] σ j index j 8/19 Ulrike Baur Cross-Gramian model reduction
11 Sign function method in factored form Newton iteration for the solution X YZ of AX + XA + BC = 0: (1) A 0 = A A k+1 = 1 2 (A k + A 1 k ) I n (2) B 0 = B B k+1 = 1 [ Bk 2, A 1 k B ] k 2Y [ ] (3) C 0 = C C k+1 = 1 C k 2 C k A 1 2Z k Complexity: (1): O(n 3 ) hierarchical matrices Storage: (1) : A k R n n hierarchical matrices (2) + (3) : B k R n 2kp, C k R 2k m n row compression 9/19 Ulrike Baur Cross-Gramian model reduction
12 Sign function method - row compression In each Newton step compute: [ ] [ ] C R11 1 Compute RRQR k R 12 C k A 1 = U k 0 R 22 R 11 R s s, s = rank(c k+1,τ) 2 Compute RRLQ [ [ B k, A 1 k B ] L11 0 k U = πb L 21 L 22 L 11 R t t, t = rank(b k+1,τ) 3 Partition V : V 11 R t s 4 If (t < s) B j π B [ L11 L 21 else B j π B [ L11 L 21 π C ], C j V 11 [R 11 R 12 ]π C ] V 11, C j [R 11 R 12 ]π C 1 2 B k Y R n nτ 2 1 nτ C k Z R n 10/19 Ulrike Baur Cross-Gramian model reduction ] V
13 H-matrices [Hackbusch 98] H-matrices provide data-sparse representation for certain densely populated matrices (FEM 1, BEM,...). hierarchy of blocks, approximation by matrices of rank k(ǫ) approximation error: A A H 2 A 2 ǫ storage for A H R n n : O(n log 2 (n)k(ǫ)) formatted arithmetic with complexity: Ax : O(n log 2 (n)k(ǫ)) : O(n log 2 2 (n)k(ǫ)), Inv H : O(n log 2 2(n)k(ǫ) 2 ) Blockwise SVD of A H, n = 4096, ǫ = /19 Ulrike Baur Cross-Gramian model reduction
14 Data-sparse sign function method Newton iteration for the solution X YZ of AX + XA + BC = 0: (1) A 0 = A H A k+1 = 1 2 (A k Inv H (A k )) I n (2) B 0 = B B k+1 = 1 2 [B k, Inv H (A k )B k ] 2Y [ ] (3) C 0 = C C k+1 = 1 C k 2 2Z C k Inv H (A k ) Complexity: (1): O(n log 2 2 (n)k(ǫ)2 ) hierarchical matrices Storage: (1) : A k : O(n log 2 (n)k(ǫ)) hierarchical matrices (2) + (3) : B k R n nτ, C k R nτ n row compression 12/19 Ulrike Baur Cross-Gramian model reduction
15 Model order reduction with cross-gramian Compute basis of dominant invariant subspace of X YZ W T XV = T with λ(t) = {σ 1,,σ r } 1 Compute basis Ṽ of right invariant subspace of ZY Y Z Z Y QR fact. product QR basis of right dominant invariant subspace of YZ: V = Y Ṽ(:,1 : r) 13/19 Ulrike Baur Cross-Gramian model reduction
16 Model order reduction with cross-gramian Compute basis of dominant invariant subspace of X YZ W T XV = T with λ(t) = {σ 1,,σ r } 1 Compute basis Ṽ of right invariant subspace of ZY basis of right dominant invariant subspace of YZ: V = Y Ṽ(:,1 : r) 2 Compute basis W of left invariant subspace of ZY basis of left dominant invariant subspace of YZ: W T = W T (1 : r,:)z 3 Orthogonalize W and V : W T V = I r 13/19 Ulrike Baur Cross-Gramian model reduction
17 Model order reduction with cross-gramian Compute basis of dominant invariant subspace of X YZ W T XV = T with λ(t) = {σ 1,,σ r } 1 Compute basis Ṽ of right invariant subspace of ZY basis of right dominant invariant subspace of YZ: V = Y Ṽ(:,1 : r) 2 Compute basis W of left invariant subspace of ZY basis of left dominant invariant subspace of YZ: W T = W T (1 : r,:)z 3 Orthogonalize W and V : W T V = I r Reduced system of order r: Â = W T AV, ˆB = W T B, Ĉ = CV 13/19 Ulrike Baur Cross-Gramian model reduction
18 H-matrix - accuracy of reduced model Recall: balanced truncation error bound y ŷ 2 G Ĝ u 2 with G Ĝ 2 n k=r+1 σ k tol 14/19 Ulrike Baur Cross-Gramian model reduction
19 H-matrix - accuracy of reduced model Recall: balanced truncation error bound y ŷ 2 G Ĝ u 2 with G Ĝ 2 n k=r+1 σ k tol Theorem [B./Benner 06] For symmetric A, A H with eigenvalues λ n λ 1 < 0 and A A H 2 cǫ we have G Ĝ G G H + G H Ĝ c ǫ 1 λ 2 1 C 2 B n k=r+1 σ k. 14/19 Ulrike Baur Cross-Gramian model reduction
20 Numerical results - 2d heat equation x t (t,ξ) a x(t,ξ) = b(ξ)u(t), ξ [0,1]2, t (0, ) y(t) = x(t,ξ) Ωo n = 16,384 diffusion: a = 1 HLib 1.3 [Börm/Grasedyck/Hackbusch] τ = ǫ = 10 4 rel. residual of X: G(j ω) G r (j ω) BT : r = 4 CG : r = 4 BT : δ CG : δ tol tol=10 4 r = Frequency ω 15/19 Ulrike Baur Cross-Gramian model reduction
21 Numerical results - 2d heat equation x t (t,ξ) a(ξ) x(t,ξ) = b(ξ)u(t), ξ [0,1]2, t (0, ) varying diffusion a(ξ): 1 y n = 16,384 τ = ǫ = 10 4 x tol= 10 4 r = 3 a(ξ) = 1.0 a(ξ) = 10 4 a(ξ) = 10 G(j ω) G r (j ω) BT : r = 3 CG : r = 3 BT : δ CG : δ tol Frequency ω 16/19 Ulrike Baur Cross-Gramian model reduction
22 Numerical results - convection-diffusion equation x t (t,ξ) a x(t,ξ) c x(t,ξ) = b(ξ)u(t), ξ [0,1]2, t (0, ) n = 16,384 convection: c = (0,1) T diffusion: a = 10 4 τ = ǫ = 10 6 tol= 10 4 r = BT : r = 9 CG : r = 9 BT : δ CG : δ tol /19 Ulrike Baur Cross-Gramian model reduction
23 Numerical results - MIMO example optimal cooling of steel profiles [Benner/Saak 05] nonsymmetric MIMO system with n = 5177 m = p = 6 τ = ǫ = 10 4, tol= 10 4 From in(1) to out(1) From in(2) to out(1) G(j ω) G r (j ω) BT : r = 18 CG : r = 14 BT : δ CG : δ tol G(j ω) G r (j ω) BT : r = 18 CG : r = 14 BT : δ CG : δ tol Frequency ω Frequency ω 18/19 Ulrike Baur Cross-Gramian model reduction
24 Conclusions With H-matrix arithmetic we can solve large-scale Sylvester equations n # iter. n τ time[sec] rel. residual rel. error H full H full H full e e e e e e-05 16, e , , e , , H-matrix based sign function solver well suited for the solution of large-scale Sylvester equations arising from FEM/BEM discretizations of elliptic partial differential operators. With H-matrix based Sylvester solver we obtain efficient new implementation of model reduction method based on cross-gramian. 19/19 Ulrike Baur Cross-Gramian model reduction
25 Conclusions With H-matrix arithmetic we can solve large-scale Sylvester equations n # iter. n τ time[sec] rel. residual rel. error H full H full H full e e e e e e-05 16, e , , e , , H-matrix based sign function solver well suited for the solution of large-scale Sylvester equations arising from FEM/BEM discretizations of elliptic partial differential operators. With H-matrix based Sylvester solver we obtain efficient new implementation of model reduction method based on cross-gramian. Thank you for your attention! 19/19 Ulrike Baur Cross-Gramian model reduction
BALANCING-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 informationGramian-Based Model Reduction for Data-Sparse Systems CSC/ Chemnitz Scientific Computing Preprints
Ulrike Baur Peter Benner Gramian-Based Model Reduction for Data-Sparse Systems CSC/07-01 Chemnitz Scientific Computing Preprints Impressum: Chemnitz Scientific Computing Preprints ISSN 1864-0087 (1995
More informationS N. hochdimensionaler Lyapunov- und Sylvestergleichungen. Peter Benner. Mathematik in Industrie und Technik Fakultät für Mathematik TU Chemnitz
Ansätze zur numerischen Lösung hochdimensionaler Lyapunov- und Sylvestergleichungen Peter Benner Mathematik in Industrie und Technik Fakultät für Mathematik TU Chemnitz S N SIMULATION www.tu-chemnitz.de/~benner
More informationParallel Model Reduction of Large Linear Descriptor Systems via Balanced Truncation
Parallel Model Reduction of Large Linear Descriptor Systems via Balanced Truncation Peter Benner 1, Enrique S. Quintana-Ortí 2, Gregorio Quintana-Ortí 2 1 Fakultät für Mathematik Technische Universität
More informationA Newton-Galerkin-ADI Method for Large-Scale Algebraic Riccati Equations
A Newton-Galerkin-ADI Method for Large-Scale Algebraic Riccati Equations Peter Benner Max-Planck-Institute for Dynamics of Complex Technical Systems Computational Methods in Systems and Control Theory
More informationEfficient Implementation of Large Scale Lyapunov and Riccati Equation Solvers
Efficient Implementation of Large Scale Lyapunov and Riccati Equation Solvers Jens Saak joint work with Peter Benner (MiIT) Professur Mathematik in Industrie und Technik (MiIT) Fakultät für Mathematik
More informationFactorized Solution of Sylvester Equations with Applications in Control
Factorized Solution of Sylvester Equations with Applications in Control Peter Benner Abstract Sylvester equations play a central role in many areas of applied mathematics and in particular in systems and
More informationBalanced Truncation Model Reduction of Large and Sparse Generalized Linear Systems
Balanced Truncation Model Reduction of Large and Sparse Generalized Linear Systems Jos M. Badía 1, Peter Benner 2, Rafael Mayo 1, Enrique S. Quintana-Ortí 1, Gregorio Quintana-Ortí 1, A. Remón 1 1 Depto.
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 informationParametrische Modellreduktion mit dünnen Gittern
Parametrische Modellreduktion mit dünnen Gittern (Parametric model reduction with sparse grids) Ulrike Baur Peter Benner Mathematik in Industrie und Technik, Fakultät für Mathematik Technische Universität
More informationPassivity Preserving Model Reduction for Large-Scale Systems. Peter Benner.
Passivity Preserving Model Reduction for Large-Scale Systems Peter Benner Mathematik in Industrie und Technik Fakultät für Mathematik Sonderforschungsbereich 393 S N benner@mathematik.tu-chemnitz.de SIMULATION
More informationModel reduction for linear systems by balancing
Model reduction for linear systems by balancing Bart Besselink Jan C. Willems Center for Systems and Control Johann Bernoulli Institute for Mathematics and Computer Science University of Groningen, Groningen,
More informationH 2 optimal model reduction - Wilson s conditions for the cross-gramian
H 2 optimal model reduction - Wilson s conditions for the cross-gramian Ha Binh Minh a, Carles Batlle b a School of Applied Mathematics and Informatics, Hanoi University of Science and Technology, Dai
More informationBalancing-Related Model Reduction for Large-Scale Systems
Balancing-Related Model Reduction for Large-Scale Systems Peter Benner Professur Mathematik in Industrie und Technik Fakultät für Mathematik Technische Universität Chemnitz D-09107 Chemnitz benner@mathematik.tu-chemnitz.de
More informationThe Newton-ADI Method for Large-Scale Algebraic Riccati Equations. Peter Benner.
The Newton-ADI Method for Large-Scale Algebraic Riccati Equations Mathematik in Industrie und Technik Fakultät für Mathematik Peter Benner benner@mathematik.tu-chemnitz.de Sonderforschungsbereich 393 S
More informationModel reduction of coupled systems
Model reduction of coupled systems Tatjana Stykel Technische Universität Berlin ( joint work with Timo Reis, TU Kaiserslautern ) Model order reduction, coupled problems and optimization Lorentz Center,
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 informationLinear and Nonlinear Matrix Equations Arising in Model Reduction
International Conference on Numerical Linear Algebra and its Applications Guwahati, January 15 18, 2013 Linear and Nonlinear Matrix Equations Arising in Model Reduction Peter Benner Tobias Breiten Max
More informationNumerical Solution of Matrix Equations Arising in Control of Bilinear and Stochastic Systems
MatTriad 2015 Coimbra September 7 11, 2015 Numerical Solution of Matrix Equations Arising in Control of Bilinear and Stochastic Systems Peter Benner Max Planck Institute for Dynamics of Complex Technical
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 informationLow Rank Solution of Data-Sparse Sylvester Equations
Low Ran Solution of Data-Sparse Sylvester Equations U. Baur e-mail: baur@math.tu-berlin.de, Phone: +49(0)3031479177, Fax: +49(0)3031479706, Technische Universität Berlin, Institut für Mathemati, Straße
More informationModel reduction of large-scale systems by least squares
Model reduction of large-scale systems by least squares Serkan Gugercin Department of Mathematics, Virginia Tech, Blacksburg, VA, USA gugercin@mathvtedu Athanasios C Antoulas Department of Electrical and
More informationFluid flow dynamical model approximation and control
Fluid flow dynamical model approximation and control... a case-study on an open cavity flow C. Poussot-Vassal & D. Sipp Journée conjointe GT Contrôle de Décollement & GT MOSAR Frequency response of an
More informationAccelerating Model Reduction of Large Linear Systems with Graphics Processors
Accelerating Model Reduction of Large Linear Systems with Graphics Processors P. Benner 1, P. Ezzatti 2, D. Kressner 3, E.S. Quintana-Ortí 4, Alfredo Remón 4 1 Max-Plank-Institute for Dynamics of Complex
More informationAn iterative SVD-Krylov based method for model reduction of large-scale dynamical systems
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 1964 1986 www.elsevier.com/locate/laa An iterative SVD-Krylov based method for model reduction of large-scale dynamical
More informationMatrix Equations and and Bivariate Function Approximation
Matrix Equations and and Bivariate Function Approximation D. Kressner Joint work with L. Grasedyck, C. Tobler, N. Truhar. ETH Zurich, Seminar for Applied Mathematics Manchester, 17.06.2009 Sylvester matrix
More information1 Some Facts on Symmetric Matrices
1 Some Facts on Symmetric Matrices Definition: Matrix A is symmetric if A = A T. Theorem: Any symmetric matrix 1) has only real eigenvalues; 2) is always iagonalizable; 3) has orthogonal eigenvectors.
More informationModel Reduction for Dynamical Systems
Otto-von-Guericke Universität Magdeburg Faculty of Mathematics Summer term 2015 Model Reduction for Dynamical Systems Lecture 8 Peter Benner Lihong Feng Max Planck Institute for Dynamics of Complex Technical
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 informationExploiting off-diagonal rank structures in the solution of linear matrix equations
Stefano Massei Exploiting off-diagonal rank structures in the solution of linear matrix equations Based on joint works with D. Kressner (EPFL), M. Mazza (IPP of Munich), D. Palitta (IDCTS of Magdeburg)
More informationFEL3210 Multivariable Feedback Control
FEL3210 Multivariable Feedback Control Lecture 8: Youla parametrization, LMIs, Model Reduction and Summary [Ch. 11-12] Elling W. Jacobsen, Automatic Control Lab, KTH Lecture 8: Youla, LMIs, Model Reduction
More informationBALANCING-RELATED MODEL REDUCTION FOR LARGE-SCALE SYSTEMS
FOR LARGE-SCALE SYSTEMS Professur Mathematik in Industrie und Technik Fakultät für Mathematik Technische Universität Chemnitz Recent Advances in Model Order Reduction Workshop TU Eindhoven, November 23,
More informationComparison of methods for parametric model order reduction of instationary problems
Max Planck Institute Magdeburg Preprints Ulrike Baur Peter Benner Bernard Haasdonk Christian Himpe Immanuel Maier Mario Ohlberger Comparison of methods for parametric model order reduction of instationary
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 informationIterative Rational Krylov Algorithm for Unstable Dynamical Systems and Generalized Coprime Factorizations
Iterative Rational Krylov Algorithm for Unstable Dynamical Systems and Generalized Coprime Factorizations Klajdi Sinani Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University
More informationControl Systems Design
ELEC4410 Control Systems Design Lecture 14: Controllability Julio H. Braslavsky julio@ee.newcastle.edu.au School of Electrical Engineering and Computer Science Lecture 14: Controllability p.1/23 Outline
More informationBlock Bidiagonal Decomposition and Least Squares Problems
Block Bidiagonal Decomposition and Least Squares Problems Åke Björck Department of Mathematics Linköping University Perspectives in Numerical Analysis, Helsinki, May 27 29, 2008 Outline Bidiagonal Decomposition
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 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 informationAMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences)
AMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences) Lecture 19: Computing the SVD; Sparse Linear Systems Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical
More informationSolving Large Scale Lyapunov Equations
Solving Large Scale Lyapunov Equations D.C. Sorensen Thanks: Mark Embree John Sabino Kai Sun NLA Seminar (CAAM 651) IWASEP VI, Penn State U., 22 May 2006 The Lyapunov Equation AP + PA T + BB T = 0 where
More informationMoving Frontiers in Model Reduction Using Numerical Linear Algebra
Using Numerical Linear Algebra Max-Planck-Institute for Dynamics of Complex Technical Systems Computational Methods in Systems and Control Theory Group Magdeburg, Germany Technische Universität Chemnitz
More informationFourier Model Reduction for Large-Scale Applications in Computational Fluid Dynamics
Fourier Model Reduction for Large-Scale Applications in Computational Fluid Dynamics K. Willcox and A. Megretski A new method, Fourier model reduction (FMR), for obtaining stable, accurate, low-order models
More informationAn iterative SVD-Krylov based method for model reduction of large-scale dynamical systems
An iterative SVD-Krylov based method for model reduction of large-scale dynamical systems Serkan Gugercin Department of Mathematics, Virginia Tech., Blacksburg, VA, USA, 24061-0123 gugercin@math.vt.edu
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 informationSystem Identification by Nuclear Norm Minimization
Dept. of Information Engineering University of Pisa (Italy) System Identification by Nuclear Norm Minimization eng. Sergio Grammatico grammatico.sergio@gmail.com Class of Identification of Uncertain Systems
More information3 Gramians and Balanced Realizations
3 Gramians and Balanced Realizations In this lecture, we use an optimization approach to find suitable realizations for truncation and singular perturbation of G. It turns out that the recommended realizations
More informationfür Mathematik in den Naturwissenschaften Leipzig
ŠܹÈÐ Ò ¹ÁÒ Ø ØÙØ für Mathematik in den Naturwissenschaften Leipzig Nonlinear multigrid for the solution of large scale Riccati equations in low-rank and H-matrix format (revised version: May 2007) by
More informationGramians based model reduction for hybrid switched systems
Gramians based model reduction for hybrid switched systems Y. Chahlaoui Younes.Chahlaoui@manchester.ac.uk Centre for Interdisciplinary Computational and Dynamical Analysis (CICADA) School of Mathematics
More informationChapter 6 Balanced Realization 6. Introduction One popular approach for obtaining a minimal realization is known as Balanced Realization. In this appr
Lectures on ynamic Systems and Control Mohammed ahleh Munther A. ahleh George Verghese epartment of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter 6 Balanced
More informationModel reduction of large-scale dynamical systems
Model reduction of large-scale dynamical systems Lecture III: Krylov approximation and rational interpolation Thanos Antoulas Rice University and Jacobs University email: aca@rice.edu URL: www.ece.rice.edu/
More informationKrylov subspace methods for linear systems with tensor product structure
Krylov subspace methods for linear systems with tensor product structure Christine Tobler Seminar for Applied Mathematics, ETH Zürich 19. August 2009 Outline 1 Introduction 2 Basic Algorithm 3 Convergence
More informationModel reduction via tangential interpolation
Model reduction via tangential interpolation K. Gallivan, A. Vandendorpe and P. Van Dooren May 14, 2002 1 Introduction Although most of the theory presented in this paper holds for both continuous-time
More informationRobust Multivariable Control
Lecture 2 Anders Helmersson anders.helmersson@liu.se ISY/Reglerteknik Linköpings universitet Today s topics Today s topics Norms Today s topics Norms Representation of dynamic systems Today s topics Norms
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 informationModel order reduction of electrical circuits with nonlinear elements
Model order reduction of electrical circuits with nonlinear elements Andreas Steinbrecher and Tatjana Stykel 1 Introduction The efficient and robust numerical simulation of electrical circuits plays a
More informationLinear Algebra- Final Exam Review
Linear Algebra- Final Exam Review. Let A be invertible. Show that, if v, v, v 3 are linearly independent vectors, so are Av, Av, Av 3. NOTE: It should be clear from your answer that you know the definition.
More informationModule 09 From s-domain to time-domain From ODEs, TFs to State-Space Modern Control
Module 09 From s-domain to time-domain From ODEs, TFs to State-Space Modern Control Ahmad F. Taha EE 3413: Analysis and Desgin of Control Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/
More informationProperties of Matrices and Operations on Matrices
Properties of Matrices and Operations on Matrices A common data structure for statistical analysis is a rectangular array or matris. Rows represent individual observational units, or just observations,
More informationSparse factorization using low rank submatrices. Cleve Ashcraft LSTC 2010 MUMPS User Group Meeting April 15-16, 2010 Toulouse, FRANCE
Sparse factorization using low rank submatrices Cleve Ashcraft LSTC cleve@lstc.com 21 MUMPS User Group Meeting April 15-16, 21 Toulouse, FRANCE ftp.lstc.com:outgoing/cleve/mumps1 Ashcraft.pdf 1 LSTC Livermore
More informationModel Order Reduction of Continuous LTI Large Descriptor System Using LRCF-ADI and Square Root Balanced Truncation
, July 1-3, 15, London, U.K. Model Order Reduction of Continuous LI Large Descriptor System Using LRCF-ADI and Square Root Balanced runcation Mehrab Hossain Likhon, Shamsil Arifeen, and Mohammad Sahadet
More informationStructure preserving Krylov-subspace methods for Lyapunov equations
Structure preserving Krylov-subspace methods for Lyapunov equations Matthias Bollhöfer, André Eppler Institute Computational Mathematics TU Braunschweig MoRePas Workshop, Münster September 17, 2009 System
More informationBalancing-Related Model Reduction for Parabolic Control Systems
Balancing-Related Model Reduction for Parabolic Control Systems Peter Benner Max Planck Institute for Dynamics of Complex Technical Systems, Magdeburg, Germany (e-mail: benner@mpi-magdeburg.mpg.de). Abstract:
More informationProblem set 5 solutions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.242, Fall 24: MODEL REDUCTION Problem set 5 solutions Problem 5. For each of the stetements below, state
More informationSTA141C: Big Data & High Performance Statistical Computing
STA141C: Big Data & High Performance Statistical Computing Numerical Linear Algebra Background Cho-Jui Hsieh UC Davis May 15, 2018 Linear Algebra Background Vectors A vector has a direction and a magnitude
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 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 informationAdaptive rational Krylov subspaces for large-scale dynamical systems. V. Simoncini
Adaptive rational Krylov subspaces for large-scale dynamical systems V. Simoncini Dipartimento di Matematica, Università di Bologna valeria@dm.unibo.it joint work with Vladimir Druskin, Schlumberger Doll
More informationTowards high performance IRKA on hybrid CPU-GPU systems
Towards high performance IRKA on hybrid CPU-GPU systems Jens Saak in collaboration with Georg Pauer (OVGU/MPI Magdeburg) Kapil Ahuja, Ruchir Garg (IIT Indore) Hartwig Anzt, Jack Dongarra (ICL Uni Tennessee
More informationSTA141C: Big Data & High Performance Statistical Computing
STA141C: Big Data & High Performance Statistical Computing Lecture 5: Numerical Linear Algebra Cho-Jui Hsieh UC Davis April 20, 2017 Linear Algebra Background Vectors A vector has a direction and a magnitude
More informationThe amount of work to construct each new guess from the previous one should be a small multiple of the number of nonzeros in A.
AMSC/CMSC 661 Scientific Computing II Spring 2005 Solution of Sparse Linear Systems Part 2: Iterative methods Dianne P. O Leary c 2005 Solving Sparse Linear Systems: Iterative methods The plan: Iterative
More information16.31 Fall 2005 Lecture Presentation Mon 31-Oct-05 ver 1.1
16.31 Fall 2005 Lecture Presentation Mon 31-Oct-05 ver 1.1 Charles P. Coleman October 31, 2005 1 / 40 : Controllability Tests Observability Tests LEARNING OUTCOMES: Perform controllability tests Perform
More informationThe rational Krylov subspace for parameter dependent systems. V. Simoncini
The rational Krylov subspace for parameter dependent systems V. Simoncini Dipartimento di Matematica, Università di Bologna valeria.simoncini@unibo.it 1 Given the continuous-time system Motivation. Model
More informationImplicit Volterra Series Interpolation for Model Reduction of Bilinear Systems
Max Planck Institute Magdeburg Preprints Mian Ilyas Ahmad Ulrike Baur Peter Benner Implicit Volterra Series Interpolation for Model Reduction of Bilinear Systems MAX PLANCK INSTITUT FÜR DYNAMIK KOMPLEXER
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 informationAMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 18 Outline
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 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 informationChapter 6 Balanced Realization 6. Introduction One popular approach for obtaining a minimal realization is known as Balanced Realization. In this appr
Lectures on ynamic Systems and Control Mohammed ahleh Munther A. ahleh George Verghese epartment of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter 6 Balanced
More informationSYSTEM-THEORETIC METHODS FOR MODEL REDUCTION OF LARGE-SCALE SYSTEMS: SIMULATION, CONTROL, AND INVERSE PROBLEMS. Peter Benner
SYSTEM-THEORETIC METHODS FOR MODEL REDUCTION OF LARGE-SCALE SYSTEMS: SIMULATION, CONTROL, AND INVERSE PROBLEMS Professur Mathematik in Industrie und Technik Fakultät für Mathematik Technische Universität
More informationThe Lanczos and conjugate gradient algorithms
The Lanczos and conjugate gradient algorithms Gérard MEURANT October, 2008 1 The Lanczos algorithm 2 The Lanczos algorithm in finite precision 3 The nonsymmetric Lanczos algorithm 4 The Golub Kahan bidiagonalization
More informationA POD Projection Method for Large-Scale Algebraic Riccati Equations
A POD Projection Method for Large-Scale Algebraic Riccati Equations Boris Kramer Department of Mathematics Virginia Tech Blacksburg, VA 24061-0123 Email: bokr@vt.edu John R. Singler Department of Mathematics
More informationADI-preconditioned FGMRES for solving large generalized Lyapunov equations - A case study
-preconditioned for large - A case study Matthias Bollhöfer, André Eppler TU Braunschweig Institute Computational Mathematics Syrene-MOR Workshop, TU Hamburg October 30, 2008 2 / 20 Outline 1 2 Overview
More informationCDS Solutions to the Midterm Exam
CDS 22 - Solutions to the Midterm Exam Instructor: Danielle C. Tarraf November 6, 27 Problem (a) Recall that the H norm of a transfer function is time-delay invariant. Hence: ( ) Ĝ(s) = s + a = sup /2
More informationLecture notes: Applied linear algebra Part 1. Version 2
Lecture notes: Applied linear algebra Part 1. Version 2 Michael Karow Berlin University of Technology karow@math.tu-berlin.de October 2, 2008 1 Notation, basic notions and facts 1.1 Subspaces, range and
More informationME 132, Fall 2015, Quiz # 2
ME 132, Fall 2015, Quiz # 2 # 1 # 2 # 3 # 4 # 5 # 6 Total NAME 14 10 8 6 14 8 60 Rules: 1. 2 sheets of notes allowed, 8.5 11 inches. Both sides can be used. 2. Calculator is allowed. Keep it in plain view
More informationRobust Control 2 Controllability, Observability & Transfer Functions
Robust Control 2 Controllability, Observability & Transfer Functions Harry G. Kwatny Department of Mechanical Engineering & Mechanics Drexel University /26/24 Outline Reachable Controllability Distinguishable
More informationPreconditioned inverse iteration and shift-invert Arnoldi method
Preconditioned inverse iteration and shift-invert Arnoldi method Melina Freitag Department of Mathematical Sciences University of Bath CSC Seminar Max-Planck-Institute for Dynamics of Complex Technical
More informationAPPLIED LINEAR ALGEBRA
APPLIED LINEAR ALGEBRA Giorgio Picci November 24, 2015 1 Contents 1 LINEAR VECTOR SPACES AND LINEAR MAPS 10 1.1 Linear Maps and Matrices........................... 11 1.2 Inverse of a Linear Map............................
More informationModel reduction of nonlinear circuit equations
Model reduction of nonlinear circuit equations Tatjana Stykel Technische Universität Berlin Joint work with T. Reis and A. Steinbrecher BIRS Workshop, Banff, Canada, October 25-29, 2010 T. Stykel. Model
More informationStability preserving post-processing methods applied in the Loewner framework
Ion Victor Gosea and Athanasios C. Antoulas (Jacobs University Bremen and Rice University May 11, 2016 Houston 1 / 20 Stability preserving post-processing methods applied in the Loewner framework Ion Victor
More informationMay 9, 2014 MATH 408 MIDTERM EXAM OUTLINE. Sample Questions
May 9, 24 MATH 48 MIDTERM EXAM OUTLINE This exam will consist of two parts and each part will have multipart questions. Each of the 6 questions is worth 5 points for a total of points. The two part of
More informationECE 275A Homework #3 Solutions
ECE 75A Homework #3 Solutions. Proof of (a). Obviously Ax = 0 y, Ax = 0 for all y. To show sufficiency, note that if y, Ax = 0 for all y, then it must certainly be true for the particular value of y =
More informationLinear System Theory
Linear System Theory Wonhee Kim Chapter 6: Controllability & Observability Chapter 7: Minimal Realizations May 2, 217 1 / 31 Recap State space equation Linear Algebra Solutions of LTI and LTV system Stability
More informationDESIGN OF OBSERVERS FOR SYSTEMS WITH SLOW AND FAST MODES
DESIGN OF OBSERVERS FOR SYSTEMS WITH SLOW AND FAST MODES by HEONJONG YOO A thesis submitted to the Graduate School-New Brunswick Rutgers, The State University of New Jersey In partial fulfillment of the
More informationSolutions to Review Problems for Chapter 6 ( ), 7.1
Solutions to Review Problems for Chapter (-, 7 The Final Exam is on Thursday, June,, : AM : AM at NESBITT Final Exam Breakdown Sections % -,7-9,- - % -9,-,7,-,-7 - % -, 7 - % Let u u and v Let x x x x,
More informationControllability, Observability, Full State Feedback, Observer Based Control
Multivariable Control Lecture 4 Controllability, Observability, Full State Feedback, Observer Based Control John T. Wen September 13, 24 Ref: 3.2-3.4 of Text Controllability ẋ = Ax + Bu; x() = x. At time
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 informationReduced Order Methods for Large Scale Riccati Equations
Reduced Order Methods for Large Scale Riccati Equations Miroslav Karolinov Stoyanov Dissertation submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment
More informationPole placement control: state space and polynomial approaches Lecture 2
: state space and polynomial approaches Lecture 2 : a state O. Sename 1 1 Gipsa-lab, CNRS-INPG, FRANCE Olivier.Sename@gipsa-lab.fr www.gipsa-lab.fr/ o.sename -based November 21, 2017 Outline : a state
More information