Back to Search
Start Over
Pole-swapping algorithms for alternating and palindromic eigenvalue problems
- Publication Year :
- 2019
-
Abstract
- Pole-swapping algorithms are generalizations of bulge-chasing algorithms for the generalized eigenvalue problem. Structure-preserving pole-swapping algorithms for the palindromic and alternating eigenvalue problems, which arise in control theory, are derived. A refinement step that guarantees backward stability of the algorithms is included. This refinement can also be applied to bulge-chasing algorithms that had been introduced previously, thereby guaranteeing their backward stability in all cases.
- Subjects :
- Mathematics - Numerical Analysis
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1906.09942
- Document Type :
- Working Paper