Factoring linear partial differential operators in n variables. (July 2016)

• Record Type: Journal Article
• Authors: Giesbrecht, Mark; Heinle, Albert; Levandovskyy, Viktor
• Is Part Of: Journal of symbolic computation. Volume 75(2016)
• Page Start: 127
• Page End: 148
• Publication Date: 2016-07
• Subjects: Factorization -- Linear partial differential operators -- Non-commutative algebra -- Singular -- Weyl algebra; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2015.11.011
• Languages: English
• ISSNs: 0747-7171

Abstract

Abstract: In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial n th Weyl algebra, the polynomial n th shift algebra, and Z n -graded polynomials in the n th 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 Z n -graded, we can reduce the problem completely to factoring an element in a commutative multivariate polynomial ring. The implementation inSingular 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.