Pages that link to "Item:Q2576217"
From MaRDI portal
The following pages link to Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases (Q2576217):
Displayed 10 items.
- Computing the shapes arising in a family of space rational curves depending on one parameter (Q448988) (← links)
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials (Q466858) (← links)
- Approximate polynomial GCD over integers (Q651873) (← links)
- Blind image deconvolution through Bezoutians (Q729853) (← links)
- The ERES method for computing the approximate GCD of several polynomials (Q969304) (← links)
- Structured matrix methods computing the greatest common divisor of polynomials (Q1678991) (← links)
- A geometrical approach to finding multivariate approximate LCMs and GCDs (Q1947122) (← links)
- Approximate square-free part and decomposition (Q2229724) (← links)
- Numerical and Symbolical Methods for the GCD of Several Polynomials (Q2913160) (← links)
- On the Relation Between Matrices and the Greatest Common Divisor of Polynomials (Q3304778) (← links)