An Algorithm for the Exact Reduction of a Matrix to Frobenius form Using Modular Arithmetic. II

DOI10.2307/2005525zbMath0287.65030OpenAlexW4238432940MaRDI QIDQ4775391

Jo Ann Howell

Publication date: 1973

Full work available at URL: https://doi.org/10.2307/2005525

Mathematics Subject Classification ID

Related Items (1)

On p-adic computation of the rational form of a matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Jacobi-Like Method for the Automatic Computation of Eigenvalues and Eigenvectors of an Arbitrary Matrix
• Solving linear equations using residue arithmetic — Algorithm II
• Bounds for the Greatest Latent Root of a Positive Matrix

This page was built for publication: An Algorithm for the Exact Reduction of a Matrix to Frobenius form Using Modular Arithmetic. II