Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jsc.2019.08.004 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JSC.2019.08.004 / rank | |||
Normal rank | |||
Latest revision as of 17:10, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Toward the best algorithm for approximate GCD of univariate polynomials |
scientific article |
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
