{"title":"一类双变量Pfaffian系统的形式解","authors":"Suzy S. Maddah, M. Barkatou, H. Abbas","doi":"10.1145/2608628.2608656","DOIUrl":null,"url":null,"abstract":"In this paper, we present an algorithm for computing a fundamental matrix of formal solutions of completely integrable Pfaffian systems with normal crossings in two variables. First, we associate to the Pfaffian system a singular linear system of ordinary differential equations from which its formal invariants can be efficiently derived. After that, we give a generalization of the Moser-based rank reduction algorithm of [5]. These two items allow us to construct formal solutions by following the recursive algorithm given in [4] for singular linear systems of ordinary differential equations. Our algorithm builds upon the package ISOLDE [9] and is implemented in the computer algebra system Maple.","PeriodicalId":243282,"journal":{"name":"International Symposium on Symbolic and Algebraic Computation","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Formal solutions of a class of Pfaffian systems in two variables\",\"authors\":\"Suzy S. Maddah, M. Barkatou, H. Abbas\",\"doi\":\"10.1145/2608628.2608656\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present an algorithm for computing a fundamental matrix of formal solutions of completely integrable Pfaffian systems with normal crossings in two variables. First, we associate to the Pfaffian system a singular linear system of ordinary differential equations from which its formal invariants can be efficiently derived. After that, we give a generalization of the Moser-based rank reduction algorithm of [5]. These two items allow us to construct formal solutions by following the recursive algorithm given in [4] for singular linear systems of ordinary differential equations. Our algorithm builds upon the package ISOLDE [9] and is implemented in the computer algebra system Maple.\",\"PeriodicalId\":243282,\"journal\":{\"name\":\"International Symposium on Symbolic and Algebraic Computation\",\"volume\":\"111 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-01-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Symbolic and Algebraic Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2608628.2608656\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Symbolic and Algebraic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2608628.2608656","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Formal solutions of a class of Pfaffian systems in two variables
In this paper, we present an algorithm for computing a fundamental matrix of formal solutions of completely integrable Pfaffian systems with normal crossings in two variables. First, we associate to the Pfaffian system a singular linear system of ordinary differential equations from which its formal invariants can be efficiently derived. After that, we give a generalization of the Moser-based rank reduction algorithm of [5]. These two items allow us to construct formal solutions by following the recursive algorithm given in [4] for singular linear systems of ordinary differential equations. Our algorithm builds upon the package ISOLDE [9] and is implemented in the computer algebra system Maple.