Exact Algorithms for Computing Generalized Eigenspaces of Matrices via Annihilating Polynomials
From MaRDI portal
Publication:6410322
arXiv2209.04807MaRDI QIDQ6410322FDOQ6410322
Authors: Shinichi Tajima, Katsuyoshi Ohara, Akira Terui 
Publication date: 11 September 2022
Abstract: An effective exact method is proposed for computing generalized eigenspaces of a matrix of integers or rational numbers. Keys of our approach are the use of minimal annihilating polynomials and the concept of the Jourdan-Krylov basis. A new method, called Jordan-Krylov elimination, is introduced to design an algorithm for computing Jordan-Krylov basis. The resulting algorithm outputs generalized eigenspaces as a form of Jordan chains. Notably, in the output, components of generalized eigenvectors are expressed as polynomials in the associated eigenvalue as a variable.
Eigenvalues, singular values, and eigenvectors (15A18) Symbolic computation and algebraic computation (68W30)
This page was built for publication: Exact Algorithms for Computing Generalized Eigenspaces of Matrices via Annihilating Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6410322)
