Algorithm for finding reduction transformation that transforms a rational ODE to solvable structure

The integrability problem of rational first order ODE y'=M(x,y)/N(x,y), M,N in R[x,y], which can be viewed as a planar vector field, has been a long term research interest in area of dynamical system, physics etc. Since the invention of the computer algebra system, many algorithms have been developed to find the explicit first integral of such ODE and Maple has the most advanced function, called dsolve to handle this problem. In this paper, we would like to introduce an efficient algorithm which can be viewed as a supplement of the existing dsolve command, to judge whether a given rational ODE is of "reducible" structure, that is, via a rational, non-linear algebraic transformation in terms of the variable y, the ODE can be reduced to a more simple structure y'=Σni=0 fi(x)yi. Many of the known solvable ODE, including Bernoulli, Riccati, Abel, Chini are of this structure, and the integrable type of such ODE can be classified using invariants under linear transformation. We have implemented this algorithm based on Maple. And the overall performance and efficiency of this algorithm is considerable.

Authors

Institutions

Publication Details

Journal
Maple Transactions
Published
2025-06-06
DOI
https://doi.org/10.5206/mt.v5i2.22175
Primary Topic
Engineering Technology and Methodologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Algorithm for finding reduction transformation that transforms a rational ODE to solvable structure

S.-L. Tracy Huang
Maple Transactions
Engineering Technology and Methodologies
article

Algorithm for finding reduction transformation that transforms a rational ODE to solvable structure

S.-L. Tracy Huang
article en

Abstract

The integrability problem of rational first order ODE y'=M(x,y)/N(x,y), M,N in R[x,y], which can be viewed as a planar vector field, has been a long term research interest in area of dynamical system, physics etc. Since the invention of the computer algebra system, many algorithms have been developed to find the explicit first integral of such ODE and Maple has the most advanced function, called dsolve to handle this problem. In this paper, we would like to introduce an efficient algorithm which can be viewed as a supplement of the existing dsolve command, to judge whether a given rational ODE is of "reducible" structure, that is, via a rational, non-linear algebraic transformation in terms of the variable y, the ODE can be reduced to a more simple structure y'=Σni=0 fi(x)yi. Many of the known solvable ODE, including Bernoulli, Riccati, Abel, Chini are of this structure, and the integrable type of such ODE can be classified using invariants under linear transformation. We have implemented this algorithm based on Maple. And the overall performance and efficiency of this algorithm is considerable.

Maple TransactionsVol. 5(2)
Chinese University of Hong Kong, Shenzhen (CN)
Openalex Percentile: Top 82%
Engineering Technology and Methodologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Algorithm for finding reduction transformation that transforms a rational ODE to solvable structure — S.-L. Tracy Huang · Maple Transactions (2025) | TGRS Research Map | TGRS