๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Irreducibility and GCD algorithms for sparse polynomials

โœ Scribed by Filaseta, Schinzel.

Book ID
127399444
Tongue
English
Weight
103 KB
Category
Library

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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