利用李变换群求一阶常微分方程的闭形式解

B. Char
{"title":"利用李变换群求一阶常微分方程的闭形式解","authors":"B. Char","doi":"10.1145/800206.806370","DOIUrl":null,"url":null,"abstract":"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].\n 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.","PeriodicalId":314618,"journal":{"name":"Symposium on Symbolic and Algebraic Manipulation","volume":"58 9","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1981-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Using Lie transformation groups to find closed form solutions to first order ordinary differential equations\",\"authors\":\"B. Char\",\"doi\":\"10.1145/800206.806370\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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].\\n 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.\",\"PeriodicalId\":314618,\"journal\":{\"name\":\"Symposium on Symbolic and Algebraic Manipulation\",\"volume\":\"58 9\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1981-08-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symposium on Symbolic and Algebraic Manipulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800206.806370\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Symbolic and Algebraic Manipulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800206.806370","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

大多数关于寻找常微分方程(o.d.e.s)封闭形式解的计算机程序的工作集中在实现教科书和参考著作中经常引用的方法目录(参见例如Kam61a, Inc44a]):特定的,易于识别的情况(例如,可分离的,精确的,齐次方程)的算法和变量变化的有用猜测框架。这种方法被Moses, Schmidt和Lafferty以及其他[Mos67a, Sch76a], [Sch79a, Laf80a]所采用。我们在这里提出了一种不同的编目方法,利用微分方程和李变换群之间的关系。当给定一个一阶o.d.e时,我们将关心的是找到(平面的)连续变换,这些变换将o.d.e的解曲线相互映射。当找到一组这样的变换时,就可以通过正交构造o.d.e的解。我们会发现,对于许多感兴趣的情况,有一些简洁的算法可以在不事先知道解曲线的情况下求出变换。目录搜索的指导关系,以及所使用的正交公式的合理性,在大约一个世纪前就已经为人所知。索菲斯·李和其他人在19世纪做了开创性的工作(参见[Lie75a])。当然,它在符号/代数计算环境中的定位是现代的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信