swMATH12686MaRDI QIDQ24612FDOQ24612
Author name not available (Why is that?)
Official website: http://www.researchgate.net/publication/266367989_Further_numerical_aspects_of_the_ERES_algorithm_for_the_computation_of_the_greatest_common_divisor_of_polynomials_and_comparison_with_other_existing_m
Cited In (8)
- Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
- Normal factorisation of polynomials and computational issues.
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
- Numerical Analysis and Its Applications
- MultRoot
- Numerical computation of the least common multiple of a set of polynomials
- Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method
- Numerical and symbolical methods for the GCD of several polynomials
This page was built for software: ERES
