2.1.625 Problem 642

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

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

Solved as second order ode using Kovacic algorithm

Time used: 0.245 (sec)

Writing the ode as

(1)t2y+(t2+t)yy=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=t2(3)B=t2+tC=1

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=t22t+34t2

Comparing the above to (5) shows that

s=t22t+3t=4t2

Therefore eq. (4) becomes

(7)z(t)=(t22t+34t2)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.625: 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=4t2. There is a pole at t=0 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=14+34t212t

For the pole at t=0 let b be the coefficient of 1t2 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)r1212t+12t2+12t3+14t414t534t634t7+

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

a=12

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

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

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

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=t22t+34t2=Q+R4t2=(14)+(2t+34t2)=14+2t+34t2

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

b=(12)(0)=12

Hence

[r]=12α+=12(bav)=12(12120)=12α=12(bav)=12(12120)=12

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

r=t22t+34t2

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

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

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(1212t)(0)+((12t2)+(1212t)2(t22t+34t2))=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(1212t)dt=et2t

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

y1=z1e12BAdt=z1e12t2+tt2dt=z1et2ln(t)2=z1(et2t)

Which simplifies to

y1=ett

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

y2=y1eBAdty12dt

Substituting gives

y2=y1et2+tt2dt(y1)2dt=y1etln(t)(y1)2dt=y1((1+t)tetln(t)e2t)

Therefore the solution is

y=c1y1+c2y2=c1(ett)+c2(ett((1+t)tetln(t)e2t))

Will add steps showing solving for IC soon.

Maple. Time used: 0.004 (sec). Leaf size: 17
ode:=t^2*diff(diff(y(t),t),t)+(-t^2+t)*diff(y(t),t)-y(t) = 0; 
dsolve(ode,y(t), singsol=all);
 
y=c2et+c1t+c1t

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 solvet2(ddtddty(t))+(t2+t)(ddty(t))y(t)=0Highest derivative means the order of the ODE is2ddtddty(t)Isolate 2nd derivativeddtddty(t)=y(t)t2+(t1)(ddty(t))tGroup terms withy(t)on the lhs of the ODE and the rest on the rhs of the ODE; ODE is linearddtddty(t)(t1)(ddty(t))ty(t)t2=0Check to see ift0=0is a regular singular pointDefine functions[P2(t)=t1t,P3(t)=1t2]tP2(t)is analytic att=0(tP2(t))|t=0=1t2P3(t)is analytic att=0(t2P3(t))|t=0=1t=0is a regular singular pointCheck to see ift0=0is a regular singular pointt0=0Multiply by denominatorst2(ddtddty(t))t(t1)(ddty(t))y(t)=0Assume series solution fory(t)y(t)=k=0aktk+rRewrite ODE with series expansionsConverttm(ddty(t))to series expansion form=1..2tm(ddty(t))=k=0ak(k+r)tk+r1+mShift index usingk>k+1mtm(ddty(t))=k=1+mak+1m(k+1m+r)tk+rConvertt2(ddtddty(t))to series expansiont2(ddtddty(t))=k=0ak(k+r)(k+r1)tk+rRewrite ODE with series expansionsa0(1+r)(1+r)tr+(k=1(ak(k+r+1)(k+r1)ak1(k+r1))tk+r)=0a0cannot be 0 by assumption, giving the indicial equation(1+r)(1+r)=0Values of r that satisfy the indicial equationr{1,1}Each term in the series must be 0, giving the recursion relation(k+r1)(ak(k+r+1)ak1)=0Shift index usingk>k+1(k+r)(ak+1(k+2+r)ak)=0Recursion relation that defines series solution to ODEak+1=akk+2+rRecursion relation forr=1ak+1=akk+1Solution forr=1[y(t)=k=0aktk1,ak+1=akk+1]Recursion relation forr=1ak+1=akk+3Solution forr=1[y(t)=k=0aktk+1,ak+1=akk+3]Combine solutions and rename parameters[y(t)=(k=0aktk1)+(k=0bktk+1),ak+1=akk+1,bk+1=bkk+3]
Mathematica. Time used: 0.249 (sec). Leaf size: 80
ode=t^2*D[y[t],{t,2}]+(t-t^2)*D[y[t],t]-y[t]==0; 
ic={}; 
DSolve[{ode,ic},y[t],t,IncludeSingularSolutions->True]
 
y(t)exp(1t(11K[1])dK[1])(1texp(1K[2](11K[1])dK[1])c1dK[2]+c2)y(t)c2exp(1t(11K[1])dK[1])
Sympy. Time used: 1.099 (sec). Leaf size: 386
from sympy import * 
t = symbols("t") 
y = Function("y") 
ode = Eq(t**2*Derivative(y(t), (t, 2)) + (-t**2 + t)*Derivative(y(t), t) - y(t),0) 
ics = {} 
dsolve(ode,func=y(t),ics=ics)
 
Solution too large to show