2.1.262 Problem 265

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

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

Solve

x2(14x)yxy23xy4=0

Solved as second order ode using Kovacic algorithm

Time used: 0.407 (sec)

Writing the ode as

(1)(4x3+x2)yxy23xy4=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=4x3+x2(3)B=x2C=3x4

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=48x220x+516(4x2x)2

Comparing the above to (5) shows that

s=48x220x+5t=16(4x2x)2

Therefore eq. (4) becomes

(7)z(x)=(48x220x+516(4x2x)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.262: 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=16(4x2x)2. There is a pole at x=0 of order 2. There is a pole at x=14 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.

Unable to find solution using case one

Attempting to find a solution using case n=2.

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

r=316(x14)254(x14)+54x+516x2

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

Ec={2,2+21+4b,221+4b}={1,2,5}

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

Ec={2,2+21+4b,221+4b}={1,2,3}

Since the order of r at is 2 then 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=48x220x+516(4x2x)2

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

E={2,2+21+4b,221+4b}={1,2,3}

The following table summarizes the findings so far for poles and for the order of r at for case 2 of Kovacic algorithm.

pole c location pole order Ec
0 2 {1,2,5}
14 2 {1,2,3}

Order of r at E
2 {1,2,3}

Using the family {e1,e2,,e} given by

e1=2,e2=1,e=3

Gives a non negative integer d (the degree of the polynomial p(x)), which is generated using

d=12(ecΓec)=12(3(2+(1)))=0

We now form the following rational function

θ=12cΓecxc=12(2(x(0))+1(x(14)))=1x+12x12

Now we search for a monic polynomial p(x) of degree d=0 such that

(1A)p+3θp+(3θ2+3θ4r)p+(θ+3θθ+θ34rθ2r)p=0

Since d=0, then letting

(2A)p=1

Substituting p and θ into Eq. (1A) gives

0=0

And solving for p gives

p=1

Now that p(x) is found let

ϕ=θ+pp=1x+12x12

Let ω be the solution of

ω2ϕω+(12ϕ+12ϕ2r)=0

Substituting the values for ϕ and r into the above equation gives

w2(1x+12x12)w+144x212x516x2(1+4x)2=0

Solving for ω gives

ω=12x2+314x4x(1+4x)

Therefore the first solution to the ode z=rz is

z1(x)=eωdx=e12x2+314x4x(1+4x)dx=(1+4x)1/4x2(14x+1x)3/24

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

y1=z1e12BAdx=z1e12x24x3+x2dx=z1eln(1+4x)4+ln(x)4=z1(x1/4(1+4x)1/4)

Which simplifies to

y1=x1/42(14x+1)14x+1x4

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

y2=y1eBAdxy12dx

Substituting gives

y2=y1ex24x3+x2dx(y1)2dx=y1eln(1+4x)2+ln(x)2(y1)2dx=y1(2eln(1+4x)2+ln(14x)2((14x+1)2+214x+2)3/23(14x+1)3)

Therefore the solution is

y=c1y1+c2y2=c1(x1/42(14x+1)14x+1x4)+c2(x1/42(14x+1)14x+1x4(2eln(1+4x)2+ln(14x)2((14x+1)2+214x+2)3/23(14x+1)3))

Will add steps showing solving for IC soon.

Maple. Time used: 0.016 (sec). Leaf size: 46
ode:=x^2*(1-4*x)*diff(diff(y(x),x),x)-1/2*x*diff(y(x),x)-3/4*x*y(x) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=2(c1(x1)14x2c2x3/2+c1(3x1))(1+14x)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 
   Group is reducible or imprimitive 
<- Kovacics algorithm successful
 

Maple step by step

Let’s solvex2(14x)(ddxddxy(x))x(ddxy(x))23xy(x)4=0Highest derivative means the order of the ODE is2ddxddxy(x)Isolate 2nd derivativeddxddxy(x)=3y(x)4x(1+4x)ddxy(x)2x(1+4x)Group terms withy(x)on the lhs of the ODE and the rest on the rhs of the ODE; ODE is linearddxddxy(x)+ddxy(x)2x(1+4x)+3y(x)4x(1+4x)=0Check to see ifx0is a regular singular pointDefine functions[P2(x)=12x(1+4x),P3(x)=34x(1+4x)]xP2(x)is analytic atx=0(xP2(x))|x=0=12x2P3(x)is analytic atx=0(x2P3(x))|x=0=0x=0is a regular singular pointCheck to see ifx0is a regular singular pointx0=0Multiply by denominators4x(1+4x)(ddxddxy(x))+2ddxy(x)+3y(x)=0Assume series solution fory(x)y(x)=k=0akxk+rRewrite ODE with series expansionsConvertddxy(x)to series expansionddxy(x)=k=0ak(k+r)xk+r1Shift index usingk>k+1ddxy(x)=k=1ak+1(k+1+r)xk+rConvertxm(ddxddxy(x))to series expansion form=1..2xm(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 expansions2a0r(3+2r)x1+r+(k=0(2ak+1(k+1+r)(2k1+2r)+ak(4k+4r1)(4k+4r3))xk+r)=0a0cannot be 0 by assumption, giving the indicial equation2r(3+2r)=0Values of r that satisfy the indicial equationr{0,32}Each term in the series must be 0, giving the recursion relation4(k+1+r)(k12+r)ak+1+16(k+r34)(k+r14)ak=0Recursion relation that defines series solution to ODEak+1=(4k+4r3)(4k+4r1)ak2(k+1+r)(2k1+2r)Recursion relation forr=0ak+1=(4k3)(4k1)ak2(k+1)(2k1)Solution forr=0[y(x)=k=0akxk,ak+1=(4k3)(4k1)ak2(k+1)(2k1)]Recursion relation forr=32ak+1=(4k+3)(4k+5)ak2(k+52)(2k+2)Solution forr=32[y(x)=k=0akxk+32,ak+1=(4k+3)(4k+5)ak2(k+52)(2k+2)]Combine solutions and rename parameters[y(x)=(k=0akxk)+(k=0bkxk+32),ak+1=(4k3)(4k1)ak2(k+1)(2k1),bk+1=(4k+3)(4k+5)bk2(k+52)(2k+2)]
Mathematica. Time used: 4.075 (sec). Leaf size: 125
ode=x^2*(1-4*x)*D[y[x],{x,2}]+((1-(3/2))*x-(6-4*(3/2))*x^2)*D[y[x],x]+(3/2)*(1-(3/2))*x*y[x]==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)4x14(6c1(4x1i)3/2+ic2(4x1+i)3/2)exp(121x12K[1]8K[1]2dK[1])64x1i44x1+i4
Sympy. Time used: 0.433 (sec). Leaf size: 60
from sympy import * 
x = symbols("x") 
y = Function("y") 
ode = Eq(x**2*(1 - 4*x)*Derivative(y(x), (x, 2)) - 3*x*y(x)/4 - x*Derivative(y(x), x)/2,0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
y(x)=(4x1)34(C1(x4x1)322F1(34,5452|4x4x1)+C22F1(34,1412|4x4x1))