QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients (Q2734415): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:02, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients |
scientific article |
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
