Journal of Pure and Applied AlgebraVolume 156, Issues 2–3, 23 February 2001, Pages 127-145Efficient algorithms for computing the characteristic polynomial in a domainAuthor links open overlay panelJounaı̈di Abdeljaoued a, Gennadi I. Malaschonok bShow moreShareCitehttps://doi.org/10.1016/S0022-4049(99)00158-9Get rights and contentUnder an Elsevier user licenseopen archiveAbstractTwo 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.Previous article in issueNext article in issueMSC15A2115–0465F05Recommended articlesCited by (0)Copyright © 2001 Elsevier Science B.V. All rights reserved.