Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance (Q5423857): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:24, 9 February 2024
scientific article; zbMATH DE number 5207425
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance |
scientific article; zbMATH DE number 5207425 |
Statements
Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance (English)
0 references
31 October 2007
0 references
numerical examples
0 references
greatest common divisor
0 references
polynomials
0 references
matrix pencil methods
0 references
error analysis
0 references
algorithms
0 references
symbolical programming
0 references
stability
0 references
