Pages that link to "Item:Q4454765"
From MaRDI portal
The following pages link to Resultant properties of gcd of many polynomials and a factorization representation of gcd (Q4454765):
Displaying 13 items.
- Approximate zero polynomials of polynomial matrices and linear systems (Q389575) (← links)
- The ERES method for computing the approximate GCD of several polynomials (Q969304) (← links)
- Structured matrix methods computing the greatest common divisor of polynomials (Q1678991) (← links)
- Computing nearby non-trivial Smith forms (Q2200314) (← links)
- Nearest common root of a set of polynomials: a structured singular value approach (Q2332430) (← links)
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation (Q2475938) (← links)
- Numerical and Symbolical Methods for the GCD of Several Polynomials (Q2913160) (← links)
- Complex Roots of Quaternion Polynomials (Q4609997) (← links)
- Stability criteria of matrix polynomials (Q5240691) (← links)
- Generalised resultants, dynamic polynomial combinants and the minimal design problem (Q5252968) (← links)
- Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance (Q5423857) (← links)
- Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method (Q5717696) (← links)
- The feedback invariant measures of distance to uncontrollability and unobservability (Q5863702) (← links)