A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials (Q1281845)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1268449
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials |
scientific article; zbMATH DE number 1268449 |
Statements
A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials (English)
0 references
3 February 2000
0 references
This interesting paper extends the Cabay-Meleshko algorithm for Padé approximation. It provides a fast and numerically stable algorithm to determine when two given polynomials \(p\) and \(q\) are relatively prime and remain relatively prime even after small perturbations of their coefficients. The authors also discuss possible extensions of their approach that can be applied to the problem of actually computing a numerical greatest common divisor.
0 references
relatively prime numerical polynomials
0 references
Cabay-Meleshko algorithm
0 references
Euclidean-like algorithm
0 references
numerical stability
0 references
greatest common divisor
0 references
Padé approximation
0 references
0.7744343876838684
0 references
0.7665193676948547
0 references
0.753512978553772
0 references
