2.1.271 Problem 274

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

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

Solve

4y+3(x2+2)y(x2+1)2=0

Solved as second order ode using Kovacic algorithm

Time used: 0.235 (sec)

Writing the ode as

(1)4y+(3x2+6)y(x21)2=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=4(3)B=0C=3x2+6(x21)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=3x264(x21)2

Comparing the above to (5) shows that

s=3x26t=4(x21)2

Therefore eq. (4) becomes

(7)z(x)=(3x264(x21)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.271: 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(x21)2. There is a pole at x=1 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 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=916(x1)316(x1)2316(x+1)2916(x+1)

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

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

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

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

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

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

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

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

r=3x264(x21)2

pole c location pole order [r]c αc+ αc
1 2 0 34 14
1 2 0 34 14

Order of r at [r] α+ α
2 0 32 12

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

d=α+(αc1++αc2+)=32(32)=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+αc2+xc2)+(+)[r]=34(x1)+34(x+1)+(0)=34(x1)+34(x+1)=3x2x22

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(34(x1)+34(x+1))(0)+((34(x1)234(x+1)2)+(34(x1)+34(x+1))2(3x264(x21)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(34(x1)+34(x+1))dx=(x21)3/4

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

y1=z1e12BAdx

Since B=0 then the above reduces to

y1=z1=(x21)3/4

Which simplifies to

y1=(x21)3/4

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

y2=y1eBAdxy12dx

Since B=0 then the above becomes

y2=y11y12dx=(x21)3/41(x21)3/2dx=(x21)3/4((x1)(x+1)x(x21)3/2)

Therefore the solution is

y=c1y1+c2y2=c1((x21)3/4)+c2((x21)3/4((x1)(x+1)x(x21)3/2))

Will add steps showing solving for IC soon.

Maple. Time used: 0.005 (sec). Leaf size: 24
ode:=4*diff(diff(y(x),x),x)+3*(-x^2+2)/(-x^2+1)^2*y(x) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=c1(x21)3/4+c2(x21)1/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 solve4ddxddxy(x)+3(x2+2)y(x)(x2+1)2=0Highest derivative means the order of the ODE is2ddxddxy(x)Isolate 2nd derivativeddxddxy(x)=3(x22)y(x)4(x21)2Group terms withy(x)on the lhs of the ODE and the rest on the rhs of the ODE; ODE is linearddxddxy(x)3(x22)y(x)4(x21)2=0Check to see ifx0is a regular singular pointDefine functions[P2(x)=0,P3(x)=3(x22)4(x21)2](x+1)P2(x)is analytic atx=1((x+1)P2(x))|x=1=0(x+1)2P3(x)is analytic atx=1((x+1)2P3(x))|x=1=316x=1is a regular singular pointCheck to see ifx0is a regular singular pointx0=1Multiply by denominators4(x21)2(ddxddxy(x))+(3x2+6)y(x)=0Change variables usingx=u1so that the regular singular point is atu=0(4u416u3+16u2)(ddudduy(u))+(3u2+6u+3)y(u)=0Assume series solution fory(u)y(u)=k=0akuk+rRewrite ODE with series expansionsConvertumy(u)to series expansion form=0..2umy(u)=k=0akuk+r+mShift index usingk>kmumy(u)=k=makmuk+rConvertum(ddudduy(u))to series expansion form=2..4um(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 expansionsa0(1+4r)(3+4r)ur+(a1(3+4r)(1+4r)2a0(8r28r3))u1+r+(k=2(ak(4k+4r1)(4k+4r3)2ak1(8(k1)2+16(k1)r+8r28k+58r)+ak2(2k+2r3)(2k7+2r))uk+r)=0a0cannot be 0 by assumption, giving the indicial equation(1+4r)(3+4r)=0Values of r that satisfy the indicial equationr{14,34}Each term must be 0a1(3+4r)(1+4r)2a0(8r28r3)=0Solve for the dependent coefficient(s)a1=2a0(8r28r3)16r2+16r+3Each term in the series must be 0, giving the recursion relation4(4ak+ak24ak1)k2+4(2(4ak+ak24ak1)r4ak5ak2+12ak1)k+4(4ak+ak24ak1)r2+4(4ak5ak2+12ak1)r+3ak+21ak226ak1=0Shift index usingk>k+24(4ak+2+ak4ak+1)(k+2)2+4(2(4ak+2+ak4ak+1)r4ak+25ak+12ak+1)(k+2)+4(4ak+2+ak4ak+1)r2+4(4ak+25ak+12ak+1)r+3ak+2+21ak26ak+1=0Recursion relation that defines series solution to ODEak+2=4k2ak16k2ak+1+8krak32krak+1+4r2ak16r2ak+14kak16kak+14rak16rak+13ak+6ak+116k2+32kr+16r2+48k+48r+35Recursion relation forr=14ak+2=4k2ak16k2ak+12kak24kak+1154ak+ak+116k2+56k+48Solution forr=14[y(u)=k=0akuk+14,ak+2=4k2ak16k2ak+12kak24kak+1154ak+ak+116k2+56k+48,a1=9a08]Revert the change of variablesu=x+1[y(x)=k=0ak(x+1)k+14,ak+2=4k2ak16k2ak+12kak24kak+1154ak+ak+116k2+56k+48,a1=9a08]Recursion relation forr=34ak+2=4k2ak16k2ak+1+2kak40kak+1154ak15ak+116k2+72k+80Solution forr=34[y(u)=k=0akuk+34,ak+2=4k2ak16k2ak+1+2kak40kak+1154ak15ak+116k2+72k+80,a1=3a08]Revert the change of variablesu=x+1[y(x)=k=0ak(x+1)k+34,ak+2=4k2ak16k2ak+1+2kak40kak+1154ak15ak+116k2+72k+80,a1=3a08]Combine solutions and rename parameters[y(x)=(k=0ak(x+1)k+14)+(k=0bk(x+1)k+34),ak+2=4k2ak16k2ak+12kak24kak+1154ak+ak+116k2+56k+48,a1=9a08,bk+2=4k2bk16k2bk+1+2kbk40kbk+1154bk15bk+116k2+72k+80,b1=3b08]
Mathematica. Time used: 0.041 (sec). Leaf size: 51
ode=4*D[y[x],{x,2}]+3*(2-x^2)/(1-x^2)^2*y[x]==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)x21(c2Q1212(x)+2πc1x1x24)
Sympy. Time used: 0.315 (sec). Leaf size: 48
from sympy import * 
x = symbols("x") 
y = Function("y") 
ode = Eq(4*Derivative(y(x), (x, 2)) + (6 - 3*x**2)*y(x)/(1 - x**2)**2,0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
y(x)=x214(C1x22F1(0,132|x2)+C21F0(12|x2))x24x