Pages that link to "Item:Q2475938"
From MaRDI portal
The following pages link to Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation (Q2475938):
Displayed 8 items.
- Approximate zero polynomials of polynomial matrices and linear systems (Q389575) (← links)
- The computation of multiple roots of a polynomial (Q425345) (← links)
- Approximate polynomial GCD over integers (Q651873) (← links)
- The ERES method for computing the approximate GCD of several polynomials (Q969304) (← links)
- Approximate polynomial GCD: small degree and small height perturbations (Q979147) (← links)
- Numerical and Symbolical Methods for the GCD of Several Polynomials (Q2913160) (← 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)