Mark Giesbrecht
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.
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.
- S. Abramov. Problems of computer algebra involved in the search for polynomial solutions of linear differential and difference equations. Mosc. Univ. Comput. Math. Cybern., 1989(3):63--68, 1989.Google Scholar
- S. Abramov and M. Petkovšek. On polynomial solutions of linear partial differential and (q-)difference equations. In Proc. CASC 2012, pages 1--11. Berlin: Springer, 2012. Google ScholarDigital Library
- S. A. Abramov, M. Bronstein, and M. Petkovšek. On polynomial solutions of linear operator equations. In Proc. ISSAC 1995, pages 290--296. ACM Press, 1995. Google ScholarDigital Library
- D. Andres. Noncommutative Computer Algebra with Applications in in Algebraic Analysis. PhD thesis, RWTH Aachen University, 2013.Google Scholar
- O. Bachmann and H.-G. Gräbe. The symbolicdata project. In Reports on Computer Algebra, volume 27. 2000.Google Scholar
- R. Beals and E. A. Kartashova. Constructively factoring linear partial differential operators in two variables. Theor. Math. Phys., 145(2):1511--1524, 2005.Google ScholarCross Ref
- B. Buchberger. Introduction to Groebner bases. Berlin: Springer, 1997.Google Scholar
- J. Bueso, J. Gómez-Torrecillas, and A. Verschoren. Algorithmic methods in non-commutative algebra. Applications to quantum groups. Dordrecht: Kluwer Academic Publishers, 2003.Google Scholar
- W. Decker, G.-M. Greuel, G. Pfister, and H. Schönemann. Singular 3-1-6 --- A computer algebra system for polynomial computations. 2012. http://www.singular.uni-kl.de.Google Scholar
- M. Foupouagnigni, W. Koepf, and A. Ronveaux. Factorization of fourth-order differential equations for perturbed classical orthogonal polynomials. J. Comp. Appl. Math., 162(2):299--326, 2004. Google ScholarDigital Library
- I. M. Gel'fand and A. A. Kirillov. Sur les corps Liés aux algèbres enveloppantes des algèbres de Lie. Publications Mathématiques de l'IHÉS, 31:5--19, 1966.Google Scholar
- D. Grigor'ev. Complexity of factoring and calculating the GCD of linear ordinary differential operators. J. Symb. Comput., 10(1):7--37, 1990. Google ScholarDigital Library
- D. Grigoriev and F. Schwarz. Factoring and solving linear partial differential equations. Computing, 73(2):179--197, 2004. Google ScholarDigital Library
- A. Heinle and V. Levandovskyy. Factorization of polynomials in Z-graded skew polynomial rings. ACM Commun. Comput. Algebra, 44(3/4):113--114, 2011. Google ScholarDigital Library
- A. Heinle and V. Levandovskyy. Factorization of Z-homogeneous polynomials in the first (q)--Weyl algebra. arXiv preprint arXiv:1302.5674, 2013.Google Scholar
- A. Heinle, V. Levandovskyy, and A. Nareike. Symbolicdata: SDeval --- benchmarking for everyone. arXiv preprint arXiv:1310.5551, 2013.Google Scholar
- M. Kashiwara. Vanishing cycle sheaves and holonomic systems of differential equations. In Algebraic Geometry, pages 134--142. Springer, 1983.Google Scholar
- W. Koepf. Hypergeometric summation. An algorithmic approach to summation and special function identities. Wiesbaden: Vieweg, 1998.Google Scholar
- E. Landau. Ein Satz über die Zerlegung homogener linearer Differentialausdrücke in irreductible Factoren. Journal für die reine und angewandte Mathematik, 124:115--120, 1902.Google Scholar
- A. Loewy. Über reduzible lineare homogene Differentialgleichungen. Math. Ann., 56:549--584, 1903.Google ScholarCross Ref
- A. Loewy. Über vollständig reduzible lineare homogene Differentialgleichungen. Math. Ann., 62:89--117, 1906.Google ScholarCross Ref
- B. Malgrange. Polynômes de Bernstein-Sato et cohomologie evanescente. Astérisque, 101-102:243--267, 1983.Google Scholar
- H. Melenk and J. Apel. REDUCE package NCPOLY: Computation in non-commutative polynomial ideals. Konrad-Zuse-Zentrum Berlin (ZIB), 1994.Google Scholar
- M. B. Monagan, K. O. Geddes, K. M. Heal, G. Labahn, S. M. Vorkoetter, J. McCarron, and P. DeMarco. Maple Introductory Programming Guide. Maplesoft, 2008.Google Scholar
- M. Saito, B. Sturmfels, and N. Takayama. Gröbner deformations of hypergeometric differential equations. Berlin: Springer, 2000. Google ScholarDigital Library
- F. Schwarz. A factorization algorithm for linear ordinary differential equations. In Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, pages 17--25. ACM, 1989. Google ScholarDigital Library
- F. Schwarz. Alltypes in the web. ACM Commun. Comput. Algebra, 42(3):185--187, Feb. 2009. Google ScholarDigital Library
- E. Shemyakova. Parametric factorizations of second-, third- and fourth-order linear partial differential operators with a completely factorable symbol on the plane. Mathematics in Computer Science, 1(2):225--237, 2007.Google ScholarCross Ref
- E. Shemyakova. Multiple factorizations of bivariate linear partial differential operators. In Proc. CASC 2009, pages 299--309. Springer, 2009. Google ScholarDigital Library
- E. Shemyakova. Refinement of two-factor factorizations of a linear partial differential operator of arbitrary order and dimension. Mathematics in Computer Science, 4:223--230, 2010. 10.1007/s11786-010-0052-3.Google ScholarCross Ref
- S. Tsarev. Problems that appear during factorization of ordinary linear differential operators. Program. Comput. Softw., 20(1):27--29, 1994.Google Scholar
- S. Tsarev. An algorithm for complete enumeration of all factorizations of a linear ordinary differential operator. In Proc. ISSAC 1996. New York, NY: ACM Press, 1996. Google ScholarDigital Library
- M. van Hoeij. Factorization of linear differential operators. PhD thesis, University of Nijmegen, 1996.Google Scholar
- M. van Hoeij. Factorization of differential operators with rational functions coefficients. J. Symb. Comput., 24(5):537--561, 1997. Google ScholarDigital Library
- M. van Hoeij. Formal solutions and factorization of differential operators with power series coefficients. J. Symb. Comput., 24(1):1--30, 1997. Google ScholarDigital Library
- M. van Hoeij and Q. Yuan. Finding all Bessel type solutions for linear differential equations with rational function coefficients. In Proc. ISSAC 2010, pages 37--44. ACM Press, 2010. Google ScholarDigital Library
Index Terms
- Factoring linear differential operators in n variables
Recommendations
Factoring linear partial 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 Z n -graded polynomials in the nth q _ -Weyl algebra.The most unexpected result ...
A Constructive Study of the Module Structure of Rings of Partial Differential Operators
The purpose of this paper is to develop constructive versions of Stafford's theorems on the module structure of Weyl algebras A n (k) (i.e., the rings of partial differential operators with polynomial coefficients) over a base field k of characteristic ...
Factoring the characteristic polynomial of a lattice
We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain this ...
Comments