Generalized Resultant Theorem
From MaRDI portal
Publication:4187906
Cited in
(14)- Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
- The feedback invariant measures of distance to uncontrollability and unobservability
- Greatest common divisors from generalized sylvester resultant matrices
- Complex roots of quaternion polynomials
- The ERES method for computing the approximate GCD of several polynomials
- Resultant operators for analytic functions in a multiply-connection domain
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
- An ODE-based method for computing the approximate greatest common divisor of polynomials
- Applications of the generalized Sylvester matrix
- Invariance properties, and characterization of the greatest common divisor of a set of polynomials
- Nearest common root of a set of polynomials: a structured singular value approach
- Computation of the GCD of polynomials using gaussian transformations and shifting
- A note on resultants
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
This page was built for publication: Generalized Resultant Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187906)