2.1.325 Problem 332

Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

Internal problem ID [9497]
Book : Collection of Kovacic problems
Section : section 1
Problem number : 332
Date solved : Sunday, March 30, 2025 at 02:36:14 PM
CAS classification : [[_Emden, _Fowler]]

Solved as second order ode using Kovacic algorithm

Time used: 0.334 (sec)

Writing the ode as

(1)x4y+λy=0(2)Ay+By+Cy=0

Comparing (1) and (2) shows that

A=x4(3)B=0C=λ

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=λx4

Comparing the above to (5) shows that

s=λt=x4

Therefore eq. (4) becomes

(7)z(x)=(λx4)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.325: 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=x4. There is a pole at x=0 of order 4. 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. 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(xc)i for 2iv in the Laurent series expansion of r expanded around each pole c. Hence

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

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

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

The partial fraction decomposition of r is

r=λx4

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

(2B)[r]ciλx2+

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

(3B)[r]c=iλx2

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

a=iλ

Now we need to find b. let b be the coefficient of the term 1(xc)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 1x3. 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 0. Therefore

b=(0)(0)=0

Hence

[r]c=iλx2αc+=12(ba+v)=12(0iλ+2)=1αc=12(ba+v)=12(0iλ+2)=1

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=λx4

pole c location pole order [r]c αc+ αc
0 4 iλx2 1 1

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)=1(1)=0

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]=iλx2+1x+()(0)=iλx2+1x=iλ+xx2

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

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

Let

(2A)p(x)=1

Substituting the above in eq. (1A) gives

(0)+2(iλx2+1x)(0)+((2iλx31x2)+(iλx2+1x)2(λx4))=00=0

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

z1(x)=peωdx=e(iλx2+1x)dx=xeiλx

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

y1=z1e12BAdx

Since B=0 then the above reduces to

y1=z1=xeiλx

Which simplifies to

y1=xeiλx

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

y2=y1eBAdxy12dx

Since B=0 then the above becomes

y2=y11y12dx=xeiλx1x2e2iλxdx=xeiλx(ie2iλx2λ)

Therefore the solution is

y=c1y1+c2y2=c1(xeiλx)+c2(xeiλx(ie2iλx2λ))

Will add steps showing solving for IC soon.

Maple. Time used: 0.006 (sec). Leaf size: 31
ode:=x^4*diff(diff(y(x),x),x)+lambda*y(x) = 0; 
dsolve(ode,y(x), singsol=all);
 
y=x(c1sinh(λx)+c2cosh(λx))

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 
   Group is reducible or imprimitive 
<- Kovacics algorithm successful
 

Mathematica. Time used: 0.142 (sec). Leaf size: 56
ode=x^4*D[y[x],{x,2}]+\[Lambda]*y[x]==0; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)c1xe1+iλxic2xe1iλx2λ
Sympy. Time used: 0.108 (sec). Leaf size: 58
from sympy import * 
x = symbols("x") 
lambda_ = symbols("lambda_") 
y = Function("y") 
ode = Eq(lambda_*y(x) + x**4*Derivative(y(x), (x, 2)),0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
y(x)=x(C1λxJ12(λx)λx+C2Y12(λx))