Efficient algorithms for computing the characteristic polynomial in a domain

https://doi.org/10.1016/S0022-4049(99)00158-9Get rights and content
Under an Elsevier user license
open archive

Abstract

Two new sequential methods are given for computing the characteristic polynomial of an endomorphism of a free finite rank-n module over a domain, that require O(n3) ring operations with exact divisions.

MSC

15A21
15–04
65F05

Cited by (0)