Efficient algorithms for computing the characteristic polynomial in a domain

DOI10.1016/S0022-4049(99)00158-9zbMath0986.65044WikidataQ126771330 ScholiaQ126771330MaRDI QIDQ5928850

Jounaïdi Abdeljaoued, Gennadi I. Malaschonok

Publication date: 3 July 2001

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

zbMATH Keywords

algorithmnumerical examplescharacteristic polynomialDodgson eliminationfree finite rank-a moduleQT matrixSylvester determinant identity

Mathematics Subject Classification ID

Related Items (1)

Deterministic computation of the characteristic polynomial in the time of matrix multiplication

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational methods of linear algebra
• An improved parallel processor bound in fast matrix inversion
• Various proofs of Sylvester's (determinant) identity.
• Solution of a system of linear equations in an integral ring
• Efficient Gaussian Elimination Method for Symbolic Determinants and Linear Systems
• Fast Parallel Matrix Inversion Algorithms
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination

This page was built for publication: Efficient algorithms for computing the characteristic polynomial in a domain