2.1.301 Problem 304

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

Internal problem ID [9471]
Book : Collection of Kovacic problems
Section : section 1
Problem number : 304
Date solved : Friday, April 25, 2025 at 06:09:10 PM
CAS classification : [[_2nd_order, _with_linear_symmetries]]

Solve

x2(1+x)y(1+2x)(xyy)=0

Solved as second order ode using Kovacic algorithm

Time used: 0.299 (sec)

Writing the ode as

(1)x2(1+x)y+(2x2x)y+(1+2x)y=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=x2(1+x)(3)B=2x2xC=1+2x

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=4x14(x2+x)2

Comparing the above to (5) shows that

s=4x1t=4(x2+x)2

Therefore eq. (4) becomes

(7)z(x)=(4x14(x2+x)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.301: 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)=41=3

The poles of r in eq. (7) and the order of each pole are determined by solving for the roots of t=4(x2+x)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 3 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 3 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=12+2x12x14x2+34(1+x)2

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=34. Hence

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

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

Since the order of r at is 3>2 then

[r]=0α+=0α=1

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

r=4x14(x2+x)2

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

Order of r at [r] α+ α
3 0 0 1

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 α+=0 then

d=α+(αc1+αc2+)=0(0)=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+αc1xc1)+((+)[r]c2+αc2+xc2)+(+)[r]=12(1+x)+12x+(0)=12(1+x)+12x=12x(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(12(1+x)+12x)(0)+((12(1+x)212x2)+(12(1+x)+12x)2(4x14(x2+x)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(12(1+x)+12x)dx=x1+x

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

y1=z1e12BAdx=z1e122x2xx2(1+x)dx=z1eln(x(1+x))2=z1(x(1+x))

Which simplifies to

y1=x(1+x)x1+x

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

y2=y1eBAdxy12dx

Substituting gives

y2=y1e2x2xx2(1+x)dx(y1)2dx=y1eln(x(1+x))(y1)2dx=y1(x+ln(x))

Therefore the solution is

y=c1y1+c2y2=c1(x(1+x)x1+x)+c2(x(1+x)x1+x(x+ln(x)))

Will add steps showing solving for IC soon.

Maple. Time used: 0.004 (sec). Leaf size: 15
ode:=x^2*(1+x)*diff(diff(y(x),x),x)-(1+2*x)*(x*diff(y(x),x)-y(x)) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=x(c2ln(x)+c2x+c1)

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
 

Maple step by step

Let’s solvex2(1+x)(ddxddxy(x))(1+2x)(x(ddxy(x))y(x))=0Highest derivative means the order of the ODE is2ddxddxy(x)Isolate 2nd derivativeddxddxy(x)=(1+2x)y(x)x2(1+x)+(1+2x)(ddxy(x))x(1+x)Group terms withy(x)on the lhs of the ODE and the rest on the rhs of the ODE; ODE is linearddxddxy(x)(1+2x)(ddxy(x))x(1+x)+(1+2x)y(x)x2(1+x)=0Check to see ifx0is a regular singular pointDefine functions[P2(x)=1+2xx(1+x),P3(x)=1+2xx2(1+x)](1+x)P2(x)is analytic atx=1((1+x)P2(x))|x=1=1(1+x)2P3(x)is analytic atx=1((1+x)2P3(x))|x=1=0x=1is a regular singular pointCheck to see ifx0is a regular singular pointx0=1Multiply by denominatorsx2(1+x)(ddxddxy(x))(1+2x)x(ddxy(x))+(1+2x)y(x)=0Change variables usingx=u1so that the regular singular point is atu=0(u32u2+u)(ddudduy(u))+(2u2+3u1)(dduy(u))+(1+2u)y(u)=0Assume series solution fory(u)y(u)=k=0akuk+rRewrite ODE with series expansionsConvertumy(u)to series expansion form=0..1umy(u)=k=0akuk+r+mShift index usingk>kmumy(u)=k=makmuk+rConvertum(dduy(u))to series expansion form=0..2um(dduy(u))=k=0ak(k+r)uk+r1+mShift index usingk>k+1mum(dduy(u))=k=1+mak+1m(k+1m+r)uk+rConvertum(ddudduy(u))to series expansion form=1..3um(ddudduy(u))=k=0ak(k+r)(k+r1)uk+r2+mShift index usingk>k+2mum(ddudduy(u))=k=2+mak+2m(k+2m+r)(k+1m+r)uk+rRewrite ODE with series expansionsa0r(2+r)u1+r+(a1(1+r)(1+r)a0(2r25r+1))ur+(k=1(ak+1(k+1+r)(k+r1)ak(2k2+4kr+2r25k5r+1)+ak1(k+r2)(k3+r))uk+r)=0a0cannot be 0 by assumption, giving the indicial equationr(2+r)=0Values of r that satisfy the indicial equationr{0,2}Each term must be 0a1(1+r)(1+r)a0(2r25r+1)=0Each term in the series must be 0, giving the recursion relation(2ak+ak1+ak+1)k2+((4ak+2ak1+2ak+1)r+5ak5ak1)k+(2ak+ak1+ak+1)r2+(5ak5ak1)rak+6ak1ak+1=0Shift index usingk>k+1(2ak+1+ak+ak+2)(k+1)2+((4ak+1+2ak+2ak+2)r+5ak+15ak)(k+1)+(2ak+1+ak+ak+2)r2+(5ak+15ak)rak+1+6akak+2=0Recursion relation that defines series solution to ODEak+2=k2ak2k2ak+1+2krak4krak+1+r2ak2r2ak+13kak+kak+13rak+rak+1+2ak+2ak+1k2+2kr+r2+2k+2rRecursion relation forr=0ak+2=k2ak2k2ak+13kak+kak+1+2ak+2ak+1k2+2kSeries not valid forr=0, division by0in the recursion relation atk=0ak+2=k2ak2k2ak+13kak+kak+1+2ak+2ak+1k2+2kRecursion relation forr=2ak+2=k2ak2k2ak+1+kak7kak+14ak+1k2+6k+8Solution forr=2[y(u)=k=0akuk+2,ak+2=k2ak2k2ak+1+kak7kak+14ak+1k2+6k+8,3a1+a0=0]Revert the change of variablesu=1+x[y(x)=k=0ak(1+x)k+2,ak+2=k2ak2k2ak+1+kak7kak+14ak+1k2+6k+8,3a1+a0=0]
Mathematica. Time used: 0.183 (sec). Leaf size: 132
ode=x^2*(1+x)*D[y[x],{x,2}]-(1+2*x)*(x*D[y[x],x]+y[x])==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)c2x1+2Hypergeometric2F1(12+2172,12+2+172,1+22,x)+c1x12Hypergeometric2F1(12(12217),12(122+17),122,x)
Sympy
from sympy import * 
x = symbols("x") 
y = Function("y") 
ode = Eq(x**2*(x + 1)*Derivative(y(x), (x, 2)) - (2*x + 1)*(x*Derivative(y(x), x) - y(x)),0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
False