2.1.617 Problem 633

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

Internal problem ID [9789]
Book : Collection of Kovacic problems
Section : section 1
Problem number : 633
Date solved : Sunday, March 30, 2025 at 02:46:40 PM
CAS classification : [[_2nd_order, _with_linear_symmetries]]

Solved as second order ode using Kovacic algorithm

Time used: 0.261 (sec)

Writing the ode as

(1)(2t+1)y+(4t4)y+4y=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=2t+1(3)B=4t4C=4

Applying the Liouville transformation on the dependent variable gives

z(t)=yeB2Adt

Then (2) becomes

(4)z(t)=rz(t)

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=4t2+2(2t+1)2

Comparing the above to (5) shows that

s=4t2+2t=(2t+1)2

Therefore eq. (4) becomes

(7)z(t)=(4t2+2(2t+1)2)z(t)

Equation (7) is now solved. After finding z(t) then y is found using the inverse transformation

y=z(t)eB2Adt

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.617: 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)=22=0

The poles of r in eq. (7) and the order of each pole are determined by solving for the roots of t=(2t+1)2. There is a pole at t=12 of order 2. Since there is no odd order pole larger than 2 and the order at is 0 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=1+34(t+12)21t+12

For the pole at t=12 let b be the coefficient of 1(t+12)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 Or()=0 then

v=Or()2=02=0

[r] is the sum of terms involving ti for 0iv in the Laurent series for r at . Therefore

[r]=i=0vaiti(8)=i=00aiti

Let a be the coefficient of tv=t0 in the above sum. The Laurent series of r at is

(9)r112t+12t214t3+332t4364t5+132t6164t7+

Comparing Eq. (9) with Eq. (8) shows that

a=1

From Eq. (9) the sum up to v=0 gives

[r]=i=00aiti(10)=1

Now we need to find b, where b be the coefficient of tv1=t1=1t in r minus the coefficient of same term but in ([r])2 where [r] was found above in Eq (10). Hence

([r])2=1

This shows that the coefficient of 1t in the above is 0. Now we need to find the coefficient of 1t in r. How this is done depends on if v=0 or not. Since v=0 then starting from r=st and doing long division in the form

r=Q+Rt

Where Q is the quotient and R is the remainder. Then the coefficient of 1t in r will be the coefficient in R of the term in t of degree of t minus one, divided by the leading coefficient in t. Doing long division gives

r=st=4t2+24t2+4t+1=Q+R4t2+4t+1=(1)+(4t+14t2+4t+1)=1+4t+14t2+4t+1

Since the degree of t is 2, then we see that the coefficient of the term t in the remainder R is 4. Dividing this by leading coefficient in t which is 4 gives 1. Now b can be found.

b=(1)(0)=1

Hence

[r]=1α+=12(bav)=12(110)=12α=12(bav)=12(110)=12

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

r=4t2+2(2t+1)2

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

Order of r at [r] α+ α
0 1 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)=12(12)=0

Since d an integer and d0 then it can be used to find ω using

ω=cΓ(s(c)[r]c+αcs(c)tc)+s()[r]

Substituting the above values in the above results in

ω=(()[r]c1+αc1tc1)+(+)[r]=12(t+12)+(1)=12(t+12)+1=2t2t+1

Now that ω is determined, the next step is find a corresponding minimal polynomial p(t) of degree d=0 to solve the ode. The polynomial p(t) needs to satisfy the equation

(1A)p+2ωp+(ω+ω2r)p=0

Let

(2A)p(t)=1

Substituting the above in eq. (1A) gives

(0)+2(12(t+12)+1)(0)+((12(t+12)2)+(12(t+12)+1)2(4t2+2(2t+1)2))=00=0

The equation is satisfied since both sides are zero. Therefore the first solution to the ode z=rz is

z1(t)=peωdt=e(12(t+12)+1)dt=et2t+1

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

y1=z1e12BAdt=z1e124t42t+1dt=z1et+ln(2t+1)2=z1(2t+1et)

Which simplifies to

y1=e2t

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

y2=y1eBAdty12dt

Substituting gives

y2=y1e4t42t+1dt(y1)2dt=y1e2t+ln(2t+1)(y1)2dt=y1((t+1)e2t+ln(2t+1)e4t2t+1)

Therefore the solution is

