Efficient algorithms for computing the characteristic polynomial in a domain
From MaRDI portal
Publication:5928850
DOI10.1016/S0022-4049(99)00158-9zbMath0986.65044MaRDI 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)
algorithm; numerical examples; characteristic polynomial; Dodgson elimination; free finite rank-a module; QT matrix; Sylvester determinant identity
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
16S50: Endomorphism rings; matrix rings
16D40: Free, projective, and flat modules and ideals in associative algebras
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