2.1.595 Problem 611

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

Internal problem ID [9767]
Book : Collection of Kovacic problems
Section : section 1
Problem number : 611
Date solved : Sunday, March 30, 2025 at 02:46:11 PM
CAS classification : [[_2nd_order, _with_linear_symmetries]]

Solved as second order ode using Kovacic algorithm

Time used: 0.240 (sec)

Writing the ode as

(1)(8x3+4x2)y+(2x28x)y+(5x7)y=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=8x3+4x2(3)B=2x28xC=5x7

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=33x2+132x+6016(2x2+x)2

Comparing the above to (5) shows that

s=33x2+132x+60t=16(2x2+x)2

Therefore eq. (4) becomes

(7)z(x)=(33x2+132x+6016(2x2+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.595: 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(2x2+x)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=964(x+12)2+274(x+12)274x+154x2

For the pole at x=0 let b be the coefficient of 1x2 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

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

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

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=33x2+132x+6016(2x2+x)2

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

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

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

r=33x2+132x+6016(2x2+x)2

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

Order of r at [r] α+ α
2 0 118 38

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 α=38 then

d=α(αc1+αc2+)=38(38)=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+αc1xc1)+((+)[r]c2+αc2+xc2)+()[r]=32x+98(x+12)+()(0)=32x+98(x+12)=3(x+2)4x(1+2x)

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(32x+98(x+12))(0)+((32x298(x+12)2)+(32x+98(x+12))2(33x2+132x+6016(2x2+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(32x+98(x+12))dx=(1+2x)9/8x3/2

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

y1=z1e12BAdx=z1e122x28x8x3+4x2dx=z1e9ln(1+2x)8+ln(x)=z1(x(1+2x)9/8)

Which simplifies to

y1=1x

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

y2=y1eBAdxy12dx

Substituting gives

y2=y1e2x28x8x3+4x2dx(y1)2dx=y1e9ln(1+2x)4+2ln(x)(y1)2dx=y1(2(1+2x)(5x310x240x16)e9ln(1+2x)4+2ln(x)35x2)

Therefore the solution is

y=c1y1+c2y2=c1(1x)+c2(1x(2(1+2x)(5x310x240x16)e9ln(1+2x)4+2ln(x)35x2))

Will add steps showing solving for IC soon.

Maple. Time used: 0.015 (sec). Leaf size: 34
ode:=4*x^2*(2*x+1)*diff(diff(y(x),x),x)-2*x*(4-x)*diff(y(x),x)-(7+5*x)*y(x) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=c1+c2(5x310x240x16)(1+2x)5/4x

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) 
   Reducible group (found another exponential solution) 
<- Kovacics algorithm successful
 

Maple step by step

Let’s solve4x2(1+2x)(ddxddxy(x))2x(4x)(ddxy(x))(7+5x)y(x)=0Highest derivative means the order of the ODE is2ddxddxy(x)Isolate 2nd derivativeddxddxy(x)=(7+5x)y(x)4x2(1+2x)(4+x)(ddxy(x))2x(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)+(4+x)(ddxy(x))2x(1+2x)(7+5x)y(x)4x2(1+2x)=0Check to see ifx0is a regular singular pointDefine functions[P2(x)=4+x2x(1+2x),P3(x)=7+5x4x2(1+2x)]xP2(x)is analytic atx=0(xP2(x))|x=0=2x2P3(x)is analytic atx=0(x2P3(x))|x=0=74x=0is a regular singular pointCheck to see ifx0is a regular singular pointx0=0Multiply by denominators4x2(1+2x)(ddxddxy(x))+2x(4+x)(ddxy(x))+(5x7)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+rConvertxm(ddxy(x))to series expansion form=1..2xm(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..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+2r)(7+2r)xr+(k=1(ak(2k+2r+1)(2k+2r7)+ak1(2k1+2r)(4k9+4r))xk+r)=0a0cannot be 0 by assumption, giving the indicial equation(1+2r)(7+2r)=0Values of r that satisfy the indicial equationr{12,72}Each term in the series must be 0, giving the recursion relation8(k94+r)(k12+r)ak1+4(k+r72)(k+r+12)ak=0Shift index usingk>k+18(k54+r)(k+r+12)ak+4(k52+r)(k+32+r)ak+1=0Recursion relation that defines series solution to ODEak+1=(4k+4r5)(2k+2r+1)ak(2k5+2r)(2k+3+2r)Recursion relation forr=12ak+1=2(4k7)kak(2k6)(2k+2)Series not valid forr=12, division by0in the recursion relation atk=3ak+1=2(4k7)kak(2k6)(2k+2)Recursion relation forr=72ak+1=(4k+9)(2k+8)ak(2k+2)(2k+10)Solution forr=72[y(x)=k=0akxk+72,ak+1=(4k+9)(2k+8)ak(2k+2)(2k+10)]
Mathematica. Time used: 0.262 (sec). Leaf size: 111
ode=4*x^2*(1+2*x)*D[y[x],{x,2}]-2*x*(4-x)*D[y[x],x]-(7+5*x)*y[x]==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)exp(1x3K[1]+68K[1]2+4K[1]dK[1]121x(94K[2]+22K[2])dK[2])(c21xexp(21K[3]3K[1]+68K[1]2+4K[1]dK[1])dK[3]+c1)
Sympy
from sympy import * 
x = symbols("x") 
y = Function("y") 
ode = Eq(4*x**2*(2*x + 1)*Derivative(y(x), (x, 2)) - 2*x*(4 - x)*Derivative(y(x), x) - (5*x + 7)*y(x),0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
False