2.1.573 Problem 589

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

Internal problem ID [9745]
Book : Collection of Kovacic problems
Section : section 1
Problem number : 589
Date solved : Sunday, March 30, 2025 at 02:45:41 PM
CAS classification : [[_2nd_order, _with_linear_symmetries]]

Solved as second order ode using Kovacic algorithm

Time used: 1.036 (sec)

Writing the ode as

(1)9x2y+(3x3+3x)y+(7x2+1)y=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=9x2(3)B=3x3+3xC=7x2+1

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=x436x2936x2

Comparing the above to (5) shows that

s=x436x29t=36x2

Therefore eq. (4) becomes

(7)z(x)=(x436x2936x2)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.573: 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)=24=2

The poles of r in eq. (7) and the order of each pole are determined by solving for the roots of t=36x2. There is a pole at x=0 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. Therefore

L=[1,2]

Attempting to find a solution using case n=1.

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

r=x236114x2

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

Since the order of r at is Or()=2 then

v=Or()2=22=1

[r] is the sum of terms involving xi for 0iv in the Laurent series for r at . Therefore

[r]=i=0vaixi(8)=i=01aixi

Let a be the coefficient of xv=x1 in the above sum. The Laurent series of r at is

(9)rx63x1114x39992x518081916x722927058x924923951132x11354854090716x13+

Comparing Eq. (9) with Eq. (8) shows that

a=16

From Eq. (9) the sum up to v=1 gives

[r]=i=01aixi(10)=x6

Now we need to find b, where b be the coefficient of xv1=x0=1 in r minus the coefficient of same term but in ([r])2 where [r] was found above in Eq (10). Hence

([r])2=x236

This shows that the coefficient of 1 in the above is 0. Now we need to find the coefficient of 1 in r. How this is done depends on if v=0 or not. Since v=1 which is not zero, then starting r=st, we do long division and write this in the form

r=Q+Rt

Where Q is the quotient and R is the remainder. Then the coefficient of 1 in r will be the coefficient this term in the quotient. Doing long division gives

r=st=x436x2936x2=Q+R36x2=(x2361)+(14x2)=x236114x2

We see that the coefficient of the term x in the quotient is 1. Now b can be found.

b=(1)(0)=1

Hence

[r]=x6α+=12(bav)=12(1161)=72α=12(bav)=12(1161)=52

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

r=x436x2936x2

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

Order of r at [r] α+ α
2 x6 72 52

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

d=α(αc1+)=52(12)=2

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]=12x+()(x6)=12xx6=12xx6

Now that ω is determined, the next step is find a corresponding minimal polynomial p(x) of degree d=2 to solve the ode. The polynomial p(x) needs to satisfy the equation

(1A)p+2ωp+(ω+ω2r)p=0

Let

(2A)p(x)=x2+a1x+a0

Substituting the above in eq. (1A) gives

(2)+2(12xx6)(2x+a1)+((12x216)+(12xx6)2(x436x2936x2))=0x2a1+2(6+a0)x+3a13x=0

Solving for the coefficients ai in the above using method of undetermined coefficients gives

{a0=6,a1=0}

Substituting these coefficients in p(x) in eq. (2A) results in

p(x)=x26

Therefore the first solution to the ode z=rz is

z1(x)=peωdx=(x26)e(12xx6)dx=(x26)ex212+ln(x)2=(x26)xex212

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

y1=z1e12BAdx=z1e123x3+3x9x2dx=z1ex212ln(x)6=z1(ex212x1/6)

Which simplifies to

y1=x1/3(x26)

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

y2=y1eBAdxy12dx

Substituting gives

y2=y1e3x3+3x9x2dx(y1)2dx=y1ex26ln(x)3(y1)2dx=y1(ex26ln(x)3x2/3(x26)2dx)

Therefore the solution is

y=c1y1+c2y2=c1(x1/3(x26))+c2(x1/3(x26)(ex26ln(x)3x2/3(x26)2dx))

Will add steps showing solving for IC soon.

