Oblique Production Methods for Large Scale Model Reduction TeX Export

@article{citeulike:2868797, 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.}, author = {Jaimoukha, Imad M. and Kasenally, Ebrahim M.}, citeulike-article-id = {2868797}, citeulike-linkout-0 = {http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal&id=SJMAEL000016000002000602000001&idtype=cvips&gifs=yes}, citeulike-linkout-1 = {http://link.aip.org/link/?SML/16/602}, citeulike-linkout-2 = {http://dx.doi.org/10.1137/S0895479893250740}, doi = {10.1137/S0895479893250740}, journal = {SIAM Journal on Matrix Analysis and Applications}, keywords = {arnoldi, equation, iterative, krylov, lanczos, large, lyapunov, matrix, methods, model, reduction, scale, subspace, systems}, number = {2}, pages = {602--627}, posted-at = {2008-06-06 09:32:55}, priority = {2}, publisher = {SIAM}, title = {Oblique Production Methods for Large Scale Model Reduction}, url = {http://dx.doi.org/10.1137/S0895479893250740}, volume = {16}, year = {1995} }

TY - JOUR ID - citeulike:2868797 L3 - citeulike-article-id:2868797 N2 - 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. IS - 2 JF - SIAM Journal on Matrix Analysis and Applications EP - 627 TI - Oblique Production Methods for Large Scale Model Reduction PB - SIAM VL - 16 SP - 602 KW - arnoldi KW - equation KW - iterative KW - krylov KW - lanczos KW - large KW - lyapunov KW - matrix KW - methods KW - model KW - reduction KW - scale KW - subspace KW - systems AU - Jaimoukha, Imad AU - Kasenally, Ebrahim PY - 1995/// UR - http://dx.doi.org/10.1137/S0895479893250740 ER -