Details:
Title  A SpeedUp Algorithm for Computing Comprehensive Groebner Systems  Author(s)  Katsusuke Nabeshima  Type  Book, Chapter in Book, Conference Proceeding  Abstract  We introduce a new algorithm for computing comprehensive Groebner systems. There exists the SuzukiSato algorithm for computing comprehensive Groebner systems. The SuzukiSato algorithm often creates overmuch cells of the parameter space for comprehensive Groebner systems. Therefore the computation becomes heavy. However, by using inequations (``not equal zero''), we can obtain different cells. In many cases, this number of cells of parameter space is smaller than that of SuzukiSato's. Therefore, our new algorithm is more efficient than SuzukiSato's one, and outputs a nice comprehensive Groebner system. Our new algorithm has been implemented in the computer algebra system Risa/Asir. We compare the runtime of our implementation with the SuzukiSato algorithm and find our algorithm superior in many cases.  Length  8  ISBN  9781595937438 
URL 
http://www.risc.jku.at/publications/download/risc_3154/Issa2007_nabeshi.pdf 
Language  English  Pages  299306  Publisher  ACM Press  Year  2007  Editor  C. W. Brown  Translation 
No  Refereed 
No  Conferencename  ISSAC 2007 
