𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system

✍ Scribed by Deepak Kapur; Yao Sun; Dingkang Wang

Book ID
118480734
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
347 KB
Volume
49
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Gröbner Free Alternative for Polynomia
A Gröbner Free Alternative for Polynomial System Solving
✍ Marc Giusti; Grégoire Lecerf; Bruno Salvy 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 428 KB

Given a system of polynomial equations and inequations with coefficients in the field of rational numbers, we show how to compute a geometric resolution of the set of common roots of the system over the field of complex numbers. A geometric resolution consists of a primitive element of the algebraic

Incomplete Gröbner basis as a preconditi
Incomplete Gröbner basis as a preconditioner for polynomial systems
✍ Yang Sun; Yu-Hui Tao; Feng-Shan Bai 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 446 KB

Precondition plays a critical role in the numerical methods for large and sparse linear systems. It is also true for nonlinear algebraic systems. In this paper incomplete Gröbner basis (IGB) is proposed as a preconditioner of homotopy methods for polynomial systems of equations, which transforms a d