Polynomial GCDs by syzygies

• Type: Article in International Conference Proceedings Book
• Date: 2017

Authors

Duarte E. (Author) Other; Lichtblau D. (Author) Other

Conference proceedings International

Title: Proceedings - 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2016

Pages: 53-59

Indexing

Scopus - 2 Citations

Other information

Authenticus ID: P-00X-9EJ

DOI: 10.1109/synasc.2016.021

Abstract (EN): We provide a simple method, using Gröbner bases over modules, to compute multivariate polynomial greatest common divisors. The approach we show is flexible, adaptable to algebraic extensions of the rationals or prime fields, and is notably faster than prior methods that work with Gröbner bases. It can be used in situations where sparse interpolation might be difficult to implement, e.g. when there are few points for interpolation (small prime fields) or in the presence of non-numeric algebraic relations.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 6