When are two numerical polynomials relatively prime?
From MaRDI portal
Publication:1281844
DOI10.1006/jsco.1998.0234zbMath1008.65021OpenAlexW2034679035MaRDI QIDQ1281844
Bernhard Beckermann, George Labahn
Publication date: 16 May 1999
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0c23c16487c39e4c9e65ddfc64d4b52ffde340a1
Computational aspects and applications of commutative rings (13P99) Numerical linear algebra (65F99)
Related Items (16)
Parametrization of approximate algebraic curves by lines ⋮ On rational functions without Froissart doublets ⋮ Validated Root Enclosures for Interval Polynomials with Multiplicities ⋮ An ODE-based method for computing the approximate greatest common divisor of polynomials ⋮ Obtaining exact interpolation multivariate polynomial by approximation ⋮ A symbolic-numeric approach for parametrizing ruled surfaces ⋮ Computing nearby non-trivial Smith forms ⋮ A subdivision method for computing nearest gcd with certification ⋮ A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials ⋮ Numerical proper reparametrization of parametric plane curves ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Obtaining exact value by approximate computations ⋮ Computing lower rank approximations of matrix polynomials ⋮ Algebraic properties of robust Padé approximants ⋮ An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
Uses Software
This page was built for publication: When are two numerical polynomials relatively prime?
