Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix (Q3597983): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-87827-8_7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1830113820 / rank | |||
Normal rank | |||
Revision as of 01:34, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix |
scientific article |
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
