2.1.51 Problem 51

Solved as second order missing y ode
Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

Internal problem ID [8763]
Book : Own collection of miscellaneous problems
Section : section 1.0
Problem number : 51
Date solved : Sunday, March 30, 2025 at 01:30:41 PM
CAS classification : [[_2nd_order, _missing_y]]

Solved as second order missing y ode

Time used: 0.425 (sec)

Solve

t2y2y=0

This is second order ode with missing dependent variable y. Let

u(t)=y

Then

u(t)=y

Hence the ode becomes

t2u(t)2u(t)=0

Which is now solved for u(t) as first order ode.

The ode

(1)u=2ut2

is separable as it can be written as

u=2ut2=f(t)g(u)

Where

f(t)=2t2g(u)=u

Integrating gives

1g(u)du=f(t)dt1udu=2t2dt
ln(u)=2t+c1

We now need to find the singular solutions, these are found by finding for what values g(u) is zero, since we had to divide by this above. Solving g(u)=0 or

u=0

for u gives

u=0

Now we go over each such singular solution and check if it verifies the ode itself and any initial conditions given. If it does not then the singular solution will not be used.

Therefore the solutions found are

ln(u)=2t+c1u=0

In summary, these are the solution found for u(t)

ln(u)=2t+c1u=0

For solution ln(u)=2t+c1, since u=y(t) then we now have a new first order ode to solve which is

ln(y(t))=2t+c1

Since the ode has the form y=f(t), then we only need to integrate f(t).

dy=ec1t2tdty=e2t+c1t2ec1Ei1(2t)+c2

For solution u(t)=0, since u=y then we now have a new first order ode to solve which is

y=0

Since the ode has the form y=f(t), then we only need to integrate f(t).

dy=0dt+c3y=c3

In summary, these are the solution found for (y)

y=e2t+c1t2ec1Ei1(2t)+c2y=c3

Will add steps showing solving for IC soon.

Summary of solutions found

y=c3y=e2t+c1t2ec1Ei1(2t)+c2

Solved as second order ode using Kovacic algorithm

Time used: 0.196 (sec)

Solve

t2y2y=0

Writing the ode as

(1)t2y2y=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=t2(3)B=2C=0

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=1+2tt4

Comparing the above to (5) shows that

s=1+2tt=t4

Therefore eq. (4) becomes

(7)z(t)=(1+2tt4)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.17: 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)=41=3

The poles of r in eq. (7) and the order of each pole are determined by solving for the roots of t=t4. There is a pole at t=0 of order 4. Since there is no odd order pole larger than 2 and the order at is 3 then the necessary conditions for case one are met. Therefore

L=[1]

Attempting to find a solution using case n=1.

Looking at higher order poles of order 2v4 (must be even order for case one).Then for each pole c, [r]c is the sum of terms 1(tc)i for 2iv in the Laurent series expansion of r expanded around each pole c. Hence

(1B)[r]c=2vai(tc)i

Let a be the coefficient of the term 1(tc)v in the above where v is the pole order divided by 2. Let b be the coefficient of 1(tc)v+1 in r minus the coefficient of 1(tc)v+1 in [r]c. Then

αc+=12(ba+v)αc=12(ba+v)

The partial fraction decomposition of r is

r=1t4+2t3

There is pole in r at t=0 of order 4, hence v=2. Expanding r as Laurent series about this pole c=0 gives

(2B)[r]c1t2+1t12+t25t28+7t38+

Using eq. (1B), taking the sum up to v=2 the above becomes

(3B)[r]c=1t2

The above shows that the coefficient of 1(t0)2 is

a=1

Now we need to find b. let b be the coefficient of the term 1(tc)v+1 in r minus the coefficient of the same term but in the sum [r]c found in eq. (3B). Here c is current pole which is c=0. This term becomes 1t3. The coefficient of this term in the sum [r]c is seen to be 0 and the coefficient of this term r is found from the partial fraction decomposition from above to be 2. Therefore

b=(2)(0)=2

Hence

[r]c=1t2αc+=12(ba+v)=12(21+2)=2αc=12(ba+v)=12(21+2)=0

Since the order of r at is 3>2 then

[r]=0α+=0α=1

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

r=1+2tt4

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

Order of r at [r] α+ α
3 0 0 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 α+=0 then

d=α+(αc1)=0(0)=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]=1t2+(0)=1t2=1t2

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(1t2)(0)+((2t3)+(1t2)2(1+2tt4))=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=e1t2dt=e1t

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

y1=z1e12BAdt=z1e122t2dt=z1e1t=z1(e1t)

Which simplifies to

y1=1

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

y2=y1eBAdty12dt

Substituting gives

y2=y1e2t2dt(y1)2dt=y1e2t(y1)2dt=y1(te2t2Ei1(2t))

Therefore the solution is

y=c2y1+c3y2=c2(1)+c3(1(te2t2Ei1(2t)))

Will add steps showing solving for IC soon.

Summary of solutions found

y=c2+c3(te2t2Ei1(2t))
Maple. Time used: 0.002 (sec). Leaf size: 25
ode:=t^2*diff(diff(y(t),t),t)-2*diff(y(t),t) = 0; 
dsolve(ode,y(t), singsol=all);
 
y=e2tc2t2Ei1(2t)c2+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 
<- LODE missing y successful
 

Mathematica. Time used: 0.017 (sec). Leaf size: 29
ode=t^2*D[y[t],{t,2}]-2*D[y[t],t]==0; 
ic={}; 
DSolve[{ode,ic},y[t],t,IncludeSingularSolutions->True]
 
y(t)2c1ExpIntegralEi(2t)+c1e2/tt+c2
Sympy. Time used: 0.793 (sec). Leaf size: 26
from sympy import * 
t = symbols("t") 
y = Function("y") 
ode = Eq(t**2*Derivative(y(t), (t, 2)) - 2*Derivative(y(t), t),0) 
ics = {} 
dsolve(ode,func=y(t),ics=ics)
 
y(t)=C1C2te2t2C2Ei(2eiπt)