Pages that link to "Item:Q1994881"
From MaRDI portal
The following pages link to Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881):
Displaying 13 items.
- 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)
- Approximate polynomial GCD over integers (Q651873) (← links)
- Relaxed NewtonSLRA for approximate GCD (Q831989) (← links)
- Approximate GCD and its application to ill-conditioned algebraic equations (Q1184132) (← links)
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials (Q1295792) (← links)
- GCD of multivariate approximate polynomials using beautification with the subtractive algorithm (Q2819632) (← links)
- Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures (Q2819639) (← links)
- On the complexity of computing the greatest common divisor of several univariate polynomials (Q5096342) (← links)
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD (Q5120202) (← links)
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials (Q6081970) (← links)
- Polarimetric Fourier phase retrieval (Q6556785) (← links)
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation (Q6615409) (← links)
