A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials

DOI10.1006/jsco.1998.0235zbMath0935.65051OpenAlexW2068937275MaRDI QIDQ1281845

Bernhard Beckermann, George Labahn

Publication date: 3 February 2000

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/9adb8dcc3cfef4cc50e64a29ae318c4649b9911f

zbMATH Keywords

Padé approximationgreatest common divisornumerical stabilityCabay-Meleshko algorithmEuclidean-like algorithmrelatively prime numerical polynomials

Mathematics Subject Classification ID

Related Items (8)

GPGCD: an iterative method for calculating approximate GCD of univariate polynomials ⋮ A symbolic-numeric approach for parametrizing ruled surfaces ⋮ A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials ⋮ Numerical proper reparametrization of parametric plane curves ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials ⋮ Computing lower rank approximations of matrix polynomials ⋮ Exact and approximate similarities of non-necessarily rational planar, parametrized curves, using centers of gravity and inertia tensors

Uses Software

• VECTOR_PADE

This page was built for publication: A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials