Pages that link to "Item:Q1281845"
From MaRDI portal
The following pages link to A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials (Q1281845):
Displaying 9 items.
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (Q385007) (← links)
- Numerical proper reparametrization of parametric plane curves (Q464649) (← links)
- Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
- When are two numerical polynomials relatively prime? (Q1281844) (← links)
- A symbolic-numeric approach for parametrizing ruled surfaces (Q2200134) (← links)
- Computing lower rank approximations of matrix polynomials (Q2284958) (← links)
- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials (Q3587712) (← links)
- A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials (Q4610021) (← links)
- Exact and approximate similarities of non-necessarily rational planar, parametrized curves, using centers of gravity and inertia tensors (Q5002188) (← links)
