An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166)
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 7062904
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An ODE-based method for computing the approximate greatest common divisor of polynomials |
scientific article; zbMATH DE number 7062904 |
Statements
An ODE-based method for computing the approximate greatest common divisor of polynomials (English)
0 references
5 June 2019
0 references
Sylvester matrix
0 references
iterative methods
0 references
approximate GCD
0 references
polynomials
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8502469658851624
0 references
0.8479940295219421
0 references
0.8421201705932617
0 references
0.8414671421051025
0 references
0.8398882746696472
0 references
