A new view on the numerical computation of the greatest common divisor of two polynomials.
From MaRDI portal
Publication:4902992
Recommendations
Cited in
(14)- scientific article; zbMATH DE number 4096685 (Why is no real title available?)
- On computation of the greatest common divisor of several polynomials over a finite field.
- Comparison of algorithms for calculation of the greatest common divisor of several polynomials.
- scientific article; zbMATH DE number 480305 (Why is no real title available?)
- A note on the Wolovich method of extraction of a greatest common divisor of two polynomial matrices
- A new method for computing polynomial greatest common divisors and polynomial remainder sequences
- scientific article; zbMATH DE number 6520834 (Why is no real title available?)
- Symbolic calculation of greatest common divisor of 2D polynomial matrices
- On the remainders obtained in finding the greatest common divisor of two polynomials
- Numerical Analysis and Its Applications
- Structured matrix methods computing the greatest common divisor of polynomials
- An algorithm for searching the greatest common divisor for Ore polynomials with polynomial coefficients depending on a parameter
- An improvement of Euclid's algorithm.
- scientific article; zbMATH DE number 1860711 (Why is no real title available?)
This page was built for publication: A new view on the numerical computation of the greatest common divisor of two polynomials.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902992)
