2021
DOI: 10.1515/cmam-2020-0175
|View full text |Cite
|
Sign up to set email alerts
|

Inexact Inverse Subspace Iteration with Preconditioning Applied to Quadratic Matrix Polynomials

Abstract: An inexact variant of inverse subspace iteration is used to find a small invariant pair of a large quadratic matrix polynomial. It is shown that linear convergence is preserved provided the inner iteration is performed with increasing accuracy. A preconditioned block GMRES solver is employed as inner iteration. The preconditioner uses the strategy of “tuning” which prevents the inner iteration from increasing and therefore results in a substantial saving in costs. The accuracy of the computed invariant pair ca… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 16 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?