2.1.72 Problem 74

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

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

Solve

(2x2+3x)y+10(1+x)y+8y=0

Solved as second order ode using Kovacic algorithm

Time used: 0.385 (sec)

Writing the ode as

(1)(2x2+3x)y+(10x+10)y+8y=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=2x2+3x(3)B=10x+10C=8

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=x2+6x+10(2x2+3x)2

Comparing the above to (5) shows that

s=x2+6x+10t=(2x2+3x)2

Therefore eq. (4) becomes

(7)z(x)=(x2+6x+10(2x2+3x)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.72: 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=(2x2+3x)2. There is a pole at x=0 of order 2. There is a pole at x=32 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=536(x+32)2+2227(x+32)2227x+109x2

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

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

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

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

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=x2+6x+10(2x2+3x)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=x2+6x+10(2x2+3x)2

pole c location pole order [r]c αc+ αc
0 2 0 53 23
32 2 0 56 16

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)=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+αc1xc1)+(()[r]c2+αc2xc2)+()[r]=23x+16x+9+()(0)=23x+16x+9=x+2x(2x+3)

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(23x+16x+9)(1)+((23x216(x+32)2)+(23x+16x+9)2(x2+6x+10(2x2+3x)2))=04+2a0x(2x+3)=0

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

{a0=2}

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

p(x)=x+2

Therefore the first solution to the ode z=rz is

z1(x)=peωdx=(x+2)e(23x+16x+9)dx=(x+2)e2ln(x)3+ln(2x+3)6=(x+2)(2x+3)1/6x2/3

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

y1=z1e12BAdx=z1e1210x+102x2+3xdx=z1e5ln(x)35ln(2x+3)6=z1(1x5/3(2x+3)5/6)

Which simplifies to

y1=x+2x7/3(2x+3)2/3

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

y2=y1eBAdxy12dx

Substituting gives

y2=y1e10x+102x2+3xdx(y1)2dx=y1e10ln(x)35ln(2x+3)3(y1)2dx=y1(e10ln(x)35ln(2x+3)3x14/3(2x+3)4/3(x+2)2dx)

Therefore the solution is

y=c1y1+c2y2=c1(x+2x7/3(2x+3)2/3)+c2(x+2x7/3(2x+3)2/3(e10ln(x)35ln(2x+3)3x14/3(2x+3)4/3(x+2)2dx))

Will add steps showing solving for IC soon.

Maple. Time used: 0.135 (sec). Leaf size: 31
ode:=(2*x^2+3*x)*diff(diff(y(x),x),x)+10*(1+x)*diff(y(x),x)+8*y(x) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=c1(2+x)(1+2x3)2/3x7/3+c2hypergeom([2,2],[103],2x3)

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 
   Solution has integrals. Trying a special function solution free of integrals\ 
... 
   -> Trying a solution in terms of special functions: 
      -> Bessel 
      -> elliptic 
      -> Legendre 
      -> Kummer 
         -> hyper3: Equivalence to 1F1 under a power @ Moebius 
      -> hypergeometric 
         -> heuristic approach 
         -> hyper3: Equivalence to 2F1, 1F1 or 0F1 under a power @ Moebius 
         <- hyper3 successful: received ODE is equivalent to the 2F1 ODE 
      <- hypergeometric successful 
   <- special function solution successful 
      -> Trying to convert hypergeometric functions to elementary form... 
      <- elementary form for at least one hypergeometric solution is achieved -\ 
 returning with no uncomputed integrals 
   <- Kovacics algorithm successful
 

Maple step by step

Let’s solve(2x2+3x)(ddxddxy(x))+10(1+x)(ddxy(x))+8y(x)=0Highest derivative means the order of the ODE is2ddxddxy(x)Isolate 2nd derivativeddxddxy(x)=8y(x)x(2x+3)10(1+x)(ddxy(x))x(2x+3)Group terms withy(x)on the lhs of the ODE and the rest on the rhs of the ODE; ODE is linearddxddxy(x)+10(1+x)(ddxy(x))x(2x+3)+8y(x)x(2x+3)=0Check to see ifx0is a regular singular pointDefine functions[P2(x)=10(1+x)x(2x+3),P3(x)=8x(2x+3)]xP2(x)is analytic atx=0(xP2(x))|x=0=103x2P3(x)is analytic atx=0(x2P3(x))|x=0=0x=0is a regular singular pointCheck to see ifx0is a regular singular pointx0=0Multiply by denominatorsx(2x+3)(ddxddxy(x))+(10x+10)(ddxy(x))+8y(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(7+3r)x1+r+(k=0(ak+1(k+1+r)(3k+10+3r)+2ak(k+r+2)2)xk+r)=0a0cannot be 0 by assumption, giving the indicial equationr(7+3r)=0Values of r that satisfy the indicial equationr{0,73}Each term in the series must be 0, giving the recursion relationak+1(k+1+r)(3k+10+3r)+2ak(k+r+2)2=0Recursion relation that defines series solution to ODEak+1=2ak(k+r+2)2(k+1+r)(3k+10+3r)Recursion relation forr=0ak+1=2ak(k+2)2(k+1)(3k+10)Solution forr=0[y(x)=k=0akxk,ak+1=2ak(k+2)2(k+1)(3k+10)]Recursion relation forr=73ak+1=2ak(k13)2(k43)(3k+3)Solution forr=73[y(x)=k=0akxk73,ak+1=2ak(k13)2(k43)(3k+3)]Combine solutions and rename parameters[y(x)=(k=0akxk)+(k=0bkxk73),ak+1=2ak(k+2)2(k+1)(3k+10),bk+1=2bk(k13)2(k43)(3k+3)]
Mathematica. Time used: 0.439 (sec). Leaf size: 118
ode=(3*x+2*x^2)*D[y[x],{x,2}]+10*(1+x)*D[y[x],x]+8*y[x]==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)(x+2)exp(1xK[1]+22K[1]2+3K[1]dK[1]121x10(K[2]+1)K[2](2K[2]+3)dK[2])(c21xexp(21K[3]K[1]+22K[1]2+3K[1]dK[1])(K[3]+2)2dK[3]+c1)
Sympy
from sympy import * 
x = symbols("x") 
y = Function("y") 
ode = Eq((10*x + 10)*Derivative(y(x), x) + (2*x**2 + 3*x)*Derivative(y(x), (x, 2)) + 8*y(x),0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
False