2.1.563 Problem 579

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

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

Solved as second order ode using Kovacic algorithm

Time used: 0.372 (sec)

Writing the ode as

(1)(2x4+4x2)y+7x3y+(3x2+1)y=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=2x4+4x2(3)B=7x3C=3x2+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=3x41616(x3+2x)2

Comparing the above to (5) shows that

s=3x416t=16(x3+2x)2

Therefore eq. (4) becomes

(7)z(x)=(3x41616(x3+2x)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.563: 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)=64=2

The poles of r in eq. (7) and the order of each pole are determined by solving for the roots of t=16(x3+2x)2. There is a pole at x=0 of order 2. There is a pole at x=i2 of order 2. There is a pole at x=i2 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=14x2764(xi2)2764(x+i2)29i2128(xi2)+9i2128(x+i2)

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

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

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

[r]c=0αc+=12+1+4b=78α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=3x41616(x3+2x)2

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

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

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

r=3x41616(x3+2x)2

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

Order of r at [r] α+ α
2 0 34 14

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

d=α+(αc1++αc2+αc3)=34(34)=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+αc2xc2)+(()[r]c3+αc3xc3)+(+)[r]=12x+18x8i2+18x+8i2+(0)=12x+18x8i2+18x+8i2=12x+x4x2+8

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(12x+18x8i2+18x+8i2)(0)+((12x218(xi2)218(x+i2)2)+(12x+18x8i2+18x+8i2)2(3x41616(x3+2x)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(12x+18x8i2+18x+8i2)dx=x(x2+2)1/8

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

y1=z1e12BAdx=z1e127x32x4+4x2dx=z1e7ln(x2+2)8=z1(1(x2+2)7/8)

Which simplifies to

y1=x(x2+2)3/4

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

y2=y1eBAdxy12dx

Substituting gives

y2=y1e7x32x4+4x2dx(y1)2dx=y1e7ln(x2+2)4(y1)2dx=y1(1(x2+2)1/4xdx)

Therefore the solution is

y=c1y1+c2y2=c1(x(x2+2)3/4)+c2(x(x2+2)3/4(1(x2+2)1/4xdx))

Will add steps showing solving for IC soon.

Maple. Time used: 0.176 (sec). Leaf size: 81
ode:=2*x^2*(x^2+2)*diff(diff(y(x),x),x)+7*x^3*diff(y(x),x)+(3*x^2+1)*y(x) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=x(23/4c1+ln(2(2x2+4)1/4+2)c2ln(2(2x2+4)1/4+2)c2+2arctan(2(2x2+4)1/42)c2)21/42(x2+2)3/4

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 
      -> Whittaker 
         -> hyper3: Equivalence to 1F1 under a power @ Moebius 
      -> hypergeometric 
         -> heuristic approach 
         <- heuristic approach successful 
         -> solution has integrals; searching for one without integrals... 
            -> hyper3: Equivalence to 2F1, 1F1 or 0F1 under a power @ Moebius 
            <- hyper3 successful: received ODE is equivalent to the 2F1 ODE 
         <- hypergeometric solution without integrals succesful 
      <- hypergeometric successful 
   <- special function solution successful 
      -> Trying to convert hypergeometric functions to elementary form... 
      <- elementary form for at least one hypergeometric solution is achieved -\ 
 returning with no uncomputed integrals 
   <- Kovacics algorithm successful
 

Maple step by step

Let’s solve2x2(x2+2)(ddxddxy(x))+7x3(ddxy(x))+(3x2+1)y(x)=0Highest derivative means the order of the ODE is2ddxddxy(x)Isolate 2nd derivativeddxddxy(x)=(3x2+1)y(x)2x2(x2+2)7x(ddxy(x))2(x2+2)Group terms withy(x)on the lhs of the ODE and the rest on the rhs of the ODE; ODE is linearddxddxy(x)+7x(ddxy(x))2(x2+2)+(3x2+1)y(x)2x2(x2+2)=0Check to see ifx0is a regular singular pointDefine functions[P2(x)=7x2(x2+2),P3(x)=3x2+12x2(x2+2)]xP2(x)is analytic atx=0(xP2(x))|x=0=0x2P3(x)is analytic atx=0(x2P3(x))|x=0=14x=0is a regular singular pointCheck to see ifx0is a regular singular pointx0=0Multiply by denominators2x2(x2+2)(ddxddxy(x))+7x3(ddxy(x))+(3x2+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+rConvertx3(ddxy(x))to series expansionx3(ddxy(x))=k=0ak(k+r)xk+r+2Shift index usingk>k2x3(ddxy(x))=k=2ak2(k2+r)xk+rConvertxm(ddxddxy(x))to series expansion form=2..4xm(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)2xr+a1(1+2r)2x1+r+(k=2(ak(2k+2r1)2+ak2(2k+2r1)(k+r1))xk+r)=0a0cannot be 0 by assumption, giving the indicial equation(1+2r)2=0Values of r that satisfy the indicial equationr=12Each term must be 0a1(1+2r)2=0Solve for the dependent coefficient(s)a1=0Each term in the series must be 0, giving the recursion relation4(k+r12)(ak2(k+r1)2+ak(k+r12))=0Shift index usingk>k+24(k+32+r)(ak(k+r+1)2+ak+2(k+32+r))=0Recursion relation that defines series solution to ODEak+2=ak(k+r+1)2k+2r+3Recursion relation forr=12ak+2=ak(k+32)2k+4Solution forr=12[y(x)=k=0akxk+12,ak+2=ak(k+32)2k+4,a1=0]
Mathematica. Time used: 0.429 (sec). Leaf size: 93
ode=2*x^2*(2+x^2)*D[y[x],{x,2}]+7*x^3*D[y[x],x]+(1+3*x^2)*y[x]==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)exp(1x3K[1]2+44K[1]3+8K[1]dK[1])(c21xexp(21K[2]3K[1]2+44K[1]3+8K[1]dK[1])dK[2]+c1)(x2+2)7/8
Sympy
from sympy import * 
x = symbols("x") 
y = Function("y") 
ode = Eq(7*x**3*Derivative(y(x), x) + 2*x**2*(x**2 + 2)*Derivative(y(x), (x, 2)) + (3*x**2 + 1)*y(x),0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
False