The rational Krylov subspace for parameter dependent systems. V. Simoncini
|
|
- Erik Blake
- 5 years ago
- Views:
Transcription
1 The rational Krylov subspace for parameter dependent systems V. Simoncini Dipartimento di Matematica, Università di Bologna 1
2 Given the continuous-time system Motivation. Model Order Reduction Σ = A B C, A R n n, B,C T tall Analyse the construction of a reduced system Σ = Ã B, Ã of size m n C so that all relevant properties are captured by Σ 2
3 Motivation (cont d): Linear Dynamical Systems Time-invariant linear system: x (t) = Ax(t)+Bu(t), x(0) = x 0 y(t) = Cx(t) Approximation of parameter-dependent systems Approximation of the matrix Transfer function Other problems (e.g., Matrix equations) Emphasis: A large dimensions, W(A) C 3
4 Projection methods: the general idea Given space K R n of size O(m) and (orthonormal) basis V m, A A m = V T mav m B B m = V T mb C C m = CV m Σ = A m B m C m 4
5 Projection methods: the space Choices of K in the literature: Standard Krylov subspace: K m (A,B) = Range{[B,AB,...,A m 1 B]} Shift-Invert Krylov subspace: K m ((A σi) 1,B) = span{b,(a σi) 1 B,...,(A σi) (m 1) B}; often σ = 0 Extended Krylov subspace: EK m (A,B) = K m (A,B)+K m (A 1,A 1 B) Rational Krylov subspace: K m (A,B,s) = span{(a s 1 I) 1 B,(A s 2 I) 1 B,...,(A s m I) 1 B} in the past, s = [s 1,...,s m ] a-priori 5
6 Projection methods: the space Choices of K in the literature: Standard Krylov subspace: K m (A,B) = Range{[B,AB,...,A m 1 B]} Shift-Invert Krylov subspace: K m ((A σi) 1,B) = span{b,(a σi) 1 B,...,(A σi) (m 1) B}; often σ = 0 Extended Krylov subspace: EK m (A,B) = K m (A,B)+K m (A 1,A 1 B) Rational Krylov subspace: K m (A,B,s) = Range{[(A s 1 I) 1 B,(A s 2 I) 1 B,...,(A s m I) 1 B]} usually s = [s 1,...,s m ] a-priori 6
7 Projection methods: the space Choices of K in the literature: Standard Krylov subspace: K m (A,B) = Range{[B,AB,...,A m 1 B]} Shift-Invert Krylov subspace: K m ((A σi) 1,B) = Range{[B,(A σi) 1 B,...,(A σi) (m 1) B]}; often σ = 0 Extended Krylov subspace: EK m (A,B) = K m (A,B)+K m (A 1,A 1 B) Rational Krylov subspace: K m (A,B,s) = Range{[(A s 1 I) 1 B,(A s 2 I) 1 B,...,(A s m I) 1 B]} usually s = [s 1,...,s m ] a-priori 7
8 Projection methods: the space Choices of K in the literature: Standard Krylov subspace: K m (A,B) = Range{[B,AB,...,A m 1 B]} Shift-Invert Krylov subspace: K m ((A σi) 1,B) = Range{[B,(A σi) 1 B,...,(A σi) (m 1) B]}; often σ = 0 Extended Krylov subspace: EK m (A,B) = K m (A,B)+K m (A 1,A 1 B) Rational Krylov subspace: K m (A,B,s) = Range{[(A s 1 I) 1 B,(A s 2 I) 1 B,...,(A s m I) 1 B]} usually s = [s 1,...,s m ] a-priori 8
9 Projection methods: the space Choices of K in the literature: Standard Krylov subspace: K m (A,B) = Range{[B,AB,...,A m 1 B]} Shift-Invert Krylov subspace: K m ((A σi) 1,B) = Range{[B,(A σi) 1 B,...,(A σi) (m 1) B]}; often σ = 0 Extended Krylov subspace: EK m (A,B) = K m (A,B)+K m (A 1,A 1 B) Rational Krylov subspace: K m (A,B,s) = Range{[(A s 1 I) 1 B,(A s 2 I) 1 B,...,(A s m I) 1 B]} in the past, s = [s 1,...,s m ] a-priori 9
10 Parameter-dependent linear systems x = f σ (A)b x K Here, f σ (λ) = (λ+σ) 1. A different perspective: Shifted linear systems. Many shifts in a wide range (e.g., Structural dynamics, electromagn.) (A+σ j I)x = v, σ j [α,β], large interval,j = O(100) Few (possibly complex) shifts (e.g., quadrature formulas) z = k ω j (A σ j I) 1 v j=1 Transfer function h(σ) = c (A iσi) 1 b, σ [α,β] 10
11 Parameter-dependent linear systems x = f σ (A)b x K Here, f σ (λ) = (λ+σ) 1. A different perspective: Shifted linear systems. Many shifts in a wide range (e.g., Structural dynamics, electromagn.) (A+σ j I)x = v, σ j [α,β], large interval,j = O(100) Few (possibly complex) shifts (e.g., quadrature formulas) z = k ω j (A σ j I) 1 v j=1 Transfer function h(σ) = c T (A iσi) 1 b, σ [α,β] 11
12 Shifted systems Approximation. Defining T m = V mav m, x x m = V m f σ (T m )e 1 = V m (T m +σi) 1 e 1 Galerkin condition: r m := b (A+σI)x m K. (standard Galerkin-type approximation for shifted systems, cf. FOM, CG,...) Key fact: A single K for all shifted systems. Note: Solve systems with A to approximate (A+σI) 1 v Added feature: restarting made easy 12
13 A numerical example Matrix A discretization of L(u) = u+50(x+y)(u x +u y ) b = 1, 500 shift in [0,5] ( backslash takes 2.52 secs for each system of size ) n subspace std Krylov Extended Krylov dimension CPU time (#cycles) CPU time (#cycles) (41) 0.65 (4) (14) 0.63 (2) (49) 1.96 (7) (27) 1.75 (3) (>300) (13) (97) (6) 13
14 Sylvester-type equations In shifted systems, the right-hand side may depend on the parameter: B = [b(σ 1 ),...,b(σ s )] AX +XS = B, S = diag(σ 1,...,σ s ) (special case of more general Sylvester equation) Generate approximation space starting with B = V 1 β 0 (V 1 orthnormal columns, β 0 possibly rectangular) 14
15 A numerical example. Direct frequency analysis in structural dynamics (K σ 2 M)x(σ) = b(σ), size 3627 K complex symmetric, B = [b(σ 1 ),...,b(σ s )] of rank 2. Simultaneous solution: K X +MXS = B, S = diag(σ1,...,σ 2 s). 2 For M real sym nonsingular, M = LL T and (L 1 K L T ) X + XS = L 1 B, X = UX with L 1 K L T complex symmetric bilinear form x T y 15
16 A numerical example. Direct frequency analysis in structural dynamics Comparison with: Q(σ)x(σ) = b(σ), Q(σ) = K σ 2 M for each σ, (complex symmetric CG method, preconditioned with LDL with drop. tol ) Sparse Direct Complex sym Extended Krylov Extended Krylov #σ Solver CG Direct solves K Iter.solves K (108) 1.59 (36) 8.00 (36) (108) 2.12 (40) 9.69 (40) 16
17 Transfer function approximation A with field of values in C h(ω) = c(a iωi) 1 b, ω [α,β] Given space K of size m and V m s.t. K=range(V m ), h(ω) cv m (V T mav m iωi) 1 (V T mb) Next: Classical benchmark experiment with Standard, Shift-invert and Extended Krylov 17
18 An example: CD Player, n = 120 h(ω) = C 2,: (A iωi) 1 B :,1 m = 20 m = true 10 2 true 10 2 Krylov extended invert Krylov Krylov extended invert Krylov
19 Rational Krylov Subspace Method. Choice of poles K m (A,B,s) = Range{[(A s 1 I) 1 B,(A s 2 I) 1 B,...,(A s m I) 1 B]} cf. General discussion in Antoulas, Various attempts: Gallivan, Grimme, Van Dooren (1996, ad-hoc poles) Penzl ( , ADI shifts - preprocessing, Ritz values)... Sabino ( tuning within preprocessing) IRKA Gugercin, Antoulas, Beattie (2008) 19
20 A new adaptive choice of poles for RKSM K m (A,b,s) = span{(a s 1 I) 1 b,(a s 2 I) 1 b,...,(a s m I) 1 b} s = [s 1,...,s m ] to be chosen sequentially (no fixed m) The fundamental idea: Assume you wish to solve (A si)x = b with a Galerkin procedure in K m (A,b,s). Let V m be orth. basis. The residual satisfies: b (A si)x m = r m(a)b m r m (s), r z λ j m(z) = z s j with λ j = eigs(v T mav m ). Moreover, r m (A)b = min θ 1,...,θ m j=1 m (A θ j I)(A s j I) 1 b j=1 20
21 A new adaptive choice of poles for RKSM. Cont d r m (z) = m j=1 z λ j z s j, λ j = eigs(v mav m ) For A symmetric: ( s m+1 := arg max s [ λ max, λ min ] ) 1 r m (s) [λ min,λ max ] spec(a) (Druskin, Lieberman, Zaslavski (SISC 2010)) For A nonsymmetric: ( ) 1 s m+1 := arg max s S m r m (s) where S m C + approximately encloses the eigenvalues of A 21
22 Example of S m. CD Player, m = 12 S m : encloses mirrored current Ritz values: -eigs(v T mav m ) and initial estimates: s (0) 1 = 0.1, s (0) 2,3 = 900±i x imaginary part real part poles + -eigs(a) S m 22
23 Transfer function evaluation. FOM Data set h(ω) 10 0 true Extended Krylov std Krylov invert Krylov rational Krylov h(ω) h approx (ω) Extended Krylov std Krylov invert Krylov rational Krylov frequency ω frequency ω m = 20. A of size 1006 (normal matrix), s (1) 0 = 1, s (2) 0 =
24 Transfer function evaluation. Flow Data set. h(ω) = c(a iωe) 1 b h(ω) h(ω) h approx (ω) extended invert arnoldi rational krylov true extended invert arnoldi rational krylov m = 20. A,E of size 9669 (nonsym) s (1) 0 = A /(condest(a) E F ), s (1) 0 arg(max R(eigs(A))) (all real poles) 24
25 Understanding the Rational Krylov subspace. State of the art. Shift selection. - Historically, a-priori selection (possibly with pre-processing) - Given A symmetric, asymptotically optimal rational space for ir by using an equidistributed nested sequence of real shifts (from classical Zolotaryov sol n) Druskin, Knizhnerman, Zaslavsky (SISC 2009) - For f(a)b, variants of adaptive selection (Güttel-Knizhnerman, tr 2012) Convergence Analysis. Mostly very recent, based on classical potential theory. (Beckermann, Druskin, Eiermann, Ernst, Güttel, Knizhnerman, Lieberman, Reichel, Simoncini, Vandebril, Zaslavsky) 25
26 Projection methods for matrix equations F(X) = 0 linear or quadratic equations, such as: AX +XA T +BB T = 0 AX +XB +C = 0 Lyapunov equation Sylvester equation AX +XA T XBB T X +C T C = 0 Riccati equation With an approximation in the space K with basis V m V m, (Use the Kronecker formulation for the derivation only) residual K VmF(X T m )V m = 0 where X m is the matrix approximation 26
27 The Lyapunov matrix equation AX +XA T +BB T = 0 Approximation by projection: K of dim. m, V m orthonormal basis. X X m = V m YV T m (V T mav m )Y +Y(V T ma T V m )+V T mbb T V m = 0 With K being the Krylov subspace (Saad, 90, Jaimoukha & Kasenally, 94), the Extended Krylov subspace (Simoncini, 07), the adaptive Rational Krylov subspace (Druskin & Simoncini, 11) 27
28 Long term Competitor: The Lyapunov equation. Cont d. Alternating Directions Implicit iteration (ADI) (large number of contributions, see, e.g., Benner, Penzl, etc.) problem: computation of parameters Extended Krylov Subspace method numerically outperforms ADI in general Rational Krylov Subspace is at least as good as ADI (Druskin, Knizhnerman, Simoncini, 11, Beckermann 11, theoretical arguments) Convergence Analysis Much is now known on convergence (in the last 5 years!) 28
29 Conclusions and outlook Projection-type methods still have great potential Second generation Krylov spaces can attack harder problem than standard linear systems Quadratic problems (Heyouni, Jbilou, 09). New very promising results for Riccati eqn (Simoncini, Szyld) References: V. Simoncini, A new iterative method for solving large-scale Lyapunov matrix equations. SIAM J. Scient. Comput., v.29, n.3 (2007), pp V. Simoncini, The Extended Krylov subspace for parameter dependent systems. Applied Num. Math. v.60 n.5 (2010) V. Druskin and V. Simoncini, Adaptive rational Krylov subspaces for large-scale dynamical systems. Systems and Control Letters,
Adaptive 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 informationOn the numerical solution of large-scale linear matrix equations. V. Simoncini
On the numerical solution of large-scale linear matrix equations V. Simoncini Dipartimento di Matematica, Università di Bologna (Italy) valeria.simoncini@unibo.it 1 Some matrix equations Sylvester matrix
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 informationADAPTIVE RATIONAL KRYLOV SUBSPACES FOR LARGE-SCALE DYNAMICAL SYSTEMS. 1. Introduction. The time-invariant linear system
ADAPTIVE RATIONAL KRYLOV SUBSPACES FOR LARGE-SCALE DYNAMICAL SYSTEMS V. DRUSKIN AND V. SIMONCINI Abstract. The rational Krylov space is recognized as a powerful tool within Model Order Reduction techniques
More informationComputational methods for large-scale matrix equations and application to PDEs. V. Simoncini
Computational methods for large-scale matrix equations and application to PDEs V. Simoncini Dipartimento di Matematica Alma Mater Studiorum - Università di Bologna valeria.simoncini@unibo.it 1 Some matrix
More informationComputational methods for large-scale matrix equations and application to PDEs. V. Simoncini
Computational methods for large-scale matrix equations and application to PDEs V. Simoncini Dipartimento di Matematica, Università di Bologna valeria.simoncini@unibo.it 1 Some matrix equations Sylvester
More informationEXTENDED KRYLOV SUBSPACE FOR PARAMETER DEPENDENT SYSTEMS
EXTENDED KRYLOV SUBSPACE FOR PARAMETER DEPENDENT SYSTEMS V. SIMONCINI Abstract. The Extended Krylov Subspace has recently received considerable attention as a powerful tool for matrix function evaluations
More informationEXTENDED KRYLOV SUBSPACE FOR PARAMETER DEPENDENT SYSTEMS
EXTENDED KRYLOV SUBSPACE FOR PARAMETER DEPENDENT SYSTEMS V. SIMONCINI Abstract. The Extended Krylov Subspace has recently received considerable attention as a powerful tool for matrix function evaluations
More informationComputational methods for large-scale matrix equations: recent advances and applications. V. Simoncini
Computational methods for large-scale matrix equations: recent advances and applications V. Simoncini Dipartimento di Matematica Alma Mater Studiorum - Università di Bologna valeria.simoncini@unibo.it
More informationApproximation of functions of large matrices. Part I. Computational aspects. V. Simoncini
Approximation of functions of large matrices. Part I. Computational aspects V. Simoncini Dipartimento di Matematica, Università di Bologna and CIRSA, Ravenna, Italy valeria@dm.unibo.it 1 The problem Given
More informationON THE NUMERICAL SOLUTION OF LARGE-SCALE RICCATI EQUATIONS
ON THE NUMERICAL SOLUTION OF LARGE-SCALE RICCATI EQUATIONS VALERIA SIMONCINI, DANIEL B. SZYLD, AND MARLLINY MONSALVE Abstract. The inexact Newton-Kleinman method is an iterative scheme for numerically
More informationRecent advances in approximation using Krylov subspaces. V. Simoncini. Dipartimento di Matematica, Università di Bologna.
Recent advances in approximation using Krylov subspaces V. Simoncini Dipartimento di Matematica, Università di Bologna and CIRSA, Ravenna, Italy valeria@dm.unibo.it 1 The framework It is given an operator
More informationu(t) = Au(t), u(0) = B, (1.1)
ADAPTIVE TANGENTIAL INTERPOLATION IN RATIONAL KRYLOV SUBSPACES FOR MIMO MODEL REDUCTION V. DRUSKIN, V. SIMONCINI, AND M. ZASLAVSKY Abstract. Model reduction approaches have shown to be powerful techniques
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 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 informationOn Solving Large Algebraic. Riccati Matrix Equations
International Mathematical Forum, 5, 2010, no. 33, 1637-1644 On Solving Large Algebraic Riccati Matrix Equations Amer Kaabi Department of Basic Science Khoramshahr Marine Science and Technology University
More informationAn iterative SVD-Krylov based method for model reduction of large-scale dynamical systems
Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference 2005 Seville, Spain, December 12-15, 2005 WeC10.4 An iterative SVD-Krylov based method for model reduction
More informationValeria Simoncini and Daniel B. Szyld. Report October 2009
Interpreting IDR as a Petrov-Galerkin method Valeria Simoncini and Daniel B. Szyld Report 09-10-22 October 2009 This report is available in the World Wide Web at http://www.math.temple.edu/~szyld INTERPRETING
More informationEfficient iterative algorithms for linear stability analysis of incompressible flows
IMA Journal of Numerical Analysis Advance Access published February 27, 215 IMA Journal of Numerical Analysis (215) Page 1 of 21 doi:1.193/imanum/drv3 Efficient iterative algorithms for linear stability
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 informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 15-05 Induced Dimension Reduction method for solving linear matrix equations R. Astudillo and M. B. van Gijzen ISSN 1389-6520 Reports of the Delft Institute of Applied
More informationarxiv: v2 [math.na] 19 Oct 2014
FROM LOW-RANK APPROXIMATION TO AN EFFICIENT RATIONAL KRYLOV SUBSPACE METHOD FOR THE LYAPUNOV EQUATION D. A. KOLESNIKOV AND I. V. OSELEDETS arxiv:141.3335v2 [math.na] 19 Oct 214 Abstract. We propose a new
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 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 informationKrylov Subspace Type Methods for Solving Projected Generalized Continuous-Time Lyapunov Equations
Krylov Subspace Type Methods for Solving Proected Generalized Continuous-Time Lyapunov Equations YUIAN ZHOU YIQIN LIN Hunan University of Science and Engineering Institute of Computational Mathematics
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 informationOn ADI Method for Sylvester Equations
On ADI Method for Sylvester Equations Ninoslav Truhar Ren-Cang Li Technical Report 2008-02 http://www.uta.edu/math/preprint/ On ADI Method for Sylvester Equations Ninoslav Truhar Ren-Cang Li February 8,
More informationComputational methods for large-scale linear matrix equations and application to FDEs. V. Simoncini
Computational methods for large-scale linear matrix equations and application to FDEs V. Simoncini Dipartimento di Matematica, Università di Bologna valeria.simoncini@unibo.it Joint work with: Tobias Breiten,
More informationUniversity of Maryland Department of Computer Science TR-4975 University of Maryland Institute for Advanced Computer Studies TR March 2011
University of Maryland Department of Computer Science TR-4975 University of Maryland Institute for Advanced Computer Studies TR-2011-04 March 2011 LYAPUNOV INVERSE ITERATION FOR IDENTIFYING HOPF BIFURCATIONS
More informationLow Rank Approximation Lecture 7. Daniel Kressner Chair for Numerical Algorithms and HPC Institute of Mathematics, EPFL
Low Rank Approximation Lecture 7 Daniel Kressner Chair for Numerical Algorithms and HPC Institute of Mathematics, EPFL daniel.kressner@epfl.ch 1 Alternating least-squares / linear scheme General setting:
More informationCONVERGENCE ANALYSIS OF PROJECTION METHODS FOR THE NUMERICAL SOLUTION OF LARGE LYAPUNOV EQUATIONS
CONVERGENCE ANALYSIS OF PROJECTION METHODS FOR THE NUMERICAL SOLUTION OF LARGE LYAPUNOV EQUATIONS V. SIMONCINI AND V. DRUSKIN Abstract. The numerical solution of large-scale continuous-time Lyapunov matrix
More informationCONVERGENCE ANALYSIS OF THE EXTENDED KRYLOV SUBSPACE METHOD FOR THE LYAPUNOV EQUATION
CONVERGENCE ANALYSIS OF THE EXTENDED KRYLOV SUBSPACE METHOD FOR THE LYAPUNOV EQUATION L. KNIZHNERMAN AND V. SIMONCINI Abstract. The Extended Krylov Subspace Method has recently arisen as a competitive
More informationOn the Superlinear Convergence of MINRES. Valeria Simoncini and Daniel B. Szyld. Report January 2012
On the Superlinear Convergence of MINRES Valeria Simoncini and Daniel B. Szyld Report 12-01-11 January 2012 This report is available in the World Wide Web at http://www.math.temple.edu/~szyld 0 Chapter
More informationModel Order Reduction by Approximate Balanced Truncation: A Unifying Framework
at 8/2013 Model Order Reduction by Approximate Balanced Truncation: A Unifying Framework Modellreduktion durch approximatives Balanciertes Abschneiden: eine vereinigende Formulierung Thomas Wolf, Heiko
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 informationInexact Solves in Krylov-based Model Reduction
Inexact Solves in Krylov-based Model Reduction Christopher A. Beattie and Serkan Gugercin Abstract We investigate the use of inexact solves in a Krylov-based model reduction setting and present the resulting
More informationSolving Large-Scale Matrix Equations: Recent Progress and New Applications
19th Conference of the International Linear Algebra Society (ILAS) Seoul, August 6 9, 2014 Solving Large-Scale Matrix Equations: Recent Progress and New Applications Peter Benner Max Planck Institute for
More informationAN OVERVIEW OF MODEL REDUCTION TECHNIQUES APPLIED TO LARGE-SCALE STRUCTURAL DYNAMICS AND CONTROL MOTIVATING EXAMPLE INVERTED PENDULUM
Controls Lab AN OVERVIEW OF MODEL REDUCTION TECHNIQUES APPLIED TO LARGE-SCALE STRUCTURAL DYNAMICS AND CONTROL Eduardo Gildin (UT ICES and Rice Univ.) with Thanos Antoulas (Rice ECE) Danny Sorensen (Rice
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 informationThe Nullspace free eigenvalue problem and the inexact Shift and invert Lanczos method. V. Simoncini. Dipartimento di Matematica, Università di Bologna
The Nullspace free eigenvalue problem and the inexact Shift and invert Lanczos method V. Simoncini Dipartimento di Matematica, Università di Bologna and CIRSA, Ravenna, Italy valeria@dm.unibo.it 1 The
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 informationarxiv: v1 [cs.na] 25 May 2018
NUMERICAL METHODS FOR DIFFERENTIAL LINEAR MATRIX EQUATIONS VIA KRYLOV SUBSPACE METHODS M. HACHED AND K. JBILOU arxiv:1805.10192v1 [cs.na] 25 May 2018 Abstract. In the present paper, we present some numerical
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 informationPDEs, Matrix Functions and Krylov Subspace Methods
PDEs, Matrix Functions and Krylov Subspace Methods Oliver Ernst Institut für Numerische Mathematik und Optimierung TU Bergakademie Freiberg, Germany LMS Durham Symposium Computational Linear Algebra for
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 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 informationBlock Krylov Space Solvers: a Survey
Seminar for Applied Mathematics ETH Zurich Nagoya University 8 Dec. 2005 Partly joint work with Thomas Schmelzer, Oxford University Systems with multiple RHSs Given is a nonsingular linear system with
More informationPreconditioned multishift BiCG for H 2 -optimal model reduction. Mian Ilyas Ahmad, Daniel B. Szyld, and Martin B. van Gijzen
Preconditioned multishift BiCG for H 2 -optimal model reduction Mian Ilyas Ahmad, Daniel B. Szyld, and Martin B. van Gijzen Report 12-06-15 Department of Mathematics Temple University June 2012. Revised
More informationNested Krylov methods for shifted linear systems
Nested Krylov methods for shifted linear systems M. Baumann, and M. B. van Gizen Email: M.M.Baumann@tudelft.nl Delft Institute of Applied Mathematics Delft University of Technology Delft, The Netherlands
More informationDaniel B. Szyld and Jieyong Zhou. Report June 2016
Numerical solution of singular semi-stable Lyapunov equations Daniel B. Szyld and Jieyong Zhou Report 16-06-02 June 2016 Department of Mathematics Temple University Philadelphia, PA 19122 This report is
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 16-02 The Induced Dimension Reduction method applied to convection-diffusion-reaction problems R. Astudillo and M. B. van Gijzen ISSN 1389-6520 Reports of the Delft
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 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 informationAPPROXIMATION OF THE LINEAR THE BLOCK SHIFT-AND-INVERT KRYLOV SUBSPACE METHOD
Journal of Applied Analysis and Computation Volume 7, Number 4, November 2017, 1402 1416 Website:http://jaac-online.com/ DOI:10.11948/2017085 APPROXIMATION OF THE LINEAR COMBINATION OF ϕ-functions USING
More informationLecture 11: CMSC 878R/AMSC698R. Iterative Methods An introduction. Outline. Inverse, LU decomposition, Cholesky, SVD, etc.
Lecture 11: CMSC 878R/AMSC698R Iterative Methods An introduction Outline Direct Solution of Linear Systems Inverse, LU decomposition, Cholesky, SVD, etc. Iterative methods for linear systems Why? Matrix
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 informationThree-Dimensional Transient Electromagnetic Modeling Using Rational Krylov Methods
Geophys. J. Int. (0000) 000, 000 000 Three-Dimensional Transient Electromagnetic Modeling Using Rational Krylov Methods Ralph-Uwe Börner, Oliver G. Ernst, and Stefan Güttel Saturday 26 th July, 2014 SUMMARY
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 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 informationarxiv: v1 [math.na] 5 Jun 2017
A WEIGHTED GLOBAL GMRES ALGORITHM WITH DEFLATION FOR SOLVING LARGE SYLVESTER MATRIX EQUATIONS NAJMEH AZIZI ZADEH, AZITA TAJADDINI, AND GANG WU arxiv:1706.01176v1 [math.na] 5 Jun 2017 Abstract. The solution
More informationc 2017 Society for Industrial and Applied Mathematics
SIAM J. MATRIX ANAL. APPL. Vol. 38, No. 2, pp. 401 424 c 2017 Society for Industrial and Applied Mathematics PRECONDITIONED MULTISHIFT BiCG FOR H 2 -OPTIMAL MODEL REDUCTION MIAN ILYAS AHMAD, DANIEL B.
More informationLecture 3: Inexact inverse iteration with preconditioning
Lecture 3: Department of Mathematical Sciences CLAPDE, Durham, July 2008 Joint work with M. Freitag (Bath), and M. Robbé & M. Sadkane (Brest) 1 Introduction 2 Preconditioned GMRES for Inverse Power Method
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 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 informationAn Arnoldi Method for Nonlinear Symmetric Eigenvalue Problems
An Arnoldi Method for Nonlinear Symmetric Eigenvalue Problems H. Voss 1 Introduction In this paper we consider the nonlinear eigenvalue problem T (λ)x = 0 (1) where T (λ) R n n is a family of symmetric
More informationBALANCING AS A MOMENT MATCHING PROBLEM
BALANCING AS A MOMENT MATCHING PROBLEM T.C. IONESCU, J.M.A. SCHERPEN, O.V. IFTIME, AND A. ASTOLFI Abstract. In this paper, we treat a time-domain moment matching problem associated to balanced truncation.
More informationSOLVING SPARSE LINEAR SYSTEMS OF EQUATIONS. Chao Yang Computational Research Division Lawrence Berkeley National Laboratory Berkeley, CA, USA
1 SOLVING SPARSE LINEAR SYSTEMS OF EQUATIONS Chao Yang Computational Research Division Lawrence Berkeley National Laboratory Berkeley, CA, USA 2 OUTLINE Sparse matrix storage format Basic factorization
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 informationMODEL-order reduction is emerging as an effective
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: REGULAR PAPERS, VOL. 52, NO. 5, MAY 2005 975 Model-Order Reduction by Dominant Subspace Projection: Error Bound, Subspace Computation, and Circuit Applications
More informationRational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
GAMM-Mitteilungen, 28/3/2012 Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection Stefan Güttel 1, 1 University of Oxford, Mathematical Institute, 24 29 St Giles,
More informationFinding Rightmost Eigenvalues of Large, Sparse, Nonsymmetric Parameterized Eigenvalue Problems
Finding Rightmost Eigenvalues of Large, Sparse, Nonsymmetric Parameterized Eigenvalue Problems AMSC 663-664 Final Report Minghao Wu AMSC Program mwu@math.umd.edu Dr. Howard Elman Department of Computer
More informationPROJECTED GMRES AND ITS VARIANTS
PROJECTED GMRES AND ITS VARIANTS Reinaldo Astudillo Brígida Molina rastudillo@kuaimare.ciens.ucv.ve bmolina@kuaimare.ciens.ucv.ve Centro de Cálculo Científico y Tecnológico (CCCT), Facultad de Ciencias,
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 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 informationIterative methods for Linear System of Equations. Joint Advanced Student School (JASS-2009)
Iterative methods for Linear System of Equations Joint Advanced Student School (JASS-2009) Course #2: Numerical Simulation - from Models to Software Introduction In numerical simulation, Partial Differential
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 informationSolving Sparse Linear Systems: Iterative methods
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccs Lecture Notes for Unit VII Sparse Matrix Computations Part 2: Iterative Methods Dianne P. O Leary c 2008,2010
More informationSolving Sparse Linear Systems: Iterative methods
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit VII Sparse Matrix Computations Part 2: Iterative Methods Dianne P. O Leary
More informationON THE GLOBAL KRYLOV SUBSPACE METHODS FOR SOLVING GENERAL COUPLED MATRIX EQUATIONS
ON THE GLOBAL KRYLOV SUBSPACE METHODS FOR SOLVING GENERAL COUPLED MATRIX EQUATIONS Fatemeh Panjeh Ali Beik and Davod Khojasteh Salkuyeh, Department of Mathematics, Vali-e-Asr University of Rafsanjan, Rafsanjan,
More informationIterative methods for Linear System
Iterative methods for Linear System JASS 2009 Student: Rishi Patil Advisor: Prof. Thomas Huckle Outline Basics: Matrices and their properties Eigenvalues, Condition Number Iterative Methods Direct and
More informationANY FINITE CONVERGENCE CURVE IS POSSIBLE IN THE INITIAL ITERATIONS OF RESTARTED FOM
Electronic Transactions on Numerical Analysis. Volume 45, pp. 133 145, 2016. Copyright c 2016,. ISSN 1068 9613. ETNA ANY FINITE CONVERGENCE CURVE IS POSSIBLE IN THE INITIAL ITERATIONS OF RESTARTED FOM
More informationGeneralized MINRES or Generalized LSQR?
Generalized MINRES or Generalized LSQR? Michael Saunders Systems Optimization Laboratory (SOL) Institute for Computational Mathematics and Engineering (ICME) Stanford University New Frontiers in Numerical
More informationRational Krylov Methods for Model Reduction of Large-scale Dynamical Systems
Rational Krylov Methods for Model Reduction of Large-scale Dynamical Systems Serkan Güǧercin Department of Mathematics, Virginia Tech, USA Aerospace Computational Design Laboratory, Dept. of Aeronautics
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 informationNumerical Methods for Large-Scale Nonlinear Systems
Numerical Methods for Large-Scale Nonlinear Systems Handouts by Ronald H.W. Hoppe following the monograph P. Deuflhard Newton Methods for Nonlinear Problems Springer, Berlin-Heidelberg-New York, 2004 Num.
More informationRational Krylov methods for linear and nonlinear eigenvalue problems
Rational Krylov methods for linear and nonlinear eigenvalue problems Mele Giampaolo mele@mail.dm.unipi.it University of Pisa 7 March 2014 Outline Arnoldi (and its variants) for linear eigenproblems Rational
More informationRECURSION RELATIONS FOR THE EXTENDED KRYLOV SUBSPACE METHOD
RECURSION RELATIONS FOR THE EXTENDED KRYLOV SUBSPACE METHOD CARL JAGELS AND LOTHAR REICHEL Abstract. The evaluation of matrix functions of the form f(a)v, where A is a large sparse or structured symmetric
More informationAlgorithms that use the Arnoldi Basis
AMSC 600 /CMSC 760 Advanced Linear Numerical Analysis Fall 2007 Arnoldi Methods Dianne P. O Leary c 2006, 2007 Algorithms that use the Arnoldi Basis Reference: Chapter 6 of Saad The Arnoldi Basis How to
More informationSolution of eigenvalue problems. Subspace iteration, The symmetric Lanczos algorithm. Harmonic Ritz values, Jacobi-Davidson s method
Solution of eigenvalue problems Introduction motivation Projection methods for eigenvalue problems Subspace iteration, The symmetric Lanczos algorithm Nonsymmetric Lanczos procedure; Implicit restarts
More informationC M. A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching
M A C M Bergische Universität Wuppertal Fachbereich Mathematik und Naturwissenschaften Institute of Mathematical Modelling, Analysis and Computational Mathematics (IMACM) Preprint BUW-IMACM 16/08 Marcel
More informationarxiv: v1 [math.na] 19 Sep 2017
arxiv:179.6677v1 [math.na] 19 Sep 217 Balanced truncation for model order reduction of linear dynamical systems with quadratic outputs Roland Pulch 1 and Akil Narayan 2 1 Institute of Mathematics and Computer
More informationSummary of Iterative Methods for Non-symmetric Linear Equations That Are Related to the Conjugate Gradient (CG) Method
Summary of Iterative Methods for Non-symmetric Linear Equations That Are Related to the Conjugate Gradient (CG) Method Leslie Foster 11-5-2012 We will discuss the FOM (full orthogonalization method), CG,
More information4.8 Arnoldi Iteration, Krylov Subspaces and GMRES
48 Arnoldi Iteration, Krylov Subspaces and GMRES We start with the problem of using a similarity transformation to convert an n n matrix A to upper Hessenberg form H, ie, A = QHQ, (30) with an appropriate
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 informationAn Efficient Two-Level Preconditioner for Multi-Frequency Wave Propagation Problems
An Efficient Two-Level Preconditioner for Multi-Frequency Wave Propagation Problems M. Baumann, and M.B. van Gijzen Email: M.M.Baumann@tudelft.nl Delft Institute of Applied Mathematics Delft University
More informationAn Interpolation-Based Approach to the Optimal H Model Reduction
An Interpolation-Based Approach to the Optimal H Model Reduction Garret M. Flagg Dissertation submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment
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 informationIterative solvers for saddle point algebraic linear systems: tools of the trade. V. Simoncini
Iterative solvers for saddle point algebraic linear systems: tools of the trade V. Simoncini Dipartimento di Matematica, Università di Bologna and CIRSA, Ravenna, Italy valeria@dm.unibo.it 1 The problem
More informationModel Reduction of Inhomogeneous Initial Conditions
Model Reduction of Inhomogeneous Initial Conditions Caleb Magruder Abstract Our goal is to develop model reduction processes for linear dynamical systems with non-zero initial conditions. Standard model
More information