2.1.540 Problem 556

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

Internal problem ID [9710]
Book : Collection of Kovacic problems
Section : section 1
Problem number : 556
Date solved : Friday, April 25, 2025 at 06:17:45 PM
CAS classification : [[_2nd_order, _with_linear_symmetries]]

Solve

4x2(x2+2x+3)yx(15x214x+3)y+(7x2+3)y=0

Solved as second order ode using Kovacic algorithm

Time used: 0.212 (sec)

Writing the ode as

(1)(4x4+8x3+12x2)y+(15x3+14x23x)y+(7x2+3)y=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=4x4+8x3+12x2(3)B=15x3+14x23xC=7x2+3

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=764x2

Comparing the above to (5) shows that

s=7t=64x2

Therefore eq. (4) becomes

(7)z(x)=(764x2)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.540: 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)=20=2

The poles of r in eq. (7) and the order of each pole are determined by solving for the roots of t=64x2. 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. 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=764x2

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

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

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

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

r=764x2

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

Order of r at [r] α+ α
2 0 78 18

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

d=α(αc1)=18(18)=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]=18x+()(0)=18x=18x

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(18x)(0)+((18x2)+(18x)2(764x2))=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=e18xdx=x1/8

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

y1=z1e12BAdx=z1e1215x3+14x23x4x4+8x3+12x2dx=z1eln(x)8ln(x2+2x+3)=z1(x1/8x2+2x+3)

Which simplifies to

y1=x1/4x2+2x+3

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

y2=y1eBAdxy12dx

Substituting gives

y2=y1e15x3+14x23x4x4+8x3+12x2dx(y1)2dx=y1eln(x)42ln(x2+2x+3)(y1)2dx=y1(4xeln(x)42ln(x2+2x+3)(x2+2x+3)23)

Therefore the solution is

y=c1y1+c2y2=c1(x1/4x2+2x+3)+c2(x1/4x2+2x+3(4xeln(x)42ln(x2+2x+3)(x2+2x+3)23))

Will add steps showing solving for IC soon.

Maple. Time used: 0.014 (sec). Leaf size: 24
ode:=4*x^2*(x^2+2*x+3)*diff(diff(y(x),x),x)-x*(-15*x^2-14*x+3)*diff(y(x),x)+(7*x^2+3)*y(x) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=c2x1/4+c1xx2+2x+3

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(x2+2x+3)(ddxddxy(x))x(15x214x+3)(ddxy(x))+(7x2+3)y(x)=0Highest derivative means the order of the ODE is2ddxddxy(x)Isolate 2nd derivativeddxddxy(x)=(7x2+3)y(x)4x2(x2+2x+3)(15x2+14x3)(ddxy(x))4x(x2+2x+3)Group terms withy(x)on the lhs of the ODE and the rest on the rhs of the ODE; ODE is linearddxddxy(x)+(15x2+14x3)(ddxy(x))4x(x2+2x+3)+(7x2+3)y(x)4x2(x2+2x+3)=0Check to see ifx0is a regular singular pointDefine functions[P2(x)=15x2+14x34x(x2+2x+3),P3(x)=7x2+34x2(x2+2x+3)]xP2(x)is analytic atx=0(xP2(x))|x=0=14x2P3(x)is analytic atx=0(x2P3(x))|x=0=14x=0is a regular singular pointCheck to see ifx0is a regular singular pointx0=0Multiply by denominators4x2(x2+2x+3)(ddxddxy(x))+x(15x2+14x3)(ddxy(x))+(7x2+3)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+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 expansions3a0(1+4r)(1+r)xr+(3a1(3+4r)r+2a0r(3+4r))x1+r+(k=2(3ak(4k+4r1)(k+r1)+2ak1(k+r1)(4k+4r1)+ak2(4k+4r1)(k+r1))xk+r)=0a0cannot be 0 by assumption, giving the indicial equation3(1+4r)(1+r)=0Values of r that satisfy the indicial equationr{1,14}Each term must be 03a1(3+4r)r+2a0r(3+4r)=0Solve for the dependent coefficient(s)a1=2a03Each term in the series must be 0, giving the recursion relation(4k+4r1)(k+r1)(3ak+2ak1+ak2)=0Shift index usingk>k+2(4k+4r+7)(k+r+1)(3ak+2+2ak+1+ak)=0Recursion relation that defines series solution to ODEak+2=2ak+13ak3Recursion relation forr=1ak+2=2ak+13ak3Solution forr=1[y(x)=k=0akxk+1,ak+2=2ak+13ak3,a1=2a03]Recursion relation forr=14ak+2=2ak+13ak3Solution forr=14[y(x)=k=0akxk+14,ak+2=2ak+13ak3,a1=2a03]Combine solutions and rename parameters[y(x)=(k=0akxk+1)+(k=0bkxk+14),ak+2=2ak+13ak3,a1=2a03,bk+2=2bk+13bk3,b1=2b03]
Mathematica. Time used: 0.272 (sec). Leaf size: 67
ode=4*x^2*(3+2*x+x^2)*D[y[x],{x,2}]-x*(3-14*x-15*x^2)*D[y[x],x]+(3+7*x^2)*y[x]==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)13x8(4c2x3/4+3c1)exp(121x(4(K[1]+1)K[1](K[1]+2)+314K[1])dK[1])
Sympy
from sympy import * 
x = symbols("x") 
y = Function("y") 
ode = Eq(4*x**2*(x**2 + 2*x + 3)*Derivative(y(x), (x, 2)) - x*(-15*x**2 - 14*x + 3)*Derivative(y(x), x) + (7*x**2 + 3)*y(x),0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
False