{"title":"求解二阶线性齐次微分方程的Kovacic算法的实现","authors":"B. D. Saunders","doi":"10.1145/800206.806378","DOIUrl":null,"url":null,"abstract":"Kovacic [3] has given an algorithm for the closed form solution of differential equations of the form ay\" + by' + cy &equil; 0, where a, b, and c are rational functions with complex coefficients of the independent variable x. The algorithm provides a Liouvillian solution (i.e. one that can be expressed in terms of integrals, exponentials and algebraic functions) or reports that no such solution exists.\n In this note a version of Kovacic's algorithm is described. This version has been implemented in MACSYMA and tested successfully on examples in Boyce and DiPrima [1], Kamke [2], and Kovacic [3]. Modifications to the algorithm have been made to minimize the amount of code needed and to avoid the complete factorization of a polynomial called for. In Section 2 these issues are discussed and in Section 3 the author's current version of the algorithm is described.","PeriodicalId":314618,"journal":{"name":"Symposium on Symbolic and Algebraic Manipulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1981-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"An implementation of Kovacic's algorithm for solving second order linear homogeneous differential equations\",\"authors\":\"B. D. Saunders\",\"doi\":\"10.1145/800206.806378\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Kovacic [3] has given an algorithm for the closed form solution of differential equations of the form ay\\\" + by' + cy &equil; 0, where a, b, and c are rational functions with complex coefficients of the independent variable x. The algorithm provides a Liouvillian solution (i.e. one that can be expressed in terms of integrals, exponentials and algebraic functions) or reports that no such solution exists.\\n In this note a version of Kovacic's algorithm is described. This version has been implemented in MACSYMA and tested successfully on examples in Boyce and DiPrima [1], Kamke [2], and Kovacic [3]. Modifications to the algorithm have been made to minimize the amount of code needed and to avoid the complete factorization of a polynomial called for. In Section 2 these issues are discussed and in Section 3 the author's current version of the algorithm is described.\",\"PeriodicalId\":314618,\"journal\":{\"name\":\"Symposium on Symbolic and Algebraic Manipulation\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1981-08-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symposium on Symbolic and Algebraic Manipulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800206.806378\",\"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.806378","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An implementation of Kovacic's algorithm for solving second order linear homogeneous differential equations
Kovacic [3] has given an algorithm for the closed form solution of differential equations of the form ay" + by' + cy &equil; 0, where a, b, and c are rational functions with complex coefficients of the independent variable x. The algorithm provides a Liouvillian solution (i.e. one that can be expressed in terms of integrals, exponentials and algebraic functions) or reports that no such solution exists.
In this note a version of Kovacic's algorithm is described. This version has been implemented in MACSYMA and tested successfully on examples in Boyce and DiPrima [1], Kamke [2], and Kovacic [3]. Modifications to the algorithm have been made to minimize the amount of code needed and to avoid the complete factorization of a polynomial called for. In Section 2 these issues are discussed and in Section 3 the author's current version of the algorithm is described.