The following pages link to Generalized Resultant Theorem (Q4187906):
Displayed 15 items.
- The ERES method for computing the approximate GCD of several polynomials (Q969304) (← links)
- Resultant operators for analytic functions in a multiply-connection domain (Q1093869) (← links)
- A note on resultants (Q1094456) (← links)
- Applications of the generalized Sylvester matrix (Q1152413) (← links)
- Computing nearby non-trivial Smith forms (Q2200314) (← links)
- Nearest common root of a set of polynomials: a structured singular value approach (Q2332430) (← links)
- An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166) (← links)
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation (Q2475938) (← links)
- Invariance properties, and characterization of the greatest common divisor of a set of polynomials (Q3470570) (← links)
- Greatest common divisors from generalized sylvester resultant matrices (Q3879331) (← links)
- Complex Roots of Quaternion Polynomials (Q4609997) (← links)
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility (Q5270354) (← links)
- Computation of the GCD of polynomials using gaussian transformations and shifting (Q5287932) (← links)
- Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance (Q5423857) (← links)
- The feedback invariant measures of distance to uncontrollability and unobservability (Q5863702) (← links)