A new view on the numerical computation of the greatest common divisor of two polynomials. (Q4902992)
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: A new view on the numerical computation of the greatest common divisor of two polynomials. |
scientific article; zbMATH DE number 6126997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new view on the numerical computation of the greatest common divisor of two polynomials. |
scientific article; zbMATH DE number 6126997 |
Statements
18 January 2013
0 references
greatest common divisor
0 references
Sylvester matrix
0 references
Euclidean algorithm
0 references
structured total least norm method
0 references
0.8413162231445312
0 references
0.8354429006576538
0 references
0.8303770422935486
0 references
