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.
Related Items (18)
Polynomial computations for blind image deconvolution ⋮ The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials ⋮ A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials ⋮ GPGCD: an iterative method for calculating approximate GCD of univariate polynomials ⋮ Structured matrix methods computing the greatest common divisor of polynomials ⋮ An ODE-based method for computing the approximate greatest common divisor of polynomials ⋮ A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems ⋮ Root-finding by expansion with independent constraints ⋮ The computation of the degree of the greatest common divisor of three Bernstein basis polynomials ⋮ Characterizing the codimension of zero singularities for time-delay systems. A link with Vandermonde and Birkhoff incidence matrices ⋮ New progress in real and complex polynomial root-finding ⋮ Inversion, degree, reparametrization and implicitization of improperly parametrized planar curves using \(\mu \)-basis ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial ⋮ The generalized Schur algorithm and some applications ⋮ Counting characteristic roots of linear delay differential equations. II: From argument principle to rightmost root assignment methods ⋮ An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility ⋮ Real polynomial root-finding by means of matrix and polynomial iterations ⋮ Variable projection methods for approximate (greatest) common divisor computations
Uses Software
This page was built for publication:
