2.1.541 Problem 557

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

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

Solve

x2(x22x+1)yx(3+x)y+(4+x)y=0

Solved as second order ode using Kovacic algorithm

Time used: 0.408 (sec)

Writing the ode as

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

Comparing (1) and (2) shows that

A=x2(x1)2(3)B=x23xC=4+x

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=7x2+10x14x2(x1)4

Comparing the above to (5) shows that

s=7x2+10x1t=4x2(x1)4

Therefore eq. (4) becomes

(7)z(x)=(7x2+10x14x2(x1)4)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.541: 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)=62=4

The poles of r in eq. (7) and the order of each pole are determined by solving for the roots of t=4x2(x1)4. There is a pole at x=0 of order 2. There is a pole at x=1 of order 4. 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. 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=74(x1)232(x1)2(x1)3+4(x1)4+32x14x2

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

Looking at higher order poles of order 2v4 (must be even order for case one).Then for each pole c, [r]c is the sum of terms 1(xc)i for 2iv in the Laurent series expansion of r expanded around each pole c. Hence

(1B)[r]c=2vai(xc)i

Let a be the coefficient of the term 1(xc)v in the above where v is the pole order divided by 2. Let b be the coefficient of 1(xc)v+1 in r minus the coefficient of 1(xc)v+1 in [r]c. Then

αc+=12(ba+v)αc=12(ba+v)

The partial fraction decomposition of r is

r=74(x1)232(x1)2(x1)3+4(x1)4+32x14x2

There is pole in r at x=1 of order 4, hence v=2. Expanding r as Laurent series about this pole c=1 gives

(2B)[r]c2(x1)212(x1)+21329x32+53(x1)2256149(x1)31024+

Using eq. (1B), taking the sum up to v=2 the above becomes

(3B)[r]c=2(x1)2

The above shows that the coefficient of 1(x1)2 is

a=2

Now we need to find b. let b be the coefficient of the term 1(xc)v+1 in r minus the coefficient of the same term but in the sum [r]c found in eq. (3B). Here c is current pole which is c=1. This term becomes 1(x1)3. The coefficient of this term in the sum [r]c is seen to be 0 and the coefficient of this term r is found from the partial fraction decomposition from above to be 2. Therefore

b=(2)(0)=2

Hence

[r]c=2(x1)2αc+=12(ba+v)=12(22+2)=12αc=12(ba+v)=12(22+2)=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=7x2+10x14x2(x1)4

pole c location pole order [r]c αc+ αc
0 2 0 12 12
1 4 2(x1)2 12 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+αc1+xc1)+((+)[r]c2+αc2+xc2)+()[r]=12x+2(x1)2+12x2+()(0)=12x+2(x1)2+12x2=2x2+x+12x(x1)2

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+2(x1)2+12x2)(0)+((12x24(x1)312(x1)2)+(12x+2(x1)2+12x2)2(7x2+10x14x2(x1)4))=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+2(x1)2+12x2)dx=x1xe2x1

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

y1=z1e12BAdx=z1e12x23xx2(x1)2dx=z1e2x13ln(x1)2+3ln(x)2=z1(x3/2e2x1(x1)3/2)

Which simplifies to

y1=x3/2e4x1x(x1)(x1)3/2

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

y2=y1eBAdxy12dx

Substituting gives

y2=y1ex23xx2(x1)2dx(y1)2dx=y1e4x13ln(x1)+3ln(x)(y1)2dx=y1(e4Ei1(4x14))

Therefore the solution is

y=c1y1+c2y2=c1(x3/2e4x1x(x1)(x1)3/2)+c2(x3/2e4x1x(x1)(x1)3/2(e4Ei1(4x14)))

Will add steps showing solving for IC soon.

Maple. Time used: 0.006 (sec). Leaf size: 45
ode:=x^2*(x^2-2*x+1)*diff(diff(y(x),x),x)-x*(x+3)*diff(y(x),x)+(x+4)*y(x) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=x2(Ei1(4xx1)e4xx1c2+e4x1c1)x1

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 solvex2(x22x+1)(ddxddxy(x))x(3+x)(ddxy(x))+(4+x)y(x)=0Highest derivative means the order of the ODE is2ddxddxy(x)Isolate 2nd derivativeddxddxy(x)=(4+x)y(x)x2(x22x+1)+(3+x)(ddxy(x))x(x22x+1)Group terms withy(x)on the lhs of the ODE and the rest on the rhs of the ODE; ODE is linearddxddxy(x)(3+x)(ddxy(x))x(x22x+1)+(4+x)y(x)x2(x22x+1)=0Check to see ifx0is a regular singular pointDefine functions[P2(x)=3+xx(x22x+1),P3(x)=4+xx2(x22x+1)]xP2(x)is analytic atx=0(xP2(x))|x=0=3x2P3(x)is analytic atx=0(x2P3(x))|x=0=4x=0is a regular singular pointCheck to see ifx0is a regular singular pointx0=0Multiply by denominatorsx2(x22x+1)(ddxddxy(x))x(3+x)(ddxy(x))+(4+x)y(x)=0Assume series solution fory(x)y(x)=k=0akxk+rRewrite ODE with series expansionsConvertxmy(x)to series expansion form=0..1xmy(x)=k=0akxk+r+mShift index usingk>kmxmy(x)=k=makmxk+rConvertxm(ddxy(x))to series expansion form=1..2xm(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 expansionsa0(2+r)2xr+(a1(1+r)2a0(1+2r)(1+r))x1+r+(k=2(ak(k+r2)2ak1(2k1+2r)(k+r2)+ak2(k+r2)(k3+r))xk+r)=0a0cannot be 0 by assumption, giving the indicial equation(2+r)2=0Values of r that satisfy the indicial equationr=2Each term must be 0a1(1+r)2a0(1+2r)(1+r)=0Solve for the dependent coefficient(s)a1=a0(1+2r)1+rEach term in the series must be 0, giving the recursion relation(k+r2)((ak+ak22ak1)k+(ak+ak22ak1)r2ak3ak2+ak1)=0Shift index usingk>k+2(k+r)((ak+2+ak2ak+1)(k+2)+(ak+2+ak2ak+1)r2ak+23ak+ak+1)=0Recursion relation that defines series solution to ODEak+2=kak2kak+1+rak2rak+1ak3ak+1k+rRecursion relation forr=2ak+2=kak2kak+1+ak7ak+1k+2Solution forr=2[y(x)=k=0akxk+2,ak+2=kak2kak+1+ak7ak+1k+2,a1=5a0]
Mathematica. Time used: 0.285 (sec). Leaf size: 116
ode=x^2*(1-2*x+x^2)*D[y[x],{x,2}]-x*(3+x)*D[y[x],x]+(4+x)*y[x]==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)exp(1x2K[1]2+K[1]+12(K[1]1)2K[1]dK[1]121xK[2]+3(K[2]1)2K[2]dK[2])(c21xexp(21K[3]2K[1]2+K[1]+12(K[1]1)2K[1]dK[1])dK[3]+c1)
Sympy
from sympy import * 
x = symbols("x") 
y = Function("y") 
ode = Eq(x**2*(x**2 - 2*x + 1)*Derivative(y(x), (x, 2)) - x*(x + 3)*Derivative(y(x), x) + (x + 4)*y(x),0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
False