2.1.569 Problem 585

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

Internal problem ID [9739]
Book : Collection of Kovacic problems
Section : section 1
Problem number : 585
Date solved : Friday, April 25, 2025 at 06:18:32 PM
CAS classification : [[_2nd_order, _with_linear_symmetries]]

Solve

x2(12x)y+3xy+(1+4x)y=0

Solved as second order ode using Kovacic algorithm

Time used: 0.277 (sec)

Writing the ode as

(1)(2x3+x2)y+3xy+(1+4x)y=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=2x3+x2(3)B=3xC=1+4x

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=32x2+16x14(2x2x)2

Comparing the above to (5) shows that

s=32x2+16x1t=4(2x2x)2

Therefore eq. (4) becomes

(7)z(x)=(32x2+16x14(2x2x)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.569: 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(2x2x)2. There is a pole at x=0 of order 2. There is a pole at x=12 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=154(x12)23x12+3x14x2

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

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

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=32x2+16x14(2x2x)2

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

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

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

r=32x2+16x14(2x2x)2

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

Order of r at [r] α+ α
2 0 2 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 α=1 then

d=α(αc1++αc2)=1(1)=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]

The above gives

ω=((+)[r]c1+αc1+xc1)+(()[r]c2+αc2xc2)+()[r]=12x32(x12)+()(0)=12x32(x12)=14x4x22x

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(12x32(x12))(0)+((12x2+32(x12)2)+(12x32(x12))2(32x2+16x14(2x2x)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(12x32(x12))dx=x(1+2x)3/2

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

y1=z1e12BAdx=z1e123x2x3+x2dx=z1e3ln(1+2x)23ln(x)2=z1((1+2x)3/2x3/2)

Which simplifies to

y1=1x

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

y2=y1eBAdxy12dx

Substituting gives

y2=y1e3x2x3+x2dx(y1)2dx=y1e3ln(1+2x)3ln(x)(y1)2dx=y1(8x33+12+6x6x2ln(x))

Therefore the solution is

y=c1y1+c2y2=c1(1x)+c2(1x(8x33+12+6x6x2ln(x)))

Will add steps showing solving for IC soon.

Maple. Time used: 0.004 (sec). Leaf size: 31
ode:=x^2*(1-2*x)*diff(diff(y(x),x),x)+3*x*diff(y(x),x)+(4*x+1)*y(x) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=3ln(x)c2+(8x3+18x218x)c2+c1x

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(12x)(ddxddxy(x))+3x(ddxy(x))+(1+4x)y(x)=0Highest derivative means the order of the ODE is2ddxddxy(x)Isolate 2nd derivativeddxddxy(x)=(1+4x)y(x)x2(1+2x)+3(ddxy(x))x(1+2x)Group terms withy(x)on the lhs of the ODE and the rest on the rhs of the ODE; ODE is linearddxddxy(x)3(ddxy(x))x(1+2x)(1+4x)y(x)x2(1+2x)=0Check to see ifx0is a regular singular pointDefine functions[P2(x)=3x(1+2x),P3(x)=1+4xx2(1+2x)]xP2(x)is analytic atx=0(xP2(x))|x=0=3x2P3(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(1+2x)(ddxddxy(x))3x(ddxy(x))+(14x)y(x)=0Assume series solution fory(x)y(x)=k=0akxk+rRewrite ODE with series expansionsConvertxmy(x)to series expansion form=0..1xmy(x)=k=0akxk+r+mShift index usingk>kmxmy(x)=k=makmxk+rConvertx(ddxy(x))to series expansionx(ddxy(x))=k=0ak(k+r)xk+rConvertxm(ddxddxy(x))to series expansion form=2..3xm(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 expansionsa0(1+r)2xr+(k=1(ak(k+r+1)2+2ak1(k+r)(k3+r))xk+r)=0a0cannot be 0 by assumption, giving the indicial equation(1+r)2=0Values of r that satisfy the indicial equationr=1Each term in the series must be 0, giving the recursion relationak(k+r+1)2+2ak1(k+r)(k3+r)=0Shift index usingk>k+1ak+1(k+2+r)2+2ak(k+r+1)(k+r2)=0Recursion relation that defines series solution to ODEak+1=2ak(k+r+1)(k+r2)(k+2+r)2Recursion relation forr=1; series terminates atk=3ak+1=2akk(k3)(k+1)2Apply recursion relation fork=0a1=0Apply recursion relation fork=1a2=a1Express in terms ofa0a2=0Apply recursion relation fork=2a3=4a29Express in terms ofa0a3=0Terminating series solution of the ODE forr=1. Use reduction of order to find the second linearly independent solutiony(x)=a00
Mathematica. Time used: 0.221 (sec). Leaf size: 105
ode=x^2*(1-2*x)*D[y[x],{x,2}]+3*x*D[y[x],x]+(1+4*x)*y[x]==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)exp(1x4K[1]+12K[1]4K[1]2dK[1]121x3K[2]2K[2]2dK[2])(c21xexp(21K[3]4K[1]+12K[1]4K[1]2dK[1])dK[3]+c1)
Sympy
from sympy import * 
x = symbols("x") 
y = Function("y") 
ode = Eq(x**2*(1 - 2*x)*Derivative(y(x), (x, 2)) + 3*x*Derivative(y(x), x) + (4*x + 1)*y(x),0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
False