A contour integral approach to the computation of invariant pairs
Contour integral
[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]
Moments
Eigenvalues
Numerical Analysis (math.NA)
Triangularization
01 natural sciences
Matrix polynomials
518
Solvents
FOS: Mathematics
Mathematics - Numerical Analysis
0101 mathematics
Invariant pairs
DOI:
10.1016/j.tcs.2017.03.024
Publication Date:
2017-03-30T17:45:35Z
AUTHORS (3)
ABSTRACT
We study some aspects of the invariant pair problem for matrix polynomials, as introduced by Betcke and Kressner and by Beyn and Thuemmler. Invariant pairs extend the notion of eigenvalue-eigenvector pairs, providing a counterpart of invariant subspaces for the nonlinear case. We compute formulations for the condition numbers and backward errors of invariant pairs and solvents. We then adapt the Sakurai-Sugiura moment method to the computation of invariant pairs, including some classes of problems that have multiple eigenvalues. Numerical refinement via a variants of Newton's method is also studied. Furthermore, we investigate the relation between the matrix solvent problem and the triangularization of matrix polynomials.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (39)
CITATIONS (3)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....