Greatest common divisors from generalized sylvester resultant matrices

DOI10.1080/03081088008817332zbMATH Open0438.12012OpenAlexW2045717636MaRDI QIDQ3879331FDOQ3879331

Stephen Barnett

Publication date: 1980

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081088008817332

zbMATH Keywords

greatest common divisorsgeneralized Sylvester resultant matrices

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05)

Cites Work

• Title not available (Why is that?)
• A companion matrix analogue for orthogonal polynomials
• Another Theorem Relating Sylvester's Matrix and the Greatest Common Divisor
• Greatest common divisor of two polynomials
• Greatest common divisor via generalized Sylvester and Bezout matrices
• Some Applications of Matrics in the Theory of Equations
• Generalized Resultant Theorem
• Greatest common divisor of generalized polynomials and polynomial matrices
• Some New Results on the Qualitative Theory of Generalized Polynomials

Cited In (19)

• A hybrid method for computing the intersection and tangency points of plane curves
• The computation of the degree of the greatest common divisor of three Bernstein basis 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
• Resultant operators for analytic functions in a multiply-connection domain
• An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
• Computing the common zeros of two bivariate functions via Bézout resultants
• Numerical and Symbolical Methods for the GCD of Several Polynomials
• Blind image deconvolution using a banded matrix method
• First Study for Ramp Secret Sharing Schemes Through Greatest Common Divisor of Polynomials
• Computer Graphics Techniques in Military Applications
• Applications of the generalized Sylvester matrix
• Greatest common divisor of matrices one of which is a disappear matrix
• A note on resultants
• Structured matrix methods computing the greatest common divisor of polynomials
• Parallel QR processing of generalized Sylvester matrices
• Congenial matrices
• Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
• The ERES method for computing the approximate GCD of several polynomials
• On rank and null space computation of the generalized Sylvester matrix

This page was built for publication: Greatest common divisors from generalized sylvester resultant matrices

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