On fast computation of a polynomial in the Frobenius matrix (Q1571128)
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 1472876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On fast computation of a polynomial in the Frobenius matrix |
scientific article; zbMATH DE number 1472876 |
Statements
On fast computation of a polynomial in the Frobenius matrix (English)
0 references
11 October 2000
0 references
An elementary purely matrix-theoretic proof is given for a recent result by \textit{M. Giesbrecht} [SIAM J. Comput. 24, No. 5, 948-969 (1995; Zbl 0839.65043)] concerning fast computation of a polynomial in the Frobenius matrix. This result is applied to the problem of determining whether two given polynomials have common roots.
0 references
fast computation
0 references
polynomial
0 references
zeros of polynomials
0 references
Frobenius matrix
0 references
common roots
0 references
0.9036839
0 references
0.90345824
0 references
0.90247136
0 references
0.90195304
0 references
0.8999284
0 references
