Pages that link to "Item:Q2883839"
From MaRDI portal
The following pages link to An iterative method for calculating approximate GCD of univariate polynomials (Q2883839):
Displaying 11 items.
- A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (Q385007) (← links)
- Approximate GCD of several univariate polynomials with small degree perturbations (Q412204) (← links)
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials (Q466858) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials (Q1295792) (← links)
- A subspace method for the computation of the GCD of polynomials (Q1361353) (← links)
- Approximate polynomial GCD by approximate syzygies (Q2009224) (← links)
- An improvement in the lattice construction process of approximate polynomial GCD over integers (Q2819617) (← links)
- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials (Q3587712) (← links)
- Computation of the GCD of polynomials using gaussian transformations and shifting (Q5287932) (← links)
