Completion of Linear Differential Systems to Involution

作者: Vladimir P. Gerdt

DOI: 10.1007/978-3-642-60218-4_9

关键词:

摘要: In this paper we generalize the involutive methods and algorithms have been devised for polynomial ideals to differential ones generated by a finite set of linear polynomials in ring over zero characteristic field. Given ranking derivative terms an division, formulate involutivity conditions which form basis algorithms. We present algorithm computation minimal basis. Its correctness termination hold any constructive noetherian division. As two important applications consider posing initial value problem system providing uniqueness its solution Lie symmetry analysis nonlinear equations. particular, allows determine structure arbitrariness general systems thereby find size group.

参考文章(34)
Giuseppa Carra' Ferro, Gröbner bases and differential algebra Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. pp. 129- 140 ,(1989) , 10.1007/3-540-51082-6_73
Fritz Schwarz, An algorithm for determining the size of symmetry groups Computing. ,vol. 49, pp. 95- 115 ,(1992) , 10.1007/BF02238743
François Ollivier, Standard Bases of Differential Ideals Applicable Algebra in Engineering, Communication and Computing. pp. 304- 321 ,(1990) , 10.1007/3-540-54195-0_60
J. F. Pommaret, Systems of partial differential equations and Lie pseudogroups Gordon and Breach Science Publishers. ,(1978)
Joachim Schü, Werner M. Seiler, Jacques Calmet, Algorithmic Methods for Lie Pseudogroups Springer Netherlands. pp. 337- 344 ,(1993) , 10.1007/978-94-011-2050-0_36