Fast Algorithms for Computing Eigenvectors of Matrices via Pseudo Annihilating Polynomials
From MaRDI portal
Publication:6310086
arXiv1811.09149MaRDI QIDQ6310086FDOQ6310086
Authors: Shinichi Tajima, Katsuyoshi Ohara, Akira Terui 
Publication date: 22 November 2018
Abstract: An efficient algorithm for computing eigenvectors of a matrix of integers by exact computation is proposed. The components of calculated eigenvectors are expressed as polynomials in the eigenvalue to which the eigenvector is associated, as a variable. The algorithm, in principle, utilizes the minimal annihilating polynomials for eliminating redundant calculations. Furthermore, in the actual computation, the algorithm computes candidates of eigenvectors by utilizing pseudo annihilating polynomials and verifies their correctness. The experimental results show that our algorithms have better performance compared to conventional methods.
Eigenvalues, singular values, and eigenvectors (15A18) Symbolic computation and algebraic computation (68W30)
This page was built for publication: Fast Algorithms for Computing Eigenvectors of Matrices via Pseudo Annihilating Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6310086)
