{"title":"分解n个变量的线性微分算子","authors":"M. Giesbrecht, A. Heinle, V. Levandovskyy","doi":"10.1145/2608628.2608667","DOIUrl":null,"url":null,"abstract":"In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial nth Weyl algebra, the polynomial nth shift algebra, and Zn-graded polynomials in the nth <u>q</u>-Weyl algebra.\n The most unexpected result is that this noncommutative problem of factoring partial differential operators can be approached effectively by reducing it to the problem of solving systems of polynomial equations over a commutative ring. In the case where a given polynomial is Zn-graded, we can reduce the problem completely to factoring an element in a commutative multivariate polynomial ring.\n The implementation in Singular is effective on a broad range of polynomials and increases the ability of computer algebra systems to address this important problem. We compare the performance and output of our algorithm with other implementations in major computer algebra systems on nontrivial examples.","PeriodicalId":243282,"journal":{"name":"International Symposium on Symbolic and Algebraic Computation","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Factoring linear differential operators in n variables\",\"authors\":\"M. Giesbrecht, A. Heinle, V. Levandovskyy\",\"doi\":\"10.1145/2608628.2608667\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial nth Weyl algebra, the polynomial nth shift algebra, and Zn-graded polynomials in the nth <u>q</u>-Weyl algebra.\\n The most unexpected result is that this noncommutative problem of factoring partial differential operators can be approached effectively by reducing it to the problem of solving systems of polynomial equations over a commutative ring. In the case where a given polynomial is Zn-graded, we can reduce the problem completely to factoring an element in a commutative multivariate polynomial ring.\\n The implementation in Singular is effective on a broad range of polynomials and increases the ability of computer algebra systems to address this important problem. We compare the performance and output of our algorithm with other implementations in major computer algebra systems on nontrivial examples.\",\"PeriodicalId\":243282,\"journal\":{\"name\":\"International Symposium on Symbolic and Algebraic Computation\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Symbolic and Algebraic Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2608628.2608667\",\"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.2608667","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Factoring linear differential operators in n variables
In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial nth Weyl algebra, the polynomial nth shift algebra, and Zn-graded polynomials in the nth q-Weyl algebra.
The most unexpected result is that this noncommutative problem of factoring partial differential operators can be approached effectively by reducing it to the problem of solving systems of polynomial equations over a commutative ring. In the case where a given polynomial is Zn-graded, we can reduce the problem completely to factoring an element in a commutative multivariate polynomial ring.
The implementation in Singular is effective on a broad range of polynomials and increases the ability of computer algebra systems to address this important problem. We compare the performance and output of our algorithm with other implementations in major computer algebra systems on nontrivial examples.