Xiao-Shan Gao
ABSTRACT
In this paper, we present an algorithm to decompose differential polynomials in one variable and with rational number as coefficients. Besides arithmetic operations, the algorithm needs only factorization of multi-variable polynomials and solution of linear equation systems. Experimental results show that our method is quite efficient.
- V.S. Alagar and M. Thanh. Fast decomposition algorithms. In Proc. EUROCAL 85, vol 2, 150--153, Springer, 1985. Google Scholar
Digital Library
- M.A. Barkatou and E. Pflugel. On the equivalence problem of linear differential systems and its application for factoring completely reducible systems. In Proc. of ISSAC'98, 268--275, ACM Press, 1998. Google ScholarDigital Library
- D.R. Barton and R.E. Zippel. Polynomial decomposition algorithms. J. of Symbolic Computation, 1(2), 159--168, 1985. Google ScholarDigital Library
- M. Bronstein. An improved algorithm for factorizing linear ordinary differential operators. In Proc. of ISSAC'94, ACM Press, 336--340, 1994. Google ScholarDigital Library
- M. Bronstein and M. Petkovsek. On Ore rings, linear operators and factorization. Programming & Computer Software 20, 1, 27--44, 1994.Google Scholar
- T. Cluzeau. Factorization of differential systems in characteristic p. In Proc. ISSAC'03, 58--65, ACM Press, 2003. Google ScholarDigital Library
- A. Fredet. Factorization of linear differential operators in exponential extensions. In Proc. of ISSAC03, 103--110, ACM Press, 2003. Google ScholarDigital Library
- X.S. Gao and M. Zhang. Decomposition of differential polynomials. In MM Res. Preprints, No. 22, 163--185, 2003. http://www.mmrc.iss.ac.cn/pub/mm-pre.htmlGoogle Scholar
- J.von zur Gathen. Functional decomposition of polynomials: the wild case. J. of Symbolic Computation, 9, 437--452, 1990; the tame case. J. of Symbolic Computation, 9, 281--299, 1990. Google ScholarDigital Library
- M. Giesbrecht and Y. Zhang. Factoring and decomposing Ore polynomials over Fq(t). In Proc. of ISSAC03, 127--135, ACM Press, 2003. Google ScholarDigital Library
- D.Y. Grigor'ev. Complexity of factoring and calculating the GCD of linear ordinary differential operators. J. of Symbolic Computation, 10, 7--37, 1990. Google ScholarDigital Library
- J. Gutierrez, T. Recio and C.R. de Velasco. Polynomial decomposition of almost quadratic complexity. In Proc. AAECC 6, Springer, 1989. Google ScholarDigital Library
- Z. Li, F. Schwarz and S.P. Tsarev. Factoring systems of linear PDEs with finite-dimensional solution spaces. J. Symbolic Computation 36(3--4), 443--471, 2003. Google ScholarDigital Library
- E.R. Kolchin. Differential Algebra and Algebraic Groups, Academic Press, London, 1973.Google Scholar
- L. Konigsberger. Allgemeine Untersuchungen aus der Theorie der Differentialgleichungen, Teubner, Leipzig, 1882.Google Scholar
- D. Kozen and S. Landau. Polynomial decomposition algorithms. J. of Symbolic computation 7, 445--456, 1989. Google ScholarDigital Library
- J.F. Ritt. Prime and composite pols. Trans. AMS, 23, 51--66, 1922.Google ScholarCross Ref
- F. Schwarz. A factoring algorithm for linear ordinary differential equations. In Proc. of ISSAC 89, ACM Press, 17--25, 1989. Google ScholarDigital Library
- M.F. Singer. Liouillian solutions of nth order homogeneous linear differential equations. Amer. J. of Math., 103(4), 661--682, 1981.Google ScholarCross Ref
- O. Ore. Theory of non-commutative polynomials. The Annals of Mathematics, 34(3), 480--508, 1933.Google ScholarCross Ref
- M.F. Singer and F. Ulmer. Galois groups of second and third order linear differential equations. J. of Symbolic Computation 16, 9--36, 1993. Google ScholarDigital Library
- M. Sosnin. Decomposition of polynomial ordinary differential equations. Krasnoyarsk, to be published, 1999.Google Scholar
- S.P. Tsarev. An algorithm for complete enumeration of all factorizations of a linear ordinary differential operator. In Proc. of ISSAC'96, 226--231, ACM Press, 1996. Google ScholarDigital Library
- S.P. Tsarev. On factorization of non-linear ordinary differential equations. In Proc. ISSAC 99, 159--164, ACM Press, 1999. Google ScholarDigital Library
- H. Umemura. On the irreducibility of the first differential equation of Painleve. In Algebraic geometry and commutative algebra in honor of Masayoshi Nagata, Tokyo, 101--109, 1987.Google Scholar
- M. van Hoeij. Factorization of differential operators with rational functions coefficients. J. Symbolic Computation 24(5), 537--561, 1997. Google ScholarDigital Library
- M. van Hoeij. Formal solutions and factorization of differential operators with power series coefficients. J. Symbolic Computation, 24, 1--30 1997. Google ScholarDigital Library
- M. Van der Put and M.F. Singer. Galois theory of linear differential equations, Springer, Berlin, 2003.Google ScholarCross Ref
- R.E. Zippel. Rational function decomposition. In Proc. of ISSAC'91, 1--6, ACM Press, 1991. Google ScholarDigital Library
Index Terms
- Decomposition of differential polynomials with constant coefficients
Recommendations
Factorization of differential operators with ordinary differential polynomial coefficients
ISSAC '12: Proceedings of the 37th International Symposium on Symbolic and Algebraic ComputationIn this paper, we present an algorithm to factor a differential operator L = σn + cn 1σn-1 + ··· + c1σ+c0 with coefficients ci in C{y}, where C is a constant field and C{y} is the ordinary differential polynomial ring over C. Also, we discuss the ...
Computing GCRDs of approximate differential polynomials
SNC '14: Proceedings of the 2014 Symposium on Symbolic-Numeric ComputationDifferential (Ore) type polynomials with approximate polynomial coefficients are introduced. These provide a useful representation of approximate differential operators with a strong algebraic structure, which has been used successfully in the exact, ...
Wronskian type determinants of orthogonal polynomials, Selberg type formulas and constant term identities
Let (p"n)"n be a sequence of orthogonal polynomials with respect to the measure @m. Let T be a linear operator acting in the linear space of polynomials P and satisfying deg(T(p))=deg(p)-1, for all polynomial p. We then construct a sequence of ...
Comments