2.2.8 Problem 8

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

Internal problem ID [9999]
Book : Collection of Kovacic problems
Section : section 2. Solution found using all possible Kovacic cases
Problem number : 8
Date solved : Friday, April 25, 2025 at 06:24:54 PM
CAS classification : [[_2nd_order, _with_linear_symmetries]]

Solve

(x2x)yxy+y=0

Solved as second order ode using Kovacic algorithm

Time used: 0.279 (sec)

Writing the ode as

(1)(x2x)yxy+y=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=x2x(3)B=xC=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=x+44x(x1)2

Comparing the above to (5) shows that

s=x+4t=4x(x1)2

Therefore eq. (4) becomes

(7)z(x)=(x+44x(x1)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.829: 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)=31=2

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

[r]c=0αc+=1αc=1

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

r=1x1+34(x1)2+1x

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

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

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=x+44x(x1)2

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

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

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

r=x+44x(x1)2

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

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

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

d=α(αc1+αc2)=12(12)=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]c2+αc2xc2)+()[r]=1x12(x1)+()(0)=1x12(x1)=x22x(x1)

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(1x12(x1))(0)+((1x2+12(x1)2)+(1x12(x1))2(x+44x(x1)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(1x12(x1))dx=xx1

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

y1=z1e12BAdx=z1e12xx2xdx=z1eln(x1)2=z1(x1)

Which simplifies to

y1=x

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

y2=y1eBAdxy12dx

Substituting gives

y2=y1exx2xdx(y1)2dx=y1eln(x1)(y1)2dx=y1(ln(x)+1x)

Therefore the solution is

y=c1y1+c2y2=c1(x)+c2(x(ln(x)+1x))

Will add steps showing solving for IC soon.

Maple. Time used: 0.004 (sec). Leaf size: 14
ode:=(x^2-x)*diff(diff(y(x),x),x)-x*diff(y(x),x)+y(x) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=ln(x)c2x+c1x+c2

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
 

Mathematica. Time used: 0.391 (sec). Leaf size: 75
ode=(x^2-x)*D[y[x],{x,2}]-x*D[y[x],x]+y[x]==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)1xexp(1x(1K[1]+122K[1])dK[1])(c21xexp(21K[2](1K[1]+122K[1])dK[1])dK[2]+c1)
Sympy
from sympy import * 
x = symbols("x") 
y = Function("y") 
ode = Eq(-x*Derivative(y(x), x) + (x**2 - x)*Derivative(y(x), (x, 2)) + y(x),0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
NotImplementedError : The given ODE -x*Derivative(y(x), (x, 2)) + Derivative(y(x), x) + Derivative(y(x), (x, 2)) - y(x)/x cannot be solved by the factorable group method