2.1.571 Problem 587

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

Internal problem ID [9743]
Book : Collection of Kovacic problems
Section : section 1
Problem number : 587
Date solved : Sunday, March 30, 2025 at 02:45:39 PM
CAS classification : [[_2nd_order, _with_linear_symmetries]]

Solved as second order ode using Kovacic algorithm

Time used: 0.248 (sec)

Writing the ode as

(1)(x3+x2)y+(5x23x)y+(45x)y=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=x3+x2(3)B=5x23xC=45x

Applying the Liouville transformation on the dependent variable gives

z(x)=yeB2Adx

Then (2) becomes

(4)z(x)=rz(x)

Where r is given by

(5)r=st=2AB2BA+B24AC4A2

Substituting the values of A,B,C from (3) in the above and simplifying gives

(6)r=15x26x14(x2x)2

Comparing the above to (5) shows that

s=15x26x1t=4(x2x)2

Therefore eq. (4) becomes

(7)z(x)=(15x26x14(x2x)2)z(x)

Equation (7) is now solved. After finding z(x) then y is found using the inverse transformation

y=z(x)eB2Adx

The first step is to determine the case of Kovacic algorithm this ode belongs to. There are 3 cases depending on the order of poles of r and the order of r at . The following table summarizes these cases.

Case

Allowed pole order for r

Allowed value for O()

1

{0,1,2,4,6,8,}

{,6,4,2,0,2,3,4,5,6,}

2

Need to have at least one pole that is either order 2 or odd order greater than 2. Any other pole order is allowed as long as the above condition is satisfied. Hence the following set of pole orders are all allowed. {1,2},{1,3},{2},{3},{3,4},{1,2,5}.

no condition

3

{1,2}

{2,3,4,5,6,7,}

Table 2.571: Necessary conditions for each Kovacic case

The order of r at is the degree of t minus the degree of s. Therefore

O()=deg(t)deg(s)=42=2

The poles of r in eq. (7) and the order of each pole are determined by solving for the roots of t=4(x2x)2. There is a pole at x=0 of order 2. There is a pole at x=1 of order 2. Since there is no odd order pole larger than 2 and the order at is 2 then the necessary conditions for case one are met. Since there is a pole of order 2 then necessary conditions for case two are met. Since pole order is not larger than 2 and the order at is 2 then the necessary conditions for case three are met. Therefore

L=[1,2,4,6,12]

Attempting to find a solution using case n=1.

Looking at poles of order 2. The partial fractions decomposition of r is

r=2(1+x)22x+21+x14x2

For the pole at x=0 let b be the coefficient of 1x2 in the partial fractions decomposition of r given above. Therefore b=14. Hence

[r]c=0αc+=12+1+4b=12αc=121+4b=12

For the pole at x=1 let b be the coefficient of 1(1+x)2 in the partial fractions decomposition of r given above. Therefore b=2. Hence

[r]c=0αc+=12+1+4b=2αc=121+4b=1

Since the order of r at is 2 then [r]=0. Let b be the coefficient of 1x2 in the Laurent series expansion of r at . which can be found by dividing the leading coefficient of s by the leading coefficient of t from

r=st=15x26x14(x2x)2

Since the gcd(s,t)=1. This gives b=154. Hence

[r]=0α+=12+1+4b=52α=121+4b=32

The following table summarizes the findings so far for poles and for the order of r at where r is

r=15x26x14(x2x)2

pole c location pole order [r]c αc+ αc
0 2 0 12 12
1 2 0 2 1

Order of r at [r] α+ α
2 0 52 32

Now that the all [r]c and its associated αc± have been determined for all the poles in the set Γ and [r] and its associated α± have also been found, the next step is to determine possible non negative integer d from these using

d=αs()cΓαcs(c)

Where s(c) is either + or and s() is the sign of α±. This is done by trial over all set of families s=(s(c))cΓ until such d is found to work in finding candidate ω. Trying α+=52 then

d=α+(αc1++αc2+)=52(52)=0

Since d an integer and d0 then it can be used to find ω using

ω=cΓ(s(c)[r]c+αcs(c)xc)+s()[r]

Substituting the above values in the above results in

ω=((+)[r]c1+αc1+xc1)+((+)[r]c2+αc2+xc2)+(+)[r]=12x+21+x+(0)=12x+21+x=1+5x2x(1+x)

Now that ω is determined, the next step is find a corresponding minimal polynomial p(x) of degree d=0 to solve the ode. The polynomial p(x) needs to satisfy the equation

(1A)p+2ωp+(ω+ω2r)p=0

Let

(2A)p(x)=1

Substituting the above in eq. (1A) gives

(0)+2(12x+21+x)(0)+((12x22(1+x)2)+(12x+21+x)2(15x26x14(x2x)2))=00=0

The equation is satisfied since both sides are zero. Therefore the first solution to the ode z=rz is

z1(x)=peωdx=e(12x+21+x)dx=x(1+x)2

The first solution to the original ode in y is found from

y1=z1e12BAdx=z1e125x23xx3+x2dx=z1e3ln(x)2+ln(1+x)=z1(x3/2(1+x))

Which simplifies to

y1=x2(1+x)3

The second solution y2 to the original ode is found using reduction of order

y2=y1eBAdxy12dx

Substituting gives

y2=y1e5x23xx3+x2dx(y1)2dx=y1e3ln(x)+2ln(1+x)(y1)2dx=y1(ln(x)13(1+x)311+x+12(1+x)2ln(1+x))

Therefore the solution is

y=c1y1+c2y2=c1(x2(1+x)3)+c2(x2(1+x)3(ln(x)13(1+x)311+x+12(1+x)2ln(1+x)))

Will add steps showing solving for IC soon.

Maple. Time used: 0.005 (sec). Leaf size: 47
ode:=x^2*(1-x)*diff(diff(y(x),x),x)-x*(3-5*x)*diff(y(x),x)+(4-5*x)*y(x) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=x2(c1(1+x)3+c2((1+x)3ln(1+x)+(1+x)3ln(x)x2+5x2116))

Maple trace

Methods for second order ODEs: 
--- Trying classification methods --- 
trying a quadrature 
checking if the LODE has constant coefficients 
checking if the LODE is of Euler type 
trying a symmetry of the form [xi=0, eta=F(x)] 
checking if the LODE is missing y 
-> Trying a Liouvillian solution using Kovacics algorithm 
   A Liouvillian solution exists 
   Reducible group (found an exponential solution) 
   Group is reducible, not completely reducible 
<- Kovacics algorithm successful
 

Mathematica. Time used: 0.244 (sec). Leaf size: 104
ode=x^2*(1-x)*D[y[x],{x,2}]-x*(3-5*x)*D[y[x],x]+(4-5*x)*y[x]==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)exp(1x(12K[1]+2K[1]1)dK[1]121x(3K[2]2K[2]1)dK[2])(c21xexp(21K[3]15K[1]2K[1]2K[1]2dK[1])dK[3]+c1)
Sympy
from sympy import * 
x = symbols("x") 
y = Function("y") 
ode = Eq(x**2*(1 - x)*Derivative(y(x), (x, 2)) - x*(3 - 5*x)*Derivative(y(x), x) + (4 - 5*x)*y(x),0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
False