期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Solve the Polynomial Functions Conditional Extreme by Applying the Groebner Basis Method
1
作者 Junyu Luo Shengzhen Ding 《Open Journal of Applied Sciences》 CAS 2022年第11期1915-1921,共7页
In this paper, an algebraic method which is based on the groebner bases theory is proposed to solve the polynomial functions conditional extreme. Firstly, we describe how to solve conditional extreme value problems by... In this paper, an algebraic method which is based on the groebner bases theory is proposed to solve the polynomial functions conditional extreme. Firstly, we describe how to solve conditional extreme value problems by establishing Lagrange functions and calculating the differential equations derived from the Lagrange functions. Then, by solving the single variable polynomials in the groebner basis, the solution of polynomial equations could be derived successively. We overcome the high number of variables and constraints in the extreme value problem. Finally, this paper illustrates the calculation process of this method through the general procedures and examples in solving questions of conditional extremum of polynomial function. 展开更多
关键词 groebner basis Polynomial Equations Conditional Extremum
下载PDF
Five precision point-path synthesis of planar four-bar linkage using algebraic method
2
作者 Xiguang HUANG Qizheng LIAO +1 位作者 Shimin WEI Qiang XU 《Frontiers of Electrical and Electronic Engineering in China》 CSCD 2008年第4期470-474,共5页
The problem of synthesizing a planar four-bar linkage with two given fixed pivots such that the coupler curve passes through five given points is considered with the Groebner-Sylvester hybrid approach.First,closed-for... The problem of synthesizing a planar four-bar linkage with two given fixed pivots such that the coupler curve passes through five given points is considered with the Groebner-Sylvester hybrid approach.First,closed-form equations of a single point are constructed.The reduced Groebner basis in degree lexicographic ordering for the closed-form equations is then obtained using com-puter algebra.A 23623 Sylvester’s matrix can be con-structed by selecting 23 out of 89 Groebner bases.A 36th degree univariate equation is obtained directly from the determinate of the matrix.The same result can be obtained with a continuation method.A numerical example is given and verifies that the problem has at most 36 solutions in the complex field. 展开更多
关键词 path synthesis mechanism synthesis groebner basis Sylvester resultant
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部