Pages that link to "Item:Q3470570"
From MaRDI portal
The following pages link to Invariance properties, and characterization of the greatest common divisor of a set of polynomials (Q3470570):
Displaying 11 items.
- Approximate least common multiple of several polynomials using the ERES division algorithm (Q331163) (← links)
- Approximate zero polynomials of polynomial matrices and linear systems (Q389575) (← links)
- The ERES method for computing the approximate GCD of several polynomials (Q969304) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- Nearest common root of a set of polynomials: a structured singular value approach (Q2332430) (← links)
- Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials (Q2511181) (← 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)
- 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)
- Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies (Q5961649) (← links)