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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
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
This page was built for publication: An Algorithm for the Exact Reduction of a Matrix to Frobenius Form Using Modular Arithmetic. I
