Greatest common divisors from generalized sylvester resultant matrices
From MaRDI portal
(Redirected from Publication:3879331)
Cites work
- scientific article; zbMATH DE number 3388871 (Why is no real title available?)
- A companion matrix analogue for orthogonal polynomials
- Another Theorem Relating Sylvester's Matrix and the Greatest Common Divisor
- Generalized Resultant Theorem
- Greatest common divisor of generalized polynomials and polynomial matrices
- Greatest common divisor of two polynomials
- Greatest common divisor via generalized Sylvester and Bezout matrices
- Some Applications of Matrics in the Theory of Equations
- Some New Results on the Qualitative Theory of Generalized Polynomials
Cited in
(21)- 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
- Resultant operators for analytic functions in a multiply-connection domain
- Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
- 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
- Blind image deconvolution using a banded matrix method
- Structured ramp secret sharing schemata over rings of real polynomials
- Applications of the generalized Sylvester matrix
- Greatest common divisor of matrices one of which is a disappear matrix
- A note on resultants
- Computer graphics techniques in military applications
- 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
- Computing the greatest common divisor of several parametric univariate polynomials via generalized subresultants
- Numerical and symbolical methods for the GCD of several polynomials
- On rank and null space computation of the generalized Sylvester matrix
- First study for ramp secret sharing schemes through greatest common divisor of polynomials
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)
