The following pages link to (Q4232503):
Displaying 14 items.
- Polynomial computations for blind image deconvolution (Q281962) (← 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)
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (Q385007) (← links)
- Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- Approximate gcds of polynomials and sparse SOS relaxations (Q2378493) (← links)
- An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166) (← links)
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation (Q2475938) (← 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)
- Numerical and Symbolical Methods for the GCD of Several Polynomials (Q2913160) (← links)
- The Sylvester Resultant Matrix and Image Deblurring (Q2945991) (← links)
- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials (Q3587712) (← links)
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility (Q5270354) (← links)
