首页> 外文会议>ACM symposium on Symbolic and algebraic computation >Using Lie transformation groups to find closed form solutions to first order ordinary differential equations
【24h】

Using Lie transformation groups to find closed form solutions to first order ordinary differential equations

机译:使用李变换组找到一阶常微分方程的闭式解

获取原文

摘要

Most work on computer programs to find closed form solutions to ordinary differential equations (o.d.e.s) has concentrated on implementing a catalog of those methods often cited in textbooks and reference works (see e.g. Kam61a, Inc44a]): algorithms of certain, easily recognized cases (e.g. separable, exact, homogeneous equations) and a useful guessing framework for changes of variable. This approach has been followed by Moses, Schmidt, and Lafferty, among others [Mos67a, Sch76a], [Sch79a, Laf80a].

We present here a different approach to cataloguing, using the relation between differential equations and Lie transformation groups. When presented with a given a first order o.d.e., we shall be concerned with finding continuous transformations (of the plane) which map the solution curves of the o.d.e. into each other. When a group of such transformations is found, it is possible to construct the solution to the o.d.e. via quadratures. We shall find that for many cases of interest, there are succinct algorithms for finding the transformations without knowing the solution curves beforehand. The guiding relationships for the catalogue search, and the justification for the quadrature formula used, has been known for about a century. Pioneering work was done by Sophus Lie and others in the 19th century (see e.g. [Lie75a]). Its emplacement within a symbolic/algebraic computational setting is, of course, modern-day.

机译:

为找到常微分方程(odes)的闭式解而在计算机程序上进行的大多数工作都集中在实现教科书和参考著作中经常引用的那些方法的目录上(例如,参见Kam61a,Inc44a]):某些简单的算法公认的案例(例如,可分离的,精确的,齐次的方程)和一个有用的猜测变量变化的框架。 Moses,Schmidt和Lafferty以及其他[Mos67a,Sch76a],[Sch79a,Laf80a]都采用了这种方法。

在这里,我们使用微分方程和Lie变换组之间的关系,提出了一种不同的编目方法。当以给定的一阶o.d.e呈现时,我们将关注寻找(平面的)连续变换,这些变换映射了o.d.e.的解曲线。彼此。当找到这样的转换的时,可以构造o.d.e.的解。通过正交。我们将发现,对于许多感兴趣的情况,存在精简算法来查找变换而无需事先知道解曲线。大约一个世纪以来,人们就已经知道目录搜索的指导关系以及所用正交公式的合理性。索菲斯·李(Sophus Lie)等人在19世纪完成了开拓性工作(例如参见[Lie75a])。当然,它在符号/代数计算环境中的定位是现代的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号