2.1.612 Problem 628

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

Internal problem ID [9782]
Book : Collection of Kovacic problems
Section : section 1
Problem number : 628
Date solved : Friday, April 25, 2025 at 06:19:36 PM
CAS classification : [[_2nd_order, _with_linear_symmetries]]

Solve

y2(t+1)yt2+2t1+2yt2+2t1=0

Solved as second order ode using Kovacic algorithm

Time used: 0.422 (sec)

Writing the ode as

(1)y+(2t2)yt2+2t1+2yt2+2t1=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=1(3)B=2t2t2+2t1C=2t2+2t1

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=6(t2+2t1)2

Comparing the above to (5) shows that

s=6t=(t2+2t1)2

Therefore eq. (4) becomes

(7)z(t)=(6(t2+2t1)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.612: 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)=40=4

The poles of r in eq. (7) and the order of each pole are determined by solving for the roots of t=(t2+2t1)2. There is a pole at t=21 of order 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 4 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 4 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=34(t2+1)2+34(t+1+2)2328(t2+1)+328(t+1+2)

For the pole at t=21 let b be the coefficient of 1(t2+1)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

For the pole at t=12 let b be the coefficient of 1(t+1+2)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 4>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=6(t2+2t1)2

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

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

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

The above gives

ω=(()[r]c1+αc1tc1)+((+)[r]c2+αc2+tc2)+()[r]=12(t2+1)+32(t+1+2)+()(0)=12(t2+1)+32(t+1+2)=t+122t2+2t1

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(t2+1)+32(t+1+2))(0)+((12(t2+1)232(t+1+2)2)+(12(t2+1)+32(t+1+2))2(6(t2+2t1)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(t2+1)+32(t+1+2))dt=(t+1+2)3/2t2+1

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

y1=z1e12BAdt=z1e122t2t2+2t11dt=z1eln(t2+2t1)2=z1(t2+2t1)

Which simplifies to

y1=t2+2t1(t+1+2)3/2t2+1

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

y2=y1eBAdty12dt

Substituting gives

y2=y1e2t2t2+2t11dt(y1)2dt=y1eln(t2+2t1)(y1)2dt=y1(2(t+1+2)21t+1+2)

Therefore the solution is

y=c1y1+c2y2=c1(t2+2t1(t+1+2)3/2t2+1)+c2(t2+2t1(t+1+2)3/2t2+1(2(t+1+2)21t+1+2))

Will add steps showing solving for IC soon.

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

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 solveddtddty(t)2(t+1)(ddty(t))t2+2t1+2y(t)t2+2t1=0Highest derivative means the order of the ODE is2ddtddty(t)Check to see ift0is a regular singular pointDefine functions[P2(t)=2(t+1)t2+2t1,P3(t)=2t2+2t1](t+1+2)P2(t)is analytic att=12((t+1+2)P2(t))|t=12=0(t+1+2)2P3(t)is analytic att=12((t+1+2)2P3(t))|t=12=0t=12is a regular singular pointCheck to see ift0is a regular singular pointt0=12Multiply by denominators(t2+2t1)(ddtddty(t))+(2t2)(ddty(t))+2y(t)=0Change variables usingt=u12so that the regular singular point is atu=0(u22u2)(ddudduy(u))+(2u+22)(dduy(u))+2y(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+rConvertum(ddudduy(u))to series expansion form=1..2um(ddudduy(u))=k=0ak(k+r)(k+r1)uk+r2+mShift index usingk>k+2mum(ddudduy(u))=k=2+mak+2m(k+2m+r)(k+1m+r)uk+rRewrite ODE with series expansions22(r2)ra0ur1+(k=0(22(k+r1)(k+1+r)ak+1+ak(k+r1)(k+r2))uk+r)=0a0cannot be 0 by assumption, giving the indicial equation22(r2)r=0Values of r that satisfy the indicial equationr{0,2}Each term in the series must be 0, giving the recursion relation(k+r1)(2ak+1(k+1+r)2+ak(k+r2))=0Recursion relation that defines series solution to ODEak+1=ak(k+r2)24(k+1+r)Recursion relation forr=0; series terminates atk=2ak+1=ak(k2)24(k+1)Apply recursion relation fork=0a1=a022Apply recursion relation fork=1a2=a128Express in terms ofa0a2=a08Terminating series solution of the ODE forr=0. Use reduction of order to find the second linearly independent solutiony(u)=a0(1u22+u28)Revert the change of variablesu=t+1+2[y(t)=a0((2t2)28+t28+t4+38)]Recursion relation forr=2ak+1=akk24(k+3)Solution forr=2[y(u)=k=0akuk+2,ak+1=akk24(k+3)]Revert the change of variablesu=t+1+2[y(t)=k=0ak(t+1+2)k+2,ak+1=akk24(k+3)]Combine solutions and rename parameters[y(t)=a0((2t2)28+t28+t4+38)+(k=0bk(t+1+2)k+2),bk+1=bkk24(k+3)]
Mathematica. Time used: 0.447 (sec). Leaf size: 98
ode=D[y[t],{t,2}]-2*(t+1)/(t^2+2*t-1)*D[y[t],t]+2/(t^2+2*t-1)*y[t]==0; 
ic={}; 
DSolve[{ode,ic},y[t],t,IncludeSingularSolutions->True]
 
y(t)t2+2t1exp(1tK[1]+22+1K[1](K[1]+2)1dK[1])(c21texp(21K[2]K[1]+22+1K[1](K[1]+2)1dK[1])dK[2]+c1)
Sympy. Time used: 0.986 (sec). Leaf size: 19
from sympy import * 
t = symbols("t") 
y = Function("y") 
ode = Eq((-2*t - 2)*Derivative(y(t), t)/(t**2 + 2*t - 1) + Derivative(y(t), (t, 2)) + 2*y(t)/(t**2 + 2*t - 1),0) 
ics = {} 
dsolve(ode,func=y(t),ics=ics)
 
y(t)=C2(t2+1)+C1t(1t)+O(t6)