2.1.791 Problem 813

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

Internal problem ID [9961]
Book : Collection of Kovacic problems
Section : section 1
Problem number : 813
Date solved : Friday, April 25, 2025 at 06:24:00 PM
CAS classification : [[_2nd_order, _with_linear_symmetries]]

Solve

y+2yx2y(1+x)2=0

Solved as second order ode using Kovacic algorithm

Time used: 0.169 (sec)

Writing the ode as

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

Comparing (1) and (2) shows that

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

Comparing the above to (5) shows that

s=2t=(1+x)2

Therefore eq. (4) becomes

(7)z(x)=(2(1+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.791: 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=(1+x)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=2(1+x)2

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=2. Hence

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

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

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

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

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

r=2(1+x)2

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

Order of r at [r] α+ α
2 0 2 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)=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+αc1xc1)+()[r]=11+x+()(0)=11+x=11+x

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(11+x)(0)+((1(1+x)2)+(11+x)2(2(1+x)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=e11+xdx=11+x

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

y1=z1e12BAdx=z1e122x1dx=z1eln(x)=z1(1x)

Which simplifies to

y1=1x2+x

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

y2=y1eBAdxy12dx

Substituting gives

y2=y1e2x1dx(y1)2dx=y1e2ln(x)(y1)2dx=y1((1+x)33)

Therefore the solution is

y=c1y1+c2y2=c1(1x2+x)+c2(1x2+x((1+x)33))

Will add steps showing solving for IC soon.

Maple. Time used: 0.003 (sec). Leaf size: 29
ode:=diff(diff(y(x),x),x)+2/x*diff(y(x),x)-2/(1+x)^2*y(x) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=(x3+3x2+3x)c2+c1(1+x)x

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) 
<- Kovacics algorithm successful
 

Maple step by step

Let’s solveddxddxy(x)+2(ddxy(x))x2y(x)(1+x)2=0Highest derivative means the order of the ODE is2ddxddxy(x)Check to see ifx0is a regular singular pointDefine functions[P2(x)=2x,P3(x)=2(1+x)2](1+x)P2(x)is analytic atx=1((1+x)P2(x))|x=1=0(1+x)2P3(x)is analytic atx=1((1+x)2P3(x))|x=1=2x=1is a regular singular pointCheck to see ifx0is a regular singular pointx0=1Multiply by denominatorsx(1+x)2(ddxddxy(x))+2(1+x)2(ddxy(x))2y(x)x=0Change variables usingx=u1so that the regular singular point is atu=0(u3u2)(ddudduy(u))+2u2(dduy(u))+(2u+2)y(u)=0Assume series solution fory(u)y(u)=k=0akuk+rRewrite ODE with series expansionsConvertumy(u)to series expansion form=0..1umy(u)=k=0akuk+r+mShift index usingk>kmumy(u)=k=makmuk+rConvertu2(dduy(u))to series expansionu2(dduy(u))=k=0ak(k+r)uk+r+1Shift index usingk>k1u2(dduy(u))=k=1ak1(k1+r)uk+rConvertum(ddudduy(u))to series expansion form=2..3um(ddudduy(u))=k=0ak(k+r)(k1+r)uk+r2+mShift index usingk>k+2mum(ddudduy(u))=k=2+mak+2m(k+2m+r)(k+1m+r)uk+rRewrite ODE with series expansionsa0(1+r)(2+r)ur+(k=1(ak(k+r+1)(k+r2)+ak1(k+r+1)(k+r2))uk+r)=0a0cannot be 0 by assumption, giving the indicial equation(1+r)(2+r)=0Values of r that satisfy the indicial equationr{1,2}Each term in the series must be 0, giving the recursion relation(k+r+1)(k+r2)(akak1)=0Shift index usingk>k+1(k+r+2)(k1+r)(ak+1ak)=0Recursion relation that defines series solution to ODEak+1=akRecursion relation forr=1ak+1=akSolution forr=1[y(u)=k=0akuk1,ak+1=ak]Revert the change of variablesu=1+x[y(x)=k=0ak(1+x)k1,ak+1=ak]Recursion relation forr=2ak+1=akSolution forr=2[y(u)=k=0akuk+2,ak+1=ak]Revert the change of variablesu=1+x[y(x)=k=0ak(1+x)k+2,ak+1=ak]Combine solutions and rename parameters[y(x)=(k=0ak(1+x)k1)+(k=0bk(1+x)k+2),ak+1=ak,bk+1=bk]
Mathematica. Time used: 0.033 (sec). Leaf size: 34
ode=D[y[x],{x,2}]+2/x*D[y[x],x]-2/(1+x)^2*y[x]==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)c2x(x2+3x+3)+3c13x(x+1)
Sympy
from sympy import * 
x = symbols("x") 
y = Function("y") 
ode = Eq(Derivative(y(x), (x, 2)) - 2*y(x)/(x + 1)**2 + 2*Derivative(y(x), x)/x,0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
False