Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance (Q5423857): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207170600725701 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2140382237 / rank | |||
Normal rank | |||
Revision as of 19:26, 19 March 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
