Abstract
In this paper, the problem of the construction of a characteristic set in the sense of Kolchin for a radical differential ideal is considered. Algorithms for constructing such sets in the ordinary case for arbitrary radical differential ideals, which are based on the estimate of the orders of their elements, are presented. These algorithms are applicable in the case of an orderly ranking on the set of the derivatives. Advantages of the regular and characteristic decompositions of radical differential ideals are discussed.
Similar content being viewed by others
REFERENCES
Gallo, G. and Mishra, B., Efficient Algorithms and Bounds for Wu-Ritt Characteristic Sets, Effective Methods in Algebraic Geometry. Progress in Mathematics, Mora, F. and Traverso, C., Eds., Boston: Birkhauser, 1991, vol. 94, pp. 119–142.
Gallo, G. and Mishra, B., Wu-Ritt Characteristic Sets and Their Complexity, Discrete and Computational Geometry: Papers from the DIMASC Special Year, Goodman, J.E., Pollack, R., and Steiger, W., Eds., Dimacs Series in Discrete Mathematics and Theoretical Computer Science, AMS and ACM, 1991, vol. 6, pp. 111–136.
Gallo, G. and Mishra, B., Recent Progress in Characteristic Set Computation: Complexity and Open Problems, Proc. of the Int. Workshop on Mathematics Mechanization, Wu Wen-Tsun and Cheng Min-De, Eds., Institute of Systems Science, Academia Sinica, Beijing: Int. Academic, 1992, pp. 28–37.
Sadik, B., A Bound for the Order of Characteristic Set Elements of an Ordinary Prime Differential Ideal and Some Applications, Appl. Algebra Eng. Commun. Comput., 2000, vol. 10, no.3, pp. 251–268.
Boulier, F., Lazard, D., Ollivier, F., and Petitot, M., Representation for the Radical of a Finitely Generated Differential Ideal, ISSAC, 1995, pp. 158–166.
Boulier, F., Lazard, D., Ollivier, F., and Petitot, M., Computing Representations for Radicals of Finitely Generated Differential Ideals, Technical Report IT-306, LIFL, 1997, http: //www.lifl.fr/boulier/jsc6.ps.gz.
Hubert, E., Factorization-free Decomposition Algorithms in Differential Algebra, J. Symbolic Computation, 2000, vol. 29, pp. 640–87.
Hubert, E., Notes on Triangular Sets and Triangulation—Decomposition Algorithms II: Differential Systems, Symbolic and Numerical Scientific Computing, 2003, vol. 2001, pp. 40–87.
Kondratieva, M.V., Examples of Computation of Generators of a Differential Ideal by Its Characteristic Set, Programming and Computer Software, 2002, no. 2, pp. 81–83.
Ovchinnikov, A.I., Characterizable Radical Differential Ideals and Some Properties of Characteristic Sets, Programming and Computer Software, 2004, no. 3, pp. 141–149.
Ovchinnikov, A.I., On Characterizable Ideals and Characteristic Sets, Contributions to General Algebra, 2004, vol. 14, pp. 91–108.
Sit, W.Y., The Ritt-Kolchin Theory for Differential Polynomials, Differential Algebra and Related Topics (Proc. of the Int. Workshop NJSU, 2000), Li, G., Keigher, W.P., Cassidy, P.J., and Sit, W.Y., Eds., 2002.
Becker, T. and Weispfenning, V., Gröbner Bases, New York: Springer, 1993.
Kolchin, E.R., Differential Algebra and Algebraic Groups, Academic, 1973.
Konndratieva, M.V., Levin, A.B., Mikhalev, A.V., and Pankratiev, E.V., Differential and Difference Dimension Polynomials, Kluwer Academic, 1999.
Sadik, B., Computing Characteristic Sets of Radical Differential Ideals, http: //www.medics.poly-technique.fr/~brahim/RADICA.ps.
Author information
Authors and Affiliations
Additional information
Translated from Programmirovanie, Vol. 31, No. 2, 2005.
Original Russian Text Copyright © 2005 by Kondratieva, Ovchinnikov.
Rights and permissions
About this article
Cite this article
Kondratieva, M.V., Ovchinnikov, A.I. Characteristic sets for ordinary differential equations. Program Comput Soft 31, 91–96 (2005). https://doi.org/10.1007/s11086-005-0019-3
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11086-005-0019-3