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 the normal view instead:
scientific article; zbMATH DE number 7312662
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0.8757449388504028
0 references
0.8675049543380737
0 references
0.8607615828514099
0 references
0.8581523895263672
0 references
0.8579213619232178
0 references
