Approximate Polynomial GCD by Approximate Syzygies

One way to compute a GCD of a pair of multivariate polynomials is by finding a certain syzygy. We can weaken this to create an “approximate syzygy”, for the purpose of computing an approximate GCD. The primary tools are Gröbner bases and optimization. Depending on specifics of the formulation, one m...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematics in computer science Vol. 13; no. 4; pp. 517 - 532
Main Author:	Lichtblau, Daniel
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.12.2019 Springer Nature B.V
Subjects:	Computer Science Linear programming Mathematics Mathematics and Statistics Optimization Polynomials Quadratic programming Quotients Hybrid symbolic-numeric algorithms 68W30 Numeric Gröbner basis Approximate polynomial GCD 13P10 Syzygies Linear programming 13P05 68W25 Quadratic programming
ISSN:	1661-8270, 1661-8289
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!