Loading...
Please wait, while we are loading the content...
Similar Documents
A new algorithm for computing comprehensive gröbner systems (2010).
| Content Provider | CiteSeerX |
|---|---|
| Author | Kapur, Deepak Sun, Yao Wang, Dingkang |
| Abstract | A new algorithm for computing a comprehensive Gröbner system of a parametric polynomial ideal over k[U][X] is presented. This algorithm generates fewer branches (segments) compared to Suzuki and Sato’s algorithm as well as Nabeshima’s algorithm, resulting in considerable efficiency. As a result, the algorithm is able to compute comprehensive Gröbner systems of parametric polynomial ideals arising from applications which have been beyond the reach of other well known algorithms. The starting point of the new algorithm is Weispfenning’s algorithm with a key insight by Suzuki and Sato who proposed computing first a Gröbner basis of an ideal over k[U, X] before performing any branches based on parametric constraints. Based on Kalkbrener’s results about stability and specialization of Gröbner basis of ideals, |
| File Format | |
| Publisher Date | 2010-01-01 |
| Access Restriction | Open |
| Subject Keyword | New Algorithm Computing Comprehensive Gr Bner System Gr Bner Basis Comprehensive Gr Bner System Parametric Polynomial Ideal Nabeshima Algorithm Kalkbrener Result Key Insight Considerable Efficiency Parametric Constraint |
| Content Type | Text |
