Pages that link to "Item:Q1281844"
From MaRDI portal
The following pages link to When are two numerical polynomials relatively prime? (Q1281844):
Displaying 17 items.
- Numerical proper reparametrization of parametric plane curves (Q464649) (← links)
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials (Q466858) (← links)
- Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
- Parametrization of approximate algebraic curves by lines (Q598227) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials (Q1281845) (← links)
- Obtaining exact interpolation multivariate polynomial by approximation (Q1937782) (← links)
- A symbolic-numeric approach for parametrizing ruled surfaces (Q2200134) (← links)
- Computing nearby non-trivial Smith forms (Q2200314) (← links)
- Computing lower rank approximations of matrix polynomials (Q2284958) (← links)
- On rational functions without Froissart doublets (Q2413468) (← links)
- An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166) (← links)
- Obtaining exact value by approximate computations (Q2464301) (← links)
- Algebraic properties of robust Padé approximants (Q2514844) (← links)
- Evaluationally relatively prime polynomials (Q2831721) (← links)
- A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials (Q4610021) (← links)
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility (Q5270354) (← links)
