Show simple item record

dc.contributor.authorElman, Howard C.
dc.contributor.authorWu, Minghao
dc.date.accessioned2012-04-27T01:09:23Z
dc.date.available2012-04-27T01:09:23Z
dc.date.issued2012-04-20
dc.identifier.urihttp://hdl.handle.net/1903/12475
dc.description.abstractIn linear stability analysis of a large-scale dynamical system, we need to compute the rightmost eigenvalue(s) for a series of large generalized eigenvalue problems. Existing iterative eigenvalue solvers are not robust when no estimate of the rightmost eigenvalue(s) is available. In this study, we show that such an estimate can be obtained from Lyapunov inverse iteration applied to a special eigenvalue problem of Lyapunov structure. We also show that Lyapunov inverse iteration will always converge in only two steps if the Lyapunov equation in the first step is solved accurately enough. Furthermore, we generalize the analysis to a deflated version of this Lyapunov eigenvalue problem and propose an algorithm that computes a few rightmost eigenvalues for the eigenvalue problems arising from linear stability analysis. Numerical experiments demonstrate the robustness of the algorithm.en_US
dc.language.isoen_USen_US
dc.relation.ispartofseriesUM Computer Science Department;CS-TR-5009
dc.relation.ispartofseriesUMIACS;UMIACS-TR-2012-07
dc.titleLyapunov Inverse Iteration for Computing a few Rightmost Eigenvalues of Large Generalized Eigenvalue Problemsen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record