Combining Maple and Form to decide on integrability questions

Sanders, Jan A. and Wang, Jing Ping (1998) Combining Maple and Form to decide on integrability questions. Computer Physics Communications, 115 (2-3). pp. 1-13. ISSN 0010-4655. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL


We consider the existence problem of (infinitely many) symmetries for equations of the form u(t) = u(k) + F(u,..., u(k-1)) when they are lambda-homogeneous (with respect to the scaling u(k) bar right arrow mu(lambda+k)u(k)). This involves fairly large calculations which are carried out in a mixture of Form and Maple. We give an introduction to this mixed language style of programming, indicating how the choice of language will be determined by bottlenecks in the computation. We give some fairly complete results for the lambda = 0 case, which leads to more difficult computer algebra problems involving differential ideals. Finally we show some results extending the methods to cosymmetries.

Item Type: Article
Subjects: Q Science > QA Mathematics (inc Computing science)
Divisions: Faculties > Science Technology and Medical Studies > School of Mathematics Statistics and Actuarial Science > Applied Mathematics
Depositing User: Jing Ping Wang
Date Deposited: 25 Jun 2009 11:18
Last Modified: 11 Jun 2014 09:07
Resource URI: (The current URI for this page, for reference purposes)
  • Depositors only (login required):