2.1.2 Problem 2

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

Internal problem ID [9174]
Book : Collection of Kovacic problems
Section : section 1
Problem number : 2
Date solved : Sunday, March 30, 2025 at 02:24:50 PM
CAS classification : [_Gegenbauer]

Solved as second order ode using Kovacic algorithm

Time used: 0.242 (sec)

Writing the ode as

(1)(x21)y6xy+12y=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=x21(3)B=6xC=12

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

Comparing the above to (5) shows that

s=15t=(x21)2

Therefore eq. (4) becomes

(7)z(x)=(15(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.2: 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)=40=4

The poles of r in eq. (7) and the order of each pole are determined by solving for the roots of t=(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 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=154(x1)+154(x+1)+154(x+1)2+154(x1)2

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=154. Hence

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

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=154. Hence

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

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

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

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 α=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+αc1xc1)+((+)[r]c2+αc2+xc2)+()[r]=32(x1)+52(x+1)+()(0)=32(x1)+52(x+1)=x4x21

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(32(x1)+52(x+1))(0)+((32(x1)252(x+1)2)+(32(x1)+52(x+1))2(15(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(32(x1)+52(x+1))dx=(x+1)5/2(x1)3/2

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

y1=z1e12BAdx=z1e126xx21dx=z1e3ln(x1)2+3ln(x+1)2=z1((x1)3/2(x+1)3/2)

Which simplifies to

y1=(x+1)4

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

y2=y1eBAdxy12dx

Substituting gives

y2=y1e6xx21dx(y1)2dx=y1e3ln(x1)+3ln(x+1)(y1)2dx=y1(x(x2+1)e3ln(x1)+3ln(x+1)(x+1)7(x1)3)

Therefore the solution is

y=c1y1+c2y2=c1((x+1)4)+c2((x+1)4(x(x2+1)e3ln(x1)+3ln(x+1)(x+1)7(x1)3))

Will add steps showing solving for IC soon.

Maple. Time used: 0.003 (sec). Leaf size: 25
ode:=(x^2-1)*diff(diff(y(x),x),x)-6*diff(y(x),x)*x+12*y(x) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=c2x4+c1x3+6c2x2+c1x+c2

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) 
<- Kovacics algorithm successful
 

Maple step by step

Let’s solve(x21)(ddxddxy(x))6x(ddxy(x))+12y(x)=0Highest derivative means the order of the ODE is2ddxddxy(x)Isolate 2nd derivativeddxddxy(x)=12y(x)x21+6x(ddxy(x))x21Group terms withy(x)on the lhs of the ODE and the rest on the rhs of the ODE; ODE is linearddxddxy(x)6x(ddxy(x))x21+12y(x)x21=0Check to see ifx0is a regular singular pointDefine functions[P2(x)=6xx21,P3(x)=12x21](x+1)P2(x)is analytic atx=1((x+1)P2(x))|x=1=3(x+1)2P3(x)is analytic atx=1((x+1)2P3(x))|x=1=0x=1is a regular singular pointCheck to see ifx0is a regular singular pointx0=1Multiply by denominators(x21)(ddxddxy(x))6x(ddxy(x))+12y(x)=0Change variables usingx=u1so that the regular singular point is atu=0(u22u)(ddudduy(u))+(6u+6)(dduy(u))+12y(u)=0Assume series solution fory(u)y(u)=k=0akuk+rRewrite ODE with series expansionsConvertum(dduy(u))to series expansion form=0..1um(dduy(u))=k=0ak(k+r)uk+r1+mShift index usingk>k+1mum(dduy(u))=k=1+mak+1m(k+1m+r)uk+rConvertum(ddudduy(u))to series expansion form=1..2um(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 expansions2a0r(4+r)u1+r+(k=0(2ak+1(k+1+r)(k+r3)+ak(k+r3)(k+r4))uk+r)=0a0cannot be 0 by assumption, giving the indicial equation2r(4+r)=0Values of r that satisfy the indicial equationr{0,4}Each term in the series must be 0, giving the recursion relation((2k2r2)ak+1+ak(k+r4))(k+r3)=0Recursion relation that defines series solution to ODEak+1=ak(k+r4)2(k+1+r)Recursion relation forr=0; series terminates atk=4ak+1=ak(k4)2(k+1)Apply recursion relation fork=0a1=2a0Apply recursion relation fork=1a2=3a14Express in terms ofa0a2=3a02Apply recursion relation fork=2a3=a23Express in terms ofa0a3=a02Apply recursion relation fork=3a4=a38Express in terms ofa0a4=a016Terminating series solution of the ODE forr=0. Use reduction of order to find the second linearly independent solutiony(u)=a0(12u+32u212u3+116u4)Revert the change of variablesu=x+1[y(x)=a0(x1)416]Recursion relation forr=4ak+1=akk2(k+5)Solution forr=4[y(u)=k=0akuk+4,ak+1=akk2(k+5)]Revert the change of variablesu=x+1[y(x)=k=0ak(x+1)k+4,ak+1=akk2(k+5)]Combine solutions and rename parameters[y(x)=a0(x1)416+(k=0bk(x+1)k+4),bk+1=bkk2(k+5)]
Mathematica. Time used: 0.399 (sec). Leaf size: 75
ode=(x^2-1)*D[y[x],{x,2}]-6*x*D[y[x],x]+12*y[x]==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)(x21)3/2exp(1xK[1]+4K[1]21dK[1])(c21xexp(21K[2]K[1]+4K[1]21dK[1])dK[2]+c1)
Sympy
from sympy import * 
x = symbols("x") 
y = Function("y") 
ode = Eq(-6*x*Derivative(y(x), x) + (x**2 - 1)*Derivative(y(x), (x, 2)) + 12*y(x),0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
False