scientific article; zbMATH DE number 1253994

MaRDI QIDQ4226974zbMATH OpenFDO

Authors L. Gemignani

Publication date 5 September 1999

zbMATH Keywords

Bézout matricesgreatest common divisor of polynomialsinteger polynomialpolynomial GCD-algorithms

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computation of special functions and constants, construction of tables (65D20) Numerical computation of solutions to single equations (65H05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Structured matrix methods computing the greatest common divisor of polynomials
• Structured matrix based methods for approximate polynomial GCD
• Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
• A fast algorithm for approximate polynomial gcd based on structured matrix computations

Cited in

(9)

• A hybrid approach to the computation of the inertia of a parametric family of Bézoutians with application to some stability problems for bivariate polynomials
• Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
• On a problem of Berzsenyi regarding the \(\gcd\) of polynomial expressions
• Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
• Polynomial greatest common divisor as a solution of system of linear equations
• Blind image deconvolution via Hankel based method for computing the GCD of polynomials
• Computing the polynomial remainder sequence via Bézout matrices
• Realization and GCD-existence theorem for generalized polynomials
• Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4226974)