scientific article

From MaRDI portal
Publication:3162294

zbMath1203.65078MaRDI QIDQ3162294

Dario Andrea Bini, Paola Boito

Publication date: 19 October 2010


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 (18)

Polynomial computations for blind image deconvolutionThe computation of the degree of an approximate greatest common divisor of two Bernstein polynomialsA non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomialsGPGCD: an iterative method for calculating approximate GCD of univariate polynomialsStructured matrix methods computing the greatest common divisor of polynomialsAn ODE-based method for computing the approximate greatest common divisor of polynomialsA Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial SystemsRoot-finding by expansion with independent constraintsThe computation of the degree of the greatest common divisor of three Bernstein basis polynomialsCharacterizing the codimension of zero singularities for time-delay systems. A link with Vandermonde and Birkhoff incidence matricesNew progress in real and complex polynomial root-findingInversion, degree, reparametrization and implicitization of improperly parametrized planar curves using \(\mu \)-basisThe Computation of Multiple Roots of a Bernstein Basis PolynomialThe generalized Schur algorithm and some applicationsCounting characteristic roots of linear delay differential equations. II: From argument principle to rightmost root assignment methodsAn ODE-Based Method for Computing the Distance of Coprime Polynomials to Common DivisibilityReal polynomial root-finding by means of matrix and polynomial iterationsVariable projection methods for approximate (greatest) common divisor computations


Uses Software



This page was built for publication: