A Maple algorithm that tries to recover a rational transformation reducing a rational ODE to a sum-of-powers form, handling cancellations between numerator and denominator, but without a proven success guarantee.
First order ODEs, Symmetries and Linear Transformations
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
An algorithm for solving first order ODEs, by systematically determining symmetries of the form [ xi = F(x), eta = P(x) y + Q(x) ], where xi d/dx + eta d/dy is the symmetry generator - is presented. To these {\it linear} symmetries one can associate an ODE class which embraces all first order ODEs mappable into separable through linear transformations {t = f(x), u = p(x) y + q(x)}. This single ODE class includes as members, for instance, 78% of the 552 solvable first order examples of Kamke's book. Concerning the solving of this class, a restriction on the algorithm being presented exists only in the case of Riccati type ODEs, for which linear symmetries {\it always} exist but the algorithm will succeed in finding them only partially.
citation-role summary
citation-polarity summary
fields
cs.SC 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Generalized ODE reduction algorithm for bounded degree transformation
A Maple algorithm that tries to recover a rational transformation reducing a rational ODE to a sum-of-powers form, handling cancellations between numerator and denominator, but without a proven success guarantee.