Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix (Q3597983)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix |
scientific article; zbMATH DE number 5500472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix |
scientific article; zbMATH DE number 5500472 |
Statements
Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix (English)
0 references
29 January 2009
0 references
comrade matrix
0 references
orthogonal polynomials
0 references
three-term recurrence relation
0 references
greatest common divisor of generalized polynomials
0 references
0.8343685865402222
0 references
0.7968831062316895
0 references
0.7842147946357727
0 references
0.7752820253372192
0 references
