Pages that link to "Item:Q2785714"
From MaRDI portal
The following pages link to Further numerical aspects of the ERES algorithm for the computation of the greatest common divisor of polynomials and comparison with other existing methodologies (Q2785714):
Displaying 7 items.
- ERES (Q24612) (← links)
- Approximate least common multiple of several polynomials using the ERES division algorithm (Q331163) (← links)
- The ERES method for computing the approximate GCD of several polynomials (Q969304) (← links)
- Normal factorisation of polynomials and computational issues. (Q1416384) (← links)
- A new method for computing polynomial greatest common divisors and polynomial remainder sequences (Q1822238) (← 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)