Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881)
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: Toward the best algorithm for approximate GCD of univariate polynomials |
scientific article; zbMATH DE number 7312662
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Toward the best algorithm for approximate GCD of univariate polynomials |
scientific article; zbMATH DE number 7312662 |
Statements
Toward the best algorithm for approximate GCD of univariate polynomials (English)
0 references
18 February 2021
0 references
symbolic-numeric algorithm for polynomials
0 references
approximate polynomial GCD
0 references
subresultant matrix
0 references
Sylvester matrix
0 references
QR factorization
0 references
rank structured matrix
0 references
0 references
0 references
0 references
