QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients (Q2734415): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Xiao-Yan Ma / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Frederick W. Fairman / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: mctoolbox / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/78.875462 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2130331374 / rank | |||
Normal rank | |||
Latest revision as of 14:32, 19 March 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
