Adaptive rational block Arnoldi methods for model reductions in large-scale MIMO dynamical systems

In recent years, a great interest has been shown towards Krylov subspace techniques applied to model order reduction of large-scale dynamical systems. A special interest has been devoted to single-input single-output (SISO) systems by using moment matching techniques based on Arnoldi or Lanczos algorithms. In this paper, we consider multiple-input multiple-output (MIMO) dynamical systems and introduce the rational block Arnoldi process to design low order dynamical systems that are close in some sense to the original MIMO dynamical system. Rational Krylov subspace methods are based on the choice of suitable shifts that are selected a priori or adaptively. In this paper, we propose an adaptive selection of those shifts and show the efficiency of this appr oach in our numerical tests. We also give some new block Arnoldi-like relations that are used to propose an upper bound for the norm of the error on the transfer function. m ∈ R m×p , xm(t), ym(t) ∈ R m , and m≪ n, while maintaining the most relevant properties of

[1]  O. Widlund,et al.  Iterative solution of elliptic systems : and applications to the neutron diffusion equations of reactor physics , 1967 .

[2]  K. Glover All optimal Hankel-norm approximations of linear multivariable systems and their L, ∞ -error bounds† , 1984 .

[3]  Harold Greenspan,et al.  Iterative Solution of Elliptic Systems and Application to the Neutron Diffusion Equations of Reactor Physics , 1966 .

[4]  Vladimir Druskin,et al.  On Optimal Convergence Rate of the Rational Krylov Subspace Reduction for Electromagnetic Problems in Unbounded Domains , 2009, SIAM J. Numer. Anal..

[5]  Chad Lieberman,et al.  On Adaptive Choice of Shifts in Rational Krylov Subspace Reduction of Evolutionary Problems , 2010, SIAM J. Sci. Comput..

[6]  J. Koenderink Q… , 2014, Les noms officiels des communes de Wallonie, de Bruxelles-Capitale et de la communaute germanophone.

[7]  Thilo Penzl,et al.  A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations , 1998, SIAM J. Sci. Comput..

[8]  K. Glover,et al.  A characterization of all solutions to the four block general distance problem , 1991 .

[9]  Paul Van Dooren,et al.  Model reduction of state space systems via an implicitly restarted Lanczos method , 1996, Numerical Algorithms.

[10]  Serkan Gugercin,et al.  H2 Model Reduction for Large-Scale Linear Dynamical Systems , 2008, SIAM J. Matrix Anal. Appl..

[11]  M. Heyouni,et al.  AN EXTENDED BLOCK ARNOLDI ALGORITHM FOR LARGE-SCALE SOLUTIONS OF THE CONTINUOUS-TIME ALGEBRAIC RICCATI EQUATI ON ∗ , 2008 .

[12]  Lothar Reichel,et al.  The extended Krylov subspace method and orthogonal Laurent polynomials , 2009 .

[13]  Eugene L. Wachspress The ADI minimax problem for complex spectra , 1990 .

[14]  Khalide Jbilou,et al.  Matrix Krylov subspace methods for large scale model reduction problems , 2006, Appl. Math. Comput..

[15]  B. Moore Principal component analysis in linear systems: Controllability, observability, and model reduction , 1981 .

[16]  Eric James Grimme,et al.  Krylov Projection Methods for Model Reduction , 1997 .

[17]  Valeria Simoncini,et al.  Adaptive rational Krylov subspaces for large-scale dynamical systems , 2011, Syst. Control. Lett..

[18]  Lyapunov Equations KRYLOV SUBSPACE METHODS FOR SOLVING LARGE , 1994 .

[19]  Axel Ruhe The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices , 1994 .

[20]  Axel Ruhe Rational Krylov sequence methods for eigenvalue computation , 1984 .

[21]  Z. Bai Krylov subspace techniques for reduced-order modeling of large-scale dynamical systems , 2002 .

[22]  Y. Shamash Stable reduced-order models using Padé-type approximations , 1974 .

[23]  Zhaojun Bai,et al.  Error Estimation of the Padé Approximation of Transfer Functions via the Lanczos Process , 1998 .

[24]  Axel Ruhe,et al.  Rational Krylov for eigenvalue computation and model order reduction , 2006 .

[25]  Valeria Simoncini,et al.  A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations , 2007, SIAM J. Sci. Comput..

[26]  Paul Van Dooren,et al.  A rational Lanczos algorithm for model reduction , 1996, Numerical Algorithms.

[27]  Abderrahman Bouhamidi,et al.  A preconditioned block Arnoldi method for large Sylvester matrix equations , 2013, Numer. Linear Algebra Appl..

[28]  I. Jaimoukha,et al.  Adaptive Rational Interpolation: Arnoldi and Lanczos-like Equations , 2008, Eur. J. Control.

[29]  Peter Benner,et al.  On the ADI method for Sylvester equations , 2009, J. Comput. Appl. Math..