The following pages link to (Q3456475):
Displaying 5 items.
- The calculation of the degree of an approximate greatest common divisor of two polynomials (Q611832) (← links)
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials (Q694553) (← links)
- When are two numerical polynomials relatively prime? (Q1281844) (← links)
- QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients (Q2734415) (← links)
- Approximate greatest common divisor of several polynomials from Hankel matrices (Q5101998) (← links)
