Two-Sided Arnoldi and Nonsymmetric Lanczos Algorithms
Lists
Only you see this
Abstract
We introduce new two-sided Arnoldi recursions and use them to define a model reduction procedure for large, linear, time-invariant, multi-input/multi-output differential algebraic systems. We prove that this procedure has desirable moment matching properties. We define a corresponding model reduction procedure which is based on a band nonsymmetric Lanczos recursion and prove that if the deflation is exact and there are no breakdowns in the recursions, then these two model reduction procedures generate identical reduced-order systems. We prove similar equivalences for corresponding eigenelement procedures. We concentrate on the theoretical properties of the new algorithms.
BibTeX
@article{cullum2002two,
author = {Jane Cullum and Tong Zhang},
title = {{Two-Sided Arnoldi and Nonsymmetric Lanczos Algorithms}},
journal = {SIAM J. Matrix Anal. Appl.},
year = {2002},
url = {https://openreview.net/forum?id=t-vs-T1Of2ul},
}Loading related content...