scientific article; zbMATH DE number 5494016
From MaRDI portal
Publication:5301644
zbMath1190.65060MaRDI QIDQ5301644
Paola Boito, Dario Andrea Bini
Publication date: 20 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (24)
Polynomial computations for blind image deconvolution ⋮ A quadratically convergent algorithm for structured low-rank approximation ⋮ Relaxed NewtonSLRA for approximate GCD ⋮ 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 ⋮ The calculation of the degree of an approximate greatest common divisor of two polynomials ⋮ Validated Root Enclosures for Interval Polynomials with Multiplicities ⋮ An ODE-based method for computing the approximate greatest common divisor of polynomials ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ Approximate GCD of several univariate polynomials with small degree perturbations ⋮ A subdivision method for computing nearest gcd with certification ⋮ A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ 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 ⋮ A hybrid method for computing the intersection and tangency points of plane curves ⋮ Blind image deconvolution via Hankel based method for computing the GCD of polynomials ⋮ Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials ⋮ 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 ⋮ Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials ⋮ On rank and null space computation of the generalized Sylvester matrix ⋮ Approximate Polynomial gcd: Small Degree and Small Height Perturbations ⋮ An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
This page was built for publication:
