𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New Euclidean algorithm for GCD

✍ Scribed by Bradley.

Book ID
127401184
Publisher
CACM
Year
1970
Tongue
English
Weight
157 KB
Category
Library

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Euclidean algorithm for numerical polyno
Euclidean algorithm for numerical polynomial GCD. JSC 1998
✍ Beckermann, Labahn. πŸ“‚ Library 🌐 English βš– 201 KB

In this paper we provide a taet, numerically stable algorithm to determine when two given polynomials a arid b are relatively prime and remain relatively prime even after small perturbations of their coefficients. Such a problem is important in ninny applications where input data are only available

Three new algorithms for multivariate po
Three new algorithms for multivariate polynomial GCD
✍ Tateaki Sasaki; Masayuki Suzuki πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 885 KB

Three new algorithms for multivariate polynomial GCD (greatest common divisor) are given. The first is to calculate a GrSbner basis with a certain term ordering. The second is to calculate the subresultant by treating the coefficients w.r.t, the main variable as truncated power series. The third is

New fast euclidean algorithms
New fast euclidean algorithms
✍ Marie-FranΓ§oise Roy; Sidi Mohamed Sedjelmaci πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 239 KB