Solve
Hence
It is first transformed to the following ode by eliminating the first derivative
Using what is known as the Liouville transformation given by
Where it can be found that \(r\) in (2) is given by
Hence the DE we will solve using Kovacic algorithm is Eq (2) which is
Step 0 We need to find which case it is. \(r=\frac {s}{t}\) where
The free square factorization of \(t\) is \(t=\left [ 1,1,x\right ] \). Hence
Since \(m\) is number of elements in the free square factorization. in this special case we set
Now
There is pole \(x=0\) of order 3. Looking at the cases table, reproduced here
| case | allowed pole order for \(r=\frac {s}{t}\) | allowed \(O\left ( \infty \right ) \) order | \(L\) |
| 1 | \(\left \{ 0,1,2,4,6,8,\cdots \right \} \) | \(\left \{ \cdots ,-8,-6,-4,-2,0,2,3,4,5,6,7,\cdots \right \} \) | \(\left [ 1\right ] \) |
| 2 | \(\left \{ 2,3,5,7,9,\cdots \right \} \) | no condition | \(\left [ 2\right ] \) |
| 3 | \(\left \{ 1,2\right \} \) | \(\left \{ 2,3,4,5,6,7,\cdots \right \} \) | \(\left [ 4,6,12\right ] \) |
Shows that only case 2 is possible (since odd pole is only allowed in case 2). Hence \(L=\left [ 2\right ] \).
Step 1
This step has 4 parts (a,b,c,d).
part (a) Here the fixed parts \(e_{fixed},\theta _{fixed}\) are calculated using
Using \(O\left ( \infty \right ) =1,t=x^{3},t_{1}=1\) the above gives
part (b)
Here the values \(e_{i},\theta _{i}\) are found for \(i=1\cdots k_{2}\) where \(k_{2}\) is the number of roots of \(t_{2}\). In other words, the number of poles of \(r\) that are of order \(2\). There are no poles of order 2. Hence \(k_{2}=0\).
Part (c)
This part applied only to case 1. It is used to generate \(e_{i},\theta _{i}\) for poles of \(r\) order \(4,6,8,\cdots \) if any exist. Since only case 2 exist in this example. This is skipped. Hence \(k_{2}\) stays \(0\).
Part(d)
Now we need to find \(e_{0},\theta _{0}\). If \(O\left ( \infty \right ) >2\) then \(e_{0}=1,\theta _{0}=0\). Hence
Hence now we have
The above are arranged such that \(e_{0}\) is the first entry. Same for \(\theta \). This to keep the same notation as in the paper. The above complete step 1, which is to generates the candidate \(e^{\prime }s\) and \(\theta ^{\prime }s\). In step 2, these are used to generate trials \(d\) and \(\theta \) and find from them \(P\left ( x\right ) \) polynomial if possible.
Step 2
In this step, we now have all the \(e_{i},\theta _{i}\) values found above in addition to \(e_{fix},\theta _{fix}\).
Starting with \(n=2\). Since case 2 only applies here. And since we have \(k_{2}=0\) then there are \(\left ( n+1\right ) ^{k_{2}+1}=3\) sets \(s\) to try. The first set \(s\) is
Now we generate trial \(d\) using
Since \(k_{2}=0\) then the above becomes
If \(d\geq 0\) then we go and find a trial \(\Theta \). We need to have both \(d,\Theta \) to go to the next step. \(\Theta \) is found using
Hence the first trial \(d\) is (using Eq (7)) and recalling that \(e_{fix}=-\frac {1}{4},\theta _{fixed}=\frac {3}{4x}\) gives
Since negative then we can not use it. Now we try the next set \(s=\left \{ 0\right \} \). Then Eq(7) gives
Since negative then we can not use it. Now we try the last set \(s=\left \{ +1\right \} \). Then Eq(7) gives
Since not an integer, then we can not use it. We are run out of sets \(s\) to try. Therefore there is no Liouvillian solution.