2.1.269 Problem 272

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

Internal problem ID [9439]
Book : Collection of Kovacic problems
Section : section 1
Problem number : 272
Date solved : Friday, April 25, 2025 at 06:08:21 PM
CAS classification : [_Jacobi]

Solve

2x(1x)y+(111x)y10y=0

Solved as second order ode using Kovacic algorithm

Time used: 0.353 (sec)

Writing the ode as

(1)(2x2+2x)y+(111x)y10y=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=2x2+2x(3)B=111xC=10

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=3x2+66x316(x2x)2

Comparing the above to (5) shows that

s=3x2+66x3t=16(x2x)2

Therefore eq. (4) becomes

(7)z(x)=(3x2+66x316(x2x)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.269: 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)=42=2

The poles of r in eq. (7) and the order of each pole are determined by solving for the roots of t=16(x2x)2. There is a pole at x=0 of order 2. 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 2. The partial fractions decomposition of r is

r=316x2+154x+154(1+x)2154(1+x)

For the pole at x=0 let b be the coefficient of 1x2 in the partial fractions decomposition of r given above. Therefore b=316. Hence

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

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

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

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=3x2+66x316(x2x)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=3x2+66x316(x2x)2

pole c location pole order [r]c αc+ αc
0 2 0 34 14
1 2 0 52 32

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

d=α(αc1++αc2)=14(34)=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]c2+αc2xc2)+()[r]=34x32(1+x)+()(0)=34x32(1+x)=3(x+1)4x(1+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(34x32(1+x))(1)+((34x2+32(1+x)2)+(34x32(1+x))2(3x2+66x316(x2x)2))=03+3a02x(1+x)=0

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

{a0=1}

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

p(x)=x+1

Therefore the first solution to the ode z=rz is

z1(x)=peωdx=(x+1)e(34x32(1+x))dx=(x+1)e3ln(1+x)2+3ln(x)4=(x+1)x3/4(1+x)3/2

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

y1=z1e12BAdx=z1e12111x2x2+2xdx=z1e5ln(1+x)2ln(x)4=z1(1(1+x)5/2x1/4)

Which simplifies to

y1=x(x+1)(1+x)4

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

y2=y1eBAdxy12dx

Substituting gives

y2=y1e111x2x2+2xdx(y1)2dx=y1e5ln(1+x)ln(x)2(y1)2dx=y1(2(x2+6x+1)(1+x)5e5ln(1+x)ln(x)2x+1)

Therefore the solution is

y=c1y1+c2y2=c1(x(x+1)(1+x)4)+c2(x(x+1)(1+x)4(2(x2+6x+1)(1+x)5e5ln(1+x)ln(x)2x+1))

Will add steps showing solving for IC soon.

Maple. Time used: 0.012 (sec). Leaf size: 29
ode:=2*x*(1-x)*diff(diff(y(x),x),x)+(1-11*x)*diff(y(x),x)-10*y(x) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=c1(x2+6x+1)+c2x(x+1)(1+x)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) 
   Reducible group (found another exponential solution) 
<- Kovacics algorithm successful
 

Maple step by step

Let’s solve2x(1x)(ddxddxy(x))+(111x)(ddxy(x))10y(x)=0Highest derivative means the order of the ODE is2ddxddxy(x)Isolate 2nd derivativeddxddxy(x)=5y(x)x(1+x)(1+11x)(ddxy(x))2x(1+x)Group terms withy(x)on the lhs of the ODE and the rest on the rhs of the ODE; ODE is linearddxddxy(x)+(1+11x)(ddxy(x))2x(1+x)+5y(x)x(1+x)=0Check to see ifx0is a regular singular pointDefine functions[P2(x)=1+11x2x(1+x),P3(x)=5x(1+x)]xP2(x)is analytic atx=0(xP2(x))|x=0=12x2P3(x)is analytic atx=0(x2P3(x))|x=0=0x=0is a regular singular pointCheck to see ifx0is a regular singular pointx0=0Multiply by denominators2x(1+x)(ddxddxy(x))+(1+11x)(ddxy(x))+10y(x)=0Assume series solution fory(x)y(x)=k=0akxk+rRewrite ODE with series expansionsConvertxm(ddxy(x))to series expansion form=0..1xm(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=1..2xm(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 expansionsa0r(1+2r)x1+r+(k=0(ak+1(k+1+r)(2k+1+2r)+ak(2k+2r+5)(k+r+2))xk+r)=0a0cannot be 0 by assumption, giving the indicial equationr(1+2r)=0Values of r that satisfy the indicial equationr{0,12}Each term in the series must be 0, giving the recursion relation2(k+12+r)(k+1+r)ak+1+2(k+r+2)(k+r+52)ak=0Recursion relation that defines series solution to ODEak+1=(k+r+2)(2k+2r+5)ak(2k+1+2r)(k+1+r)Recursion relation forr=0ak+1=(k+2)(2k+5)ak(2k+1)(k+1)Solution forr=0[y(x)=k=0akxk,ak+1=(k+2)(2k+5)ak(2k+1)(k+1)]Recursion relation forr=12ak+1=(k+52)(2k+6)ak(2k+2)(k+32)Solution forr=12[y(x)=k=0akxk+12,ak+1=(k+52)(2k+6)ak(2k+2)(k+32)]Combine solutions and rename parameters[y(x)=(k=0akxk)+(k=0bkxk+12),ak+1=(k+2)(2k+5)ak(2k+1)(k+1),bk+1=(k+52)(2k+6)bk(2k+2)(k+32)]
Mathematica. Time used: 0.548 (sec). Leaf size: 119
ode=2*x*(1-x)*D[y[x],{x,2}]+(1-11*x)*D[y[x],x]-10*y[x]==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)(x+1)exp(1x3K[1]+34K[1]4K[1]2dK[1]121x(12K[2]+5K[2]1)dK[2])(c21xexp(21K[3]3K[1]+34K[1]4K[1]2dK[1])(K[3]+1)2dK[3]+c1)
Sympy
from sympy import * 
x = symbols("x") 
y = Function("y") 
ode = Eq(2*x*(1 - x)*Derivative(y(x), (x, 2)) + (1 - 11*x)*Derivative(y(x), x) - 10*y(x),0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
False