Model-order reductions for MIMO systems using global Krylov subspace methods

Authors:
Chia-Chi Chu;Ming-Hong Lai;Wu-Shiung Feng
Affiliations:
Department of Electrical Engineering, National Tsing Hua University, 101 Sec. 2, Kuang-Fu Road, Hsinchu 30013, Taiwan, ROC;Graduate Institute of Electronic Engineering, Chang Gung University, No. 259, Wen-Hwa 1st Road, Kwei-Shan, Tao-Yuan 333, Taiwan, ROC;Graduate Institute of Electronic Engineering, Chang Gung University, No. 259, Wen-Hwa 1st Road, Kwei-Shan, Tao-Yuan 333, Taiwan, ROC
Venue:
Mathematics and Computers in Simulation
Year:
2008

Citing 5
Cited 1

Global FOM and GMRES algorithms for matrix equations

Applied Numerical Mathematics
Interconnect Analysis and Synthesis

Interconnect Analysis and Synthesis
The Multiple Point Global Lanczos Method for Multiple-Inputs Multiple-Outputs Interconnect Order Reductions

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
PRIMA: passive reduced-order interconnect macromodeling algorithm

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Efficient linear circuit analysis by Pade approximation via the Lanczos process

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Structure preserving model-order reductions of MIMO second-order systems using Arnoldi methods

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents theoretical foundations of global Krylov subspace methods for model order reductions. This method is an extension of the standard Krylov subspace method for multiple-inputs multiple-outputs (MIMO) systems. By employing the congruence transformation with global Krylov subspaces, both one-sided Arnoldi and two-sided Lanczos oblique projection methods are explored for both single expansion point and multiple expansion points. In order to further reduce the computational complexity for multiple expansion points, adaptive-order multiple points moment matching algorithms, or the so-called rational Krylov space method, are also studied. Two algorithms, including the adaptive-order rational global Arnoldi (AORGA) algorithm and the adaptive-order global Lanczos (AOGL) algorithm, are developed in detail. Simulations of practical dynamical systems will be conducted to illustrate the feasibility and the efficiency of proposed methods.