Efficient algorithms for computing the characteristic polynomial in a domain (Q5928850)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1584447
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for computing the characteristic polynomial in a domain |
scientific article; zbMATH DE number 1584447 |
Statements
Efficient algorithms for computing the characteristic polynomial in a domain (English)
0 references
3 July 2001
0 references
New sequential methods are given for computing the characteristic polynomial of an endomorphism of a free finite rank-a module over a domain, that require \(O(n^3)\) ring operations with exact division. The Dodgson elimination process is analysed as a sequence of matrices by using Sylvester determinant identity. The Dodgson process is applied for reducing a given square matrix to a similar QT matrix. The algorithm is ilustrated on a numerical example.
0 references
characteristic polynomial
0 references
free finite rank-a module
0 references
Dodgson elimination
0 references
Sylvester determinant identity
0 references
QT matrix
0 references
algorithm
0 references
numerical examples
0 references
0.8508261442184448
0 references
0.8506098985671997
0 references
0.8034780025482178
0 references
0.7963041067123413
0 references
