ERES

swMATH12686MaRDI QIDQ24612FDOQ24612

Author name not available (Why is that?)

Described by source

• Further numerical aspects of the ERES algorithm for the computation of the greatest common divisor of polynomials and comparison with other existing methodologies

Cited In (7)

• Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
• Numerical and Symbolical Methods for the GCD of Several 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
• 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

This page was built for software: ERES