QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients (Q2734415)
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: QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients |
scientific article; zbMATH DE number 1634022
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients |
scientific article; zbMATH DE number 1634022 |
Statements
QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients (English)
0 references
13 December 2001
0 references
greatest common divisor of two polynomials
0 references
QR-factorization
0 references
0.8315812349319458
0 references
0.8188496828079224
0 references
0.806333601474762
0 references
0.8054730296134949
0 references
