Publication:5301644
From MaRDI portal
zbMath1190.65060MaRDI QIDQ5301644
Paola Boito, Dario Andrea Bini
Publication date: 20 January 2009
Related Items
A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials, An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility, Approximate Polynomial gcd: Small Degree and Small Height Perturbations, On rank and null space computation of the generalized Sylvester matrix, Validated Root Enclosures for Interval Polynomials with Multiplicities, SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials, Polynomial computations for blind image deconvolution, A quadratically convergent algorithm for structured low-rank approximation, Approximate least common multiple of several polynomials using the ERES division algorithm, The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials, Approximate GCD of several univariate polynomials with small degree perturbations, A heuristic verification of the degree of the approximate GCD of two univariate polynomials, The calculation of the degree of an approximate greatest common divisor of two polynomials, A subdivision method for computing nearest gcd with certification, Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials, Relaxed NewtonSLRA for approximate GCD, Approximate polynomial GCD: small degree and small height perturbations, A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix, The computation of the degree of the greatest common divisor of three Bernstein basis polynomials, Toward the best algorithm for approximate GCD of univariate polynomials, Blind image deconvolution via Hankel based method for computing the GCD of polynomials, A hybrid method for computing the intersection and tangency points of plane curves, An ODE-based method for computing the approximate greatest common divisor of polynomials, Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
