Abstract
In this article, we show how to generalize to the Darbouxian, Liouvillian and Riccati case the extactic curve introduced by J. Pereira. With this approach, we get new algorithms for computing, if it exists, a rational, Darbouxian, Liouvillian or Riccati first integral with bounded degree of a polynomial planar vector field. We give probabilistic and deterministic algorithms. The arithmetic complexity of our probabilistic algorithm is in \(\tilde{\mathcal {O}}(N^{\omega +1})\), where N is the bound on the degree of a representation of the first integral and \(\omega \in [2;3]\) is the exponent of linear algebra. This result improves previous algorithms. Our algorithms have been implemented in Maple and are available on the authors’ websites. In the last section, we give some examples showing the efficiency of these algorithms.
Similar content being viewed by others
References
J. Avellar, L.G.S. Duarte, and L.A.C.P. da Mota. PSsolver: A Maple implementation to solve first order ordinary differential equations with Liouvillian solutions. Computer Physics Communications, 183(10):2313 – 2314, 2012.
J. Avellar, L.G.S. Duarte, S.E.S. Duarte, and L.A.C.P. da Mota. Integrating first-order differential equations with Liouvillian solutions via quadratures: a semi-algorithmic method. Journal of Computational and Applied Mathematics, 182(2):327 – 332, 2005.
B. Beckermann and G. Labahn. A uniform approach for the fast computation of matrix-type Padé approximants. SIAM J. Matrix Anal. Appl., 15(3):804–823, 1994.
D. Bini and V. Pan. Polynomial and matrix computations. Vol. 1. Progress in Theoretical Computer Science. Birkhäuser Boston Inc., Boston, MA, 1994. Fundamental algorithms.
A. Bostan, G. Chèze, T. Cluzeau, and J.-A. Weil. Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields. Math. Comp., 85(299):1393–1425, 2016.
A. Bostan, F. Chyzak, F. Ollivier, B. Salvy, É. Schost, and A. Sedoglavic. Fast computation of power series solutions of systems of differential equations. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1012–1021, New York, 2007. ACM.
A. Bostan, G. Lecerf, E. Schost, E. Salvy, and B. Wiebelt. Complexity issues in bivariate polynomial factorization. In Proceedings of ISSAC’04, pages 42–49. ACM Press, 2004.
M. Bronstein. Symbolic integration. I, volume 1 of Algorithms and Computation in Mathematics. Springer-Verlag, Berlin, second edition, 2005. Transcendental functions, With a foreword by B. F. Caviness.
G. Casale. Feuilletages singuliers de codimension un, groupoïde de Galois et intégrales premières. Annales de l’Institut Fourier, 56(3):735–779, 2006.
G. Chèze. Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time. J. Complexity, 27(2):246–262, 2011.
G. Chèze. Décomposition et intégrales premières rationnelles: algorithmes et complexité. Habilitation thesis, Université Paul Sabatier, Toulouse 3, 2014.
G. Chèze. Bounding the number of remarkable values via Jouanolou’s theorem. Journal of Differential Equations, 258(10):3535 – 3545, 2015.
C. Christopher. Liouvillian first integrals of second order polynomial differential equations. Electron. J. Differential Equations, pages No. 49, 7 pp. (electronic), 1999.
C. Christopher, J. Llibre, and J. Pereira. Multiplicity of invariant algebraic curves in polynomial vector fields. Pacific J. Math., 229(1):63–117, 2007.
A. Clairaut. Recherches générales sur le calcul intégral. Mémoires de l’Académie Royale des Sciences, pages 425–436, 1739.
G. Darboux. Mémoire sur les équations diff’érentielles du premier ordre et du premier degré. Bull. Sci. Math., 32:60–96, 123–144, 151–200, 1878.
L. G. S. Duarte, S. E. S. Duarte, and L. A. C. P. da Mota. Analysing the structure of the integrating factors for first-order ordinary differential equations with Liouvillian functions in the solution. J. Phys. A, 35(4):1001–1006, 2002.
L. G. S. Duarte, S. E. S. Duarte, and L. A. C. P. da Mota. A method to tackle first-order ordinary differential equations with Liouvillian functions in the solution. J. Phys. A, 35(17):3899–3910, 2002.
F. Dumortier, J. Llibre, and J. Artés. Qualitative theory of planar differential systems. Universitext. Springer-Verlag, Berlin, 2006.
A. Ferragut and H. Giacomini. A new algorithm for finding rational first integrals of polynomial vector fields. Qual. Theory Dyn. Syst., 9(1-2):89–99, 2010.
A. Gabrielov. Multiplicities of zeroes of polynomials on trajectories of polynomial vector fields and bounds on degree of nonholonomy. Math. Res. Lett., 2(4):437–451, 1995.
J. von zur Gathen and J. Gerhard. Modern computer algebra. Cambridge University Press, New York, 1999.
A. Goriely. Integrability and nonintegrability of dynamical systems, volume 19 of Advanced Series in Nonlinear Dynamics. World Scientific Publishing Co. Inc., River Edge, NJ, 2001.
C.-P. Jeannerod, V. Neiger, E. Schost, and G. Villard. Computing minimal interpolation bases. Journal of Symbolic Computation, 83(Supplement C):272 – 314, 2017. Special issue on the conference ISSAC 2015: Symbolic computation and computer algebra.
J.-P. Jouanolou. Équations de Pfaff algébriques, volume 708 of Lecture Notes in Mathematics. Springer, Berlin, 1979.
D. Lay. Linear Algebra and Its Applications (5th Edition). Pearson, 2015.
G. Lecerf. Sharp precision in Hensel lifting for bivariate polynomial factorization. Math. Comp., 75(254):921–933, 2006.
Y.-K. Man. Computing closed form solutions of first order odes using the Prelle-Singer procedure. Journal of Symbolic Computation, 16(5):423 – 443, 1993.
Y.-K. Man and M. MacCallum. A rational approach to the Prelle-Singer algorithm. J. Symbolic Comput., 24(1):31–43, 1997.
J. Pereira. Vector fields, invariant varieties and linear systems. Ann. Inst. Fourier (Grenoble), 51(5):1385–1405, 2001.
É. Picard. Sur les intégrales doubles de fonctions rationnelles dont tous les résidus sont nuls. Bulletin des sciences mathématiques, série 2, 26, 1902.
M. Prelle and M. Singer. Elementary first integrals of differential equations. Trans. Amer. Math. Soc., 279(1):215–229, 1983.
J.-J. Risler. A bound for the degree of nonholonomy in the plane. Theoret. Comput. Sci., 157(1):129–136, 1996. Algorithmic complexity of algebraic and geometric models (Creteil, 1994).
W. Ruppert. Reduzibilität Ebener Kurven. J. Reine Angew. Math., 369:167–191, 1986.
A. Schinzel. Polynomials with special regard to reducibility, volume 77 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 2000. With an appendix by Umberto Zannier.
D. Schlomiuk. Elementary first integrals and algebraic invariant curves of differential equations. Exposition. Math., 11(5):433–454, 1993.
M. Singer. Liouvillian first integrals of differential equations. Trans. Amer. Math. Soc., 333(2):673–688, 1992.
X. Zhang. Integrability of Dynamical Systems: Algebra and Analysis. Developments in Mathematics. Springer Singapore, 2017.
W. Zhou and G. Labahn. Efficient algorithms for order basis computation. J. Symbolic Comput., 47(7):793–819, 2012.
Acknowledgements
Guillaume Chèze acknowledges the support and hospitality of the Laboratorio Fibonacci (Pisa) where a part of this work has been developed during November 2016 when he was visiting Thierry Combot. The authors thank the anonymous reviewers for their careful reading of our manuscript and for pointing out the reference [15].
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Evelyne Hubert.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Chèze, G., Combot, T. Symbolic Computations of First Integrals for Polynomial Vector Fields. Found Comput Math 20, 681–752 (2020). https://doi.org/10.1007/s10208-019-09437-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10208-019-09437-9