Decomposition of differential polynomials with constant coefficients

Authors:
Xiao-Shan Gao;Mingbo Zhang
Affiliations:
Institute of Systems Science, AMSS, Beijing, China;Institute of Systems Science, AMSS, Beijing, China
Venue:
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Year:
2004

Citing 19
Cited 2

Polynomial decomposition algorithms

Journal of Symbolic Computation
Polynomial decomposition algorithms

Journal of Symbolic Computation
A factorization algorithm for linear ordinary differential equations

ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Functional decomposition ofpolynomials: the tame case

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Complexity of factoring and calculating the GCD of linear ordinary differential operators

Journal of Symbolic Computation
Rational function decomposition

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Galois groups of second and third order linear differential equations

Journal of Symbolic Computation
An improved algorithm for factoring linear ordinary differential operators

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
An algorithm for complete enumeration of all factorizations of a linear ordinary differential operator

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Formal solutions and factorization of differential operators with power series coefficients

Journal of Symbolic Computation
Factorization of differential operators with rational functions coefficients

Journal of Symbolic Computation
On the equivalence problem of linear differential systems and its application for factoring completely reducible systems

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
On factorization of nonlinear ordinary differential equations

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Polynomial Decomposition Algorithm of Almost Quadratic Complexity

AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Fast Polynominal Decomposition Algorithms

EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Factorization of differential systems in characteristic p

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Factorization of linear differential operators in exponential extensions

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Factoring and decomposing ore polynomials over Fq(t)

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Factoring systems of linear PDEs with finite-dimensional solution spaces

Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)

Decomposition of ordinary difference polynomials

Journal of Symbolic Computation
Factorization of differential operators with ordinary differential polynomial coefficients

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation

Quantified Score

Hi-index	0.00

Visualization

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.