An algorithm for the decomposition of differential polynomials in the general case

ISSN： 0361-7688

Source： Programming and Computer Software, Vol.37, Iss.4, 2011-07, pp. : 181-186

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Generalized Reduction in Rings of Differential Polynomials

By Zobnin A. I.

Programming and Computer Software, Vol. 30, Iss. 2, 2004-03 ,pp. : 88-94

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Quantifier Elimination for Trigonometric Polynomials by Cylindrical Trigonometric Decomposition

By Pau P. Schicho J.

Journal of Symbolic Computation, Vol. 29, Iss. 6, 2000-06 ,pp. : 971-983

Academic Press

Access to resources Recommend Favorite

A computationally faster algorithm to test the stability of characteristic polynomials

By Kavitha Panneerselvam Ramakalyan Ayyagari

International Journal of Systems, Control and Communications, Vol. 5, Iss. 2, 2013-08 ,pp. : 166-176

Inderscience Publishers

Access to resources Recommend Favorite

An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials

By Fortune S.

Journal of Symbolic Computation, Vol. 33, Iss. 5, 2002-05 ,pp. : 627-646

Academic Press

Access to resources Recommend Favorite

Membership problem for differential ideals generated by a composition of polynomials

By Kondratieva M. Zobnin A.

Programming and Computer Software, Vol. 32, Iss. 3, 2006-05 ,pp. : 123-127

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite