Improved algorithm for Grbner basis is a new way to solve Grbner basis by adopting the locally analytic method,which is based on GrbnerNew algorithm The process consists of relegating the leading terms of generator of...Improved algorithm for Grbner basis is a new way to solve Grbner basis by adopting the locally analytic method,which is based on GrbnerNew algorithm The process consists of relegating the leading terms of generator of the polynomial in the idea according to correlated expressions of leading terms and then analyzing every category.If a polynomial can be reduced to a remainder polynomial by a polynomial in the idea,then it can be replaced by the remainder polynomial as generator In the solving process,local reduction and local puwer decrease are employed to prevent the number of middle terms from increasing too fast and the degrees of polynomial from being too high so as to reduce the amount of展开更多
采用Grbner基方法,可以把一个在有限群作用下不变的多项式写成不变环的生成元的多项式.核心问题是如何有效地计算这个正维不变理想的Grbner基.本文引入一个有效提升算法来计算这组Grbner基.当用straight line program模型对整个...采用Grbner基方法,可以把一个在有限群作用下不变的多项式写成不变环的生成元的多项式.核心问题是如何有效地计算这个正维不变理想的Grbner基.本文引入一个有效提升算法来计算这组Grbner基.当用straight line program模型对整个计算过程进行复杂度分析时,可以把计算开销控制在多项式时间内.展开更多
研究了NGP(nearly general stewart-gough platform)并联机构动平台位置与姿态变量之间的耦合关系,将9个变量中的6个用其余的3个表达出来,从而实现了位置变量和姿态变量的解耦.运用Gr bner基算法,得到了15个只含有其余3个变量的4次相容...研究了NGP(nearly general stewart-gough platform)并联机构动平台位置与姿态变量之间的耦合关系,将9个变量中的6个用其余的3个表达出来,从而实现了位置变量和姿态变量的解耦.运用Gr bner基算法,得到了15个只含有其余3个变量的4次相容方程.在此基础上,采用变量代换的方法消去其中的高次项,最终将NGP并联机构的运动学正解问题简化为求解一个一元20次的代数方程;这个方程是通过计算一个10阶行列式得出的,并且通过一个具体的算例验证了该方法的正确性.该方法适用于所有的NGP并联机构.展开更多
文摘Improved algorithm for Grbner basis is a new way to solve Grbner basis by adopting the locally analytic method,which is based on GrbnerNew algorithm The process consists of relegating the leading terms of generator of the polynomial in the idea according to correlated expressions of leading terms and then analyzing every category.If a polynomial can be reduced to a remainder polynomial by a polynomial in the idea,then it can be replaced by the remainder polynomial as generator In the solving process,local reduction and local puwer decrease are employed to prevent the number of middle terms from increasing too fast and the degrees of polynomial from being too high so as to reduce the amount of
文摘采用Grbner基方法,可以把一个在有限群作用下不变的多项式写成不变环的生成元的多项式.核心问题是如何有效地计算这个正维不变理想的Grbner基.本文引入一个有效提升算法来计算这组Grbner基.当用straight line program模型对整个计算过程进行复杂度分析时,可以把计算开销控制在多项式时间内.
文摘研究了NGP(nearly general stewart-gough platform)并联机构动平台位置与姿态变量之间的耦合关系,将9个变量中的6个用其余的3个表达出来,从而实现了位置变量和姿态变量的解耦.运用Gr bner基算法,得到了15个只含有其余3个变量的4次相容方程.在此基础上,采用变量代换的方法消去其中的高次项,最终将NGP并联机构的运动学正解问题简化为求解一个一元20次的代数方程;这个方程是通过计算一个10阶行列式得出的,并且通过一个具体的算例验证了该方法的正确性.该方法适用于所有的NGP并联机构.
