Symbolic computations of first integrals for polynomial vector fields (Q2194771)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Symbolic computations of first integrals for polynomial vector fields
scientific article

    Statements

    Symbolic computations of first integrals for polynomial vector fields (English)
    0 references
    0 references
    0 references
    7 September 2020
    0 references
    In the paper, the authors generalize the extactic curve introduced by J. Pereira (in fact, proposed first by Mikhail Nikolaevich Lagutinskii (1871--1915)) to the Darbouxian, Liouvillian and Riccati integrability. Using this approach, the authors present new algorithms for computing, if it exists, a rational, Darbouxian, Liouvillian or Riccati first integral for polynomial planar vector fields with bounded degree. Probabilistic and deterministic algorithms are presented where it is also analyzed the arithmetic complexity of the probabilistic one. The algorithms presented improves previous ones. The algorithms have been implemented in Maple and are available on the authors' websites. In the last section of the paper some examples are presented showing the efficiency of the algorithms. The algorithms presented generalize to the Darbouxian, Liouvillian and Riccati cases the algorithm proposed in [\textit{A. Bostan} et al., Math. Comput. 85, No. 299, 1393--1425 (2016; Zbl 1335.34002)] for computing rational first integrals. It is important to remark that the method presented avoids the computation of Darboux polynomials and then does not need a recombination step of the associated cofactors.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    first integrals
    0 references
    symbolic computations
    0 references
    complexity analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references