An Algorithm for the Exact Reduction of a Matrix to Frobenius Form Using Modular Arithmetic. I
From MaRDI portal
Publication:4775390
DOI10.2307/2005524zbMath0287.65029OpenAlexW4233888919MaRDI QIDQ4775390
Publication date: 1973
Full work available at URL: https://doi.org/10.2307/2005524
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Roundoff error (65G50) Polynomials over finite fields (11T06) Congruences; primitive roots; residue systems (11A07) Matrices of integers (15B36) Canonical forms, reductions, classification (15A21)
Related Items
Computational methods of linear algebra, Error-free computation of characteristic polynomial of a matrix
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On certain methods for expanding the characteristic polynomial
- The Exact Solution of Systems of Linear Equations with Polynomial Coefficients
- Computing Eigenvalues of Complex Matrices by Determinant Evaluation and by Methods of Danilewski and Wielandt
- On the Danilewski Method
- Expansion of determinantal equations into polynomial form