科研之友
微信
新浪微博
Facebook
分享链接
摘要
Symmetry classification for a system of differential equations can be achieved algorithmically by applying a differential reduction and completion algorithm to the infinitesimal determining equations of the system. The branches of the classification should be invariant under the action of the equivalence group. We show that such invariance can be tested algorithmically knowing only the determining equations of the equivalence group. The method relies on computing the prolongation of a group operator reduced modulo these determining equations. The method is implemented in Maple: a novel pivot selection strategy is able to guide the rifsimp command towards more favourable branchings.
- 出版日期2010-3
