2.1.123 Problem 125

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

Internal problem ID [9293]
Book : Collection of Kovacic problems
Section : section 1
Problem number : 125
Date solved : Friday, April 25, 2025 at 06:04:38 PM
CAS classification : [[_2nd_order, _with_linear_symmetries]]

Solve

x2(x2+2)y2x(2x2+1)y+(2x2+2)y=0

Solved as second order ode using Kovacic algorithm

Time used: 0.475 (sec)

Writing the ode as

(1)(x4+2x2)y+(4x32x)y+(2x2+2)y=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=x4+2x2(3)B=4x32xC=2x2+2

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=3x21(x32x)2

Comparing the above to (5) shows that

s=3x21t=(x32x)2

Therefore eq. (4) becomes

(7)z(x)=(3x21(x32x)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.123: 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)=62=4

The poles of r in eq. (7) and the order of each pole are determined by solving for the roots of t=(x32x)2. There is a pole at x=0 of order 2. There is a pole at x=2 of order 2. There is a pole at x=2 of order 2. Since there is no odd order pole larger than 2 and the order at is 4 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 4 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=14x2+516(x2)2+516(x+2)23232(x2)+3232(x+2)

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=2 let b be the coefficient of 1(x2)2 in the partial fractions decomposition of r given above. Therefore b=516. Hence

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

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

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

Since the order of r at is 4>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=3x21(x32x)2

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

Order of r at [r] α+ α
4 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+αc3)=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+αc1+xc1)+(()[r]c2+αc2xc2)+(()[r]c3+αc3xc3)+(+)[r]=12x14(x2)14(x+2)+(0)=12x14(x2)14(x+2)=1x32x

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(12x14(x2)14(x+2))(0)+((12x2+14(x2)2+14(x+2)2)+(12x14(x2)14(x+2))2(3x21(x32x)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(12x14(x2)14(x+2))dx=x(x2)1/4(x+2)1/4

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

y1=z1e12BAdx=z1e124x32xx4+2x2dx=z1eln(x)25ln(x22)4=z1(x(x22)5/4)

Which simplifies to

y1=x(x22)3/2

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

y2=y1eBAdxy12dx

Substituting gives

y2=y1e4x32xx4+2x2dx(y1)2dx=y1eln(x)5ln(x22)2(y1)2dx=y1(x22+2arctan(2x22))

Therefore the solution is

y=c1y1+c2y2=c1(x(x22)3/2)+c2(x(x22)3/2(x22+2arctan(2x22)))

Will add steps showing solving for IC soon.

Maple. Time used: 0.028 (sec). Leaf size: 42
ode:=x^2*(-x^2+2)*diff(diff(y(x),x),x)-2*x*(2*x^2+1)*diff(y(x),x)+(-2*x^2+2)*y(x) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=x(2c2x22+2arctan(2x22)c2+c1)(x22)3/2

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(x2+2)(ddxddxy(x))2x(2x2+1)(ddxy(x))+(2x2+2)y(x)=0Highest derivative means the order of the ODE is2ddxddxy(x)Isolate 2nd derivativeddxddxy(x)=2(x21)y(x)x2(x22)2(2x2+1)(ddxy(x))x(x22)Group terms withy(x)on the lhs of the ODE and the rest on the rhs of the ODE; ODE is linearddxddxy(x)+2(2x2+1)(ddxy(x))x(x22)+2(x21)y(x)x2(x22)=0Check to see ifx0is a regular singular pointDefine functions[P2(x)=2(2x2+1)x(x22),P3(x)=2(x21)x2(x22)]xP2(x)is analytic atx=0(xP2(x))|x=0=1x2P3(x)is analytic atx=0(x2P3(x))|x=0=1x=0is a regular singular pointCheck to see ifx0is a regular singular pointx0=0Multiply by denominatorsx2(x22)(ddxddxy(x))+2x(2x2+1)(ddxy(x))+(2x22)y(x)=0Assume series solution fory(x)y(x)=k=0akxk+rRewrite ODE with series expansionsConvertxmy(x)to series expansion form=0..2xmy(x)=k=0akxk+r+mShift index usingk>kmxmy(x)=k=makmxk+rConvertxm(ddxy(x))to series expansion form=1..3xm(ddxy(x))=k=0ak(k+r)xk+r1+mShift index usingk>k+1mxm(ddxy(x))=k=1+mak+1m(k+1m+r)xk+rConvertxm(ddxddxy(x))to series expansion form=2..4xm(ddxddxy(x))=k=0ak(k+r)(k+r1)xk+r2+mShift index usingk>k+2mxm(ddxddxy(x))=k=2+mak+2m(k+2m+r)(k+1m+r)xk+rRewrite ODE with series expansions2a0(1+r)2xr2a1r2x1+r+(k=2(2ak(k+r1)2+ak2(k+r)(k+r1))xk+r)=0a0cannot be 0 by assumption, giving the indicial equation2(1+r)2=0Values of r that satisfy the indicial equationr=1Each term must be 02a1r2=0Solve for the dependent coefficient(s)a1=0Each term in the series must be 0, giving the recursion relation2ak(k+r1)2+ak2(k+r)(k+r1)=0Shift index usingk>k+22ak+2(k+r+1)2+ak(k+r+2)(k+r+1)=0Recursion relation that defines series solution to ODEak+2=ak(k+r+2)2(k+r+1)Recursion relation forr=1ak+2=ak(k+3)2(k+2)Solution forr=1[y(x)=k=0akxk+1,ak+2=ak(k+3)2(k+2),a1=0]
Mathematica. Time used: 0.252 (sec). Leaf size: 97
ode=x^2*(2-x^2)*D[y[x],{x,2}]-2*x*(1+2*x^2)*D[y[x],x]+(2-2*x^2)*y[x]==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)exp(1x12K[1]K[1]3dK[1]121x(5K[2]K[2]221K[2])dK[2])(c21xexp(21K[3]12K[1]K[1]3dK[1])dK[3]+c1)
Sympy
from sympy import * 
x = symbols("x") 
y = Function("y") 
ode = Eq(x**2*(2 - x**2)*Derivative(y(x), (x, 2)) - 2*x*(2*x**2 + 1)*Derivative(y(x), x) + (2 - 2*x**2)*y(x),0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
False