Solving sparse polynomial systems using Groebner bases and resultants

Solving systems of polynomial equations is a central problem in nonlinear and computational algebra. Since Buchberger's algorithm for computing Gr\"obner bases in the 60s, there has been a lot of progress in this domain. Moreover, these equations have been employed to model and solve probl...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Author:	Bender, Matías R
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 19.05.2022
Subjects:	Algorithms Continuation methods Cryptography Polynomials Resultants Robotics Sparsity
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!