Applied Mathematics and Mechanics (English Edition) ›› 1998, Vol. 19 ›› Issue (3): 213-220.

• Articles • Previous Articles     Next Articles

TAYLOR POLYNOMIAL STEPWISE REFINEMENT ALGORITHM FOR LIE AND HIGH SYMMETRIES OF PARTIAL DIFFERENTIAL EQUATIONS

Zhang Hongqing1, Chao Lu2, Tang Limin3   

  1. 1. Institute of Mathematics, Dalian University of Technology, Dalian 116024. P. R. China;
    2. Basic Science Department, Inner Mongolia Polytechnic University, Huhhot 010062, P. R. China;
    3. Department of Mechanics, Dalian University of Tcchnoloky, Dalian 1 16024, P. R. China
  • Received:1996-07-05 Revised:1997-10-05 Online:1998-03-18 Published:1998-03-18
  • Supported by:
    Project is supported by the National Natural Science Foundation and MMM Center of China

Abstract: In this article,based on the Taylor expansions of generating functions and stepwise refinement procedure,authors suggest a algorithm for finding the Lie and high (generalzed symmetries of partial differential equations (PDEs).This algorithmtransforms the problem having to solve over-determining PDEs,This algorithmand difficulty part in standard methods into one solving to algebaic equations towhich one easy obtain solution,So,it reduces significantly the difficulties of the problem and raise computing efficiency.The whole procedure of the akgorithm is carried out automatically by using any computer algebra system.In geeneral,this algorithm can yields many more important symmetries for PDEs.

Key words: Lie groups, high symmetries, Taylor polynomial, computer algebra, determining equations, stepwise rdfinement.

APS Journals | CSTAM Journals | AMS Journals | EMS Journals | ASME Journals