Oblique Production Methods for Large Scale Model Reduction
- 1 April 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 16 (2) , 602-627
- https://doi.org/10.1137/S0895479893250740
Abstract
The aim of this paper is to consider approximating a linear transfer function $F( s )$ of McMillan degree N, by one of McMillan degree m in which $N \gg m$ and where N is large. Krylov subspace methods are employed to construct bases to parts of the controllability and observability subspaces associated with the state space realisation of $F( s )$. Low rank approximate grammians are computed via the solutions to low dimensional Lyapunov equations and computable expressions for the approximation errors incurred are derived. We show that the low rank approximate grammians are the exact grammians to a perturbed linear system in which the perturbation is restricted to the transition matrix, and furthermore, this perturbation has at most rank = 2. This paper demonstrates that this perturbed linear system is equivalent to a low dimensional linear system with state dimension no greater than m. Finally, exact low dimensional expressions for the $\mathcal{L}^\infty $ norm of the errors are derived. The model reduction of discrete time linear systems is considered via the use of the same Krylov schemes. Finally, the behaviour of these algorithms is illustrated on two large scale examples.
Keywords
This publication has 11 references indexed in Scilit:
- Krylov Subspace Methods for Solving Large Lyapunov EquationsSIAM Journal on Numerical Analysis, 1994
- Perturbation theory and backward error forAX−XB=CBIT Numerical Mathematics, 1993
- Reduction to Tridiagonal Form and Minimal RealizationsSIAM Journal on Matrix Analysis and Applications, 1992
- Direct block tridiagonalization of single-input single-output systemsSystems & Control Letters, 1992
- The nonsymmetric Lanczos algorithm and controllabilitySystems & Control Letters, 1991
- The Lanczos-Arnoldi algorithm and controllabilitySystems & Control Letters, 1984
- All optimal Hankel-norm approximations of linear multivariable systems and theirL,∞-error bounds†International Journal of Control, 1984
- Principal component analysis in linear systems: Controllability, observability, and model reductionIEEE Transactions on Automatic Control, 1981
- On the Rates of Convergence of the Lanczos and the Block-Lanczos MethodsSIAM Journal on Numerical Analysis, 1980
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]Communications of the ACM, 1972