y=c1y1+c2y2=c1(e2t)+c2(e2t((t+1)e2t+ln(2t+1)e4t2t+1))

Will add steps showing solving for IC soon.

Maple. Time used: 0.004 (sec). Leaf size: 15
ode:=(2*t+1)*diff(diff(y(t),t),t)-4*(1+t)*diff(y(t),t)+4*y(t) = 0; 
dsolve(ode,y(t), singsol=all);
 
y=c2e2t+c1t+c1

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 solve(2t+1)(ddtddty(t))4(t+1)(ddty(t))+4y(t)=0Highest derivative means the order of the ODE is2ddtddty(t)Isolate 2nd derivativeddtddty(t)=4y(t)2t+1+4(t+1)(ddty(t))2t+1Group terms withy(t)on the lhs of the ODE and the rest on the rhs of the ODE; ODE is linearddtddty(t)4(t+1)(ddty(t))2t+1+4y(t)2t+1=0Check to see ift0=12is a regular singular pointDefine functions[P2(t)=4(t+1)2t+1,P3(t)=42t+1](t+12)P2(t)is analytic att=12((t+12)P2(t))|t=12=1(t+12)2P3(t)is analytic att=12((t+12)2P3(t))|t=12=0t=12is a regular singular pointCheck to see ift0=12is a regular singular pointt0=12Multiply by denominators(2t+1)(ddtddty(t))+(4t4)(ddty(t))+4y(t)=0Change variables usingt=u12so that the regular singular point is atu=02u(ddudduy(u))+(4u2)(dduy(u))+4y(u)=0Assume series solution fory(u)y(u)=k=0akuk+rRewrite ODE with series expansionsConvertum(dduy(u))to series expansion form=0..1um(dduy(u))=k=0ak(k+r)uk+r1+mShift index usingk>k+1mum(dduy(u))=k=1+mak+1m(k+1m+r)uk+rConvertu(ddudduy(u))to series expansionu(ddudduy(u))=k=0ak(k+r)(k+r1)uk+r1Shift index usingk>k+1u(ddudduy(u))=k=1ak+1(k+1+r)(k+r)uk+rRewrite ODE with series expansions2a0r(2+r)u1+r+(k=0(2ak+1(k+1+r)(k+r1)4ak(k+r1))uk+r)=0a0cannot be 0 by assumption, giving the indicial equation2r(2+r)=0Values of r that satisfy the indicial equationr{0,2}Each term in the series must be 0, giving the recursion relation2(k+r1)(ak+1(k+1+r)2ak)=0Recursion relation that defines series solution to ODEak+1=2akk+1+rRecursion relation forr=0ak+1=2akk+1Solution forr=0[y(u)=k=0akuk,ak+1=2akk+1]Revert the change of variablesu=t+12[y(t)=k=0ak(t+12)k,ak+1=2akk+1]Recursion relation forr=2ak+1=2akk+3Solution forr=2[y(u)=k=0akuk+2,ak+1=2akk+3]Revert the change of variablesu=t+12[y(t)=k=0ak(t+12)k+2,ak+1=2akk+3]Combine solutions and rename parameters[y(t)=(k=0ak(t+12)k)+(k=0bk(t+12)k+2),ak+1=2akk+1,bk+1=2bkk+3]
Mathematica. Time used: 0.169 (sec). Leaf size: 88
ode=(2*t+1)*D[y[t],{t,2}]-4*(t+1)*D[y[t],t]+4*y[t]==0; 
ic={}; 
DSolve[{ode,ic},y[t],t,IncludeSingularSolutions->True]
 
y(t)exp(1t2K[1]2K[1]+1dK[1]121t(222K[2]+1)dK[2])(c21texp(21K[3]2K[1]2K[1]+1dK[1])dK[3]+c1)
Sympy. Time used: 1.140 (sec). Leaf size: 63
from sympy import * 
t = symbols("t") 
y = Function("y") 
ode = Eq((2*t + 1)*Derivative(y(t), (t, 2)) - (4*t + 4)*Derivative(y(t), t) + 4*y(t),0) 
ics = {} 
dsolve(ode,func=y(t),ics=ics)
 
y(t)=t4r(3)+17t5r(3)10+C2(52t51511t434t2+1)+C1t(2t4+2t3+2t+1)+O(t6)