2.1.71 Problem 73

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

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

Solve

(4+x)y+(2+x)y+2y=0

Solved as second order ode using Kovacic algorithm

Time used: 0.469 (sec)

Writing the ode as

(1)(4+x)y+(2+x)y+2y=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=4+x(3)B=2+xC=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=x24x244(4+x)2

Comparing the above to (5) shows that

s=x24x24t=4(4+x)2

Therefore eq. (4) becomes

(7)z(x)=(x24x244(4+x)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.71: 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)=22=0

The poles of r in eq. (7) and the order of each pole are determined by solving for the roots of t=4(4+x)2. There is a pole at x=4 of order 2. Since there is no odd order pole larger than 2 and the order at is 0 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=1434+x+2(4+x)2

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

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

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

v=Or()2=02=0

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

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

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

(9)r123x+5x234x3+59x4586x5+370x612484x7+

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

a=12

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

[r]=i=00aixi(10)=12

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

([r])2=14

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

r=Q+Rt

Where Q is the quotient and R is the remainder. Then the coefficient of 1x in r will be the coefficient in R of the term in x of degree of t minus one, divided by the leading coefficient in t. Doing long division gives

r=st=x24x244x2+32x+64=Q+R4x2+32x+64=(14)+(12x404x2+32x+64)=14+12x404x2+32x+64

Since the degree of t is 2, then we see that the coefficient of the term x in the remainder R is 12. Dividing this by leading coefficient in t which is 4 gives 3. Now b can be found.

b=(3)(0)=3

Hence

[r]=12α+=12(bav)=12(3120)=3α=12(bav)=12(3120)=3

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

r=x24x244(4+x)2

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

Order of r at [r] α+ α
0 12 3 3

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

d=α(αc1+)=3(2)=1

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]=24+x+()(12)=24+x12=x2(4+x)

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

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

Let

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

Substituting the above in eq. (1A) gives

(0)+2(24+x12)(1)+((2(4+x)2)+(24+x12)2(x24x244(4+x)2))=0a04+x=0

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

{a0=0}

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

p(x)=x

Therefore the first solution to the ode z=rz is

z1(x)=peωdx=(x)e(24+x12)dx=(x)ex2+2ln(4+x)=x(4+x)2ex2

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

y1=z1e12BAdx=z1e122+x4+xdx=z1ex2+ln(4+x)=z1((4+x)ex2)

Which simplifies to

y1=(4+x)3exx

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

y2=y1eBAdxy12dx

Substituting gives

y2=y1e2+x4+xdx(y1)2dx=y1ex+2ln(4+x)(y1)2dx=y1(ex256xex48(4+x)35ex192(4+x)229ex768(4+x)e4Ei1(4x)24)

Therefore the solution is

y=c1y1+c2y2=c1((4+x)3exx)+c2((4+x)3exx(ex256xex48(4+x)35ex192(4+x)229ex768(4+x)e4Ei1(4x)24))

Will add steps showing solving for IC soon.

Maple. Time used: 0.006 (sec). Leaf size: 52
ode:=(x+4)*diff(diff(y(x),x),x)+(x+2)*diff(y(x),x)+2*y(x) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=c1exx(4+x)3+c2(e4xx(4+x)3Ei1(4x)+x3+9x2+22x+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 
<- Kovacics algorithm successful
 

Maple step by step

Let’s solve(4+x)(ddxddxy(x))+(2+x)(ddxy(x))+2y(x)=0Highest derivative means the order of the ODE is2ddxddxy(x)Isolate 2nd derivativeddxddxy(x)=2y(x)4+x(2+x)(ddxy(x))4+xGroup terms withy(x)on the lhs of the ODE and the rest on the rhs of the ODE; ODE is linearddxddxy(x)+(2+x)(ddxy(x))4+x+2y(x)4+x=0Check to see ifx0=4is a regular singular pointDefine functions[P2(x)=2+x4+x,P3(x)=24+x](4+x)P2(x)is analytic atx=4((4+x)P2(x))|x=4=2(4+x)2P3(x)is analytic atx=4((4+x)2P3(x))|x=4=0x=4is a regular singular pointCheck to see ifx0=4is a regular singular pointx0=4Multiply by denominators(4+x)(ddxddxy(x))+(2+x)(ddxy(x))+2y(x)=0Change variables usingx=u4so that the regular singular point is atu=0u(ddudduy(u))+(2+u)(dduy(u))+2y(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+rConvertu(ddudduy(u))to series expansionu(ddudduy(u))=k=0ak(k+r)(k+r1)uk+r1Shift index usingk>k+1u(ddudduy(u))=k=1ak+1(k+1+r)(k+r)uk+rRewrite ODE with series expansionsa0r(3+r)u1+r+(k=0(ak+1(k+1+r)(k2+r)+ak(k+r+2))uk+r)=0a0cannot be 0 by assumption, giving the indicial equationr(3+r)=0Values of r that satisfy the indicial equationr{0,3}Each term in the series must be 0, giving the recursion relationak+1(k+1+r)(k2+r)+ak(k+r+2)=0Recursion relation that defines series solution to ODEak+1=ak(k+r+2)(k+1+r)(k2+r)Recursion relation forr=0ak+1=ak(k+2)(k+1)(k2)Series not valid forr=0, division by0in the recursion relation atk=2ak+1=ak(k+2)(k+1)(k2)Recursion relation forr=3ak+1=ak(k+5)(k+4)(k+1)Solution forr=3[y(u)=k=0akuk+3,ak+1=ak(k+5)(k+4)(k+1)]Revert the change of variablesu=4+x[y(x)=k=0ak(4+x)k+3,ak+1=ak(k+5)(k+4)(k+1)]
Mathematica. Time used: 0.375 (sec). Leaf size: 93
ode=(4+x)*D[y[x],{x,2}]+(2+x)*D[y[x],x]+2*y[x]==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)xexp(1xK[1]2(K[1]+4)dK[1]121xK[2]+2K[2]+4dK[2])(c21xexp(21K[3]K[1]2(K[1]+4)dK[1])K[3]2dK[3]+c1)
Sympy
from sympy import * 
x = symbols("x") 
y = Function("y") 
ode = Eq((x + 2)*Derivative(y(x), x) + (x + 4)*Derivative(y(x), (x, 2)) + 2*y(x),0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
False