Maple. Time used: 0.028 (sec). Leaf size: 19
ode:=9*x^2*diff(diff(y(x),x),x)+3*x*(-x^2+1)*diff(y(x),x)+(7*x^2+1)*y(x) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=x1/3(x26)(c1c2)6

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 
   Solution has integrals. Trying a special function solution free of integrals\ 
... 
   -> Trying a solution in terms of special functions: 
      -> Bessel 
      -> elliptic 
      -> Legendre 
      <- Kummer successful 
   <- special function solution successful 
      Solution using Kummer functions still has integrals. Trying a hypergeomet\ 
ric solution. 
      -> hyper3: Equivalence to 2F1, 1F1 or 0F1 under a power @ Moebius 
      <- hyper3 successful: received ODE is equivalent to the 1F1 ODE 
      -> Trying to convert hypergeometric functions to elementary form... 
      <- elementary form could result into a too large expression - returning s\ 
pecial function form of solution, free of uncomputed integrals 
   <- Kovacics algorithm successful
 

Maple step by step

Let’s solve9x2(ddxddxy(x))+3x(x2+1)(ddxy(x))+(7x2+1)y(x)=0Highest derivative means the order of the ODE is2ddxddxy(x)Isolate 2nd derivativeddxddxy(x)=(7x2+1)y(x)9x2+(x21)(ddxy(x))3xGroup terms withy(x)on the lhs of the ODE and the rest on the rhs of the ODE; ODE is linearddxddxy(x)(x21)(ddxy(x))3x+(7x2+1)y(x)9x2=0Check to see ifx0=0is a regular singular pointDefine functions[P2(x)=x213x,P3(x)=7x2+19x2]xP2(x)is analytic atx=0(xP2(x))|x=0=13x2P3(x)is analytic atx=0(x2P3(x))|x=0=19x=0is a regular singular pointCheck to see ifx0=0is a regular singular pointx0=0Multiply by denominators9x2(ddxddxy(x))3x(x21)(ddxy(x))+(7x2+1)y(x)=0Assume series solution fory(x)y(x)=k=0akxk+rRewrite ODE with series expansionsConvertxmy(x)to series expansion form=0..2xmy(x)=k=0akxk+r+mShift index usingk>kmxmy(x)=k=makmxk+rConvertxm(ddxy(x))to series expansion form=1..3xm(ddxy(x))=k=0ak(k+r)xk+r1+mShift index usingk>k+1mxm(ddxy(x))=k=1+mak+1m(k+1m+r)xk+rConvertx2(ddxddxy(x))to series expansionx2(ddxddxy(x))=k=0ak(k+r)(k+r1)xk+rRewrite ODE with series expansionsa0(1+3r)2xr+a1(2+3r)2x1+r+(k=2(ak(3k+3r1)2ak2(3k13+3r))xk+r)=0a0cannot be 0 by assumption, giving the indicial equation(1+3r)2=0Values of r that satisfy the indicial equationr=13Each term must be 0a1(2+3r)2=0Solve for the dependent coefficient(s)a1=0Each term in the series must be 0, giving the recursion relationak(3k+3r1)2+(3k+133r)ak2=0Shift index usingk>k+2ak+2(3k+5+3r)2+ak(3k3r+7)=0Recursion relation that defines series solution to ODEak+2=ak(3k+3r7)(3k+5+3r)2Recursion relation forr=13; series terminates atk=2ak+2=ak(3k6)(3k+6)2Solution forr=13[y(x)=k=0akxk+13,ak+2=ak(3k6)(3k+6)2,a1=0]
Mathematica. Time used: 0.364 (sec). Leaf size: 59
ode=9*x^2*D[y[x],{x,2}]+3*x*(1-x^2)*D[y[x],x]+(1+7*x^2)*y[x]==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)e3x3(x26)(c21xeK[1]261K[1](K[1]26)2dK[1]+c1)
Sympy
from sympy import * 
x = symbols("x") 
y = Function("y") 
ode = Eq(9*x**2*Derivative(y(x), (x, 2)) + 3*x*(1 - x**2)*Derivative(y(x), x) + (7*x**2 + 1)*y(x),0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
False