The following pages link to (Q5301644):
Displayed 24 items.
- Polynomial computations for blind image deconvolution (Q281962) (← links)
- A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
- Approximate least common multiple of several polynomials using the ERES division algorithm (Q331163) (← links)
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials (Q338517) (← 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)
- The calculation of the degree of an approximate greatest common divisor of two polynomials (Q611832) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials (Q694553) (← links)
- Relaxed NewtonSLRA for approximate GCD (Q831989) (← links)
- Approximate polynomial GCD: small degree and small height perturbations (Q979147) (← links)
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix (Q989131) (← links)
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials (Q1989191) (← links)
- Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881) (← links)
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials (Q1996974) (← links)
- A hybrid method for computing the intersection and tangency points of plane curves (Q2250221) (← links)
- An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166) (← links)
- Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials (Q2511181) (← 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)
- Approximate Polynomial gcd: Small Degree and Small Height Perturbations (Q5458535) (← links)
- On rank and null space computation of the generalized Sylvester matrix (Q5962121) (← links)
- Validated Root Enclosures for Interval Polynomials with Multiplicities (Q6060355) (← links)
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials (Q6081970) (← links)