Solve
Using power series method by expanding around \(x=0\). Writing the ode as
Shows that \(x=0\) is a singular point. But \(\lim _{x\rightarrow 0}x\frac {1}{x}=1\). Hence the singularity is removable. This means \(x=0\) is a regular singular point. In this case the Frobenius power series will be used instead of the standard power series. Let
Where \(r\) is to be determined. It is the root of the indicial equation.
Substituting the above in (1) gives
Here, we need to make all powers on \(x\) the same, without making the sums start below zero. This can be done by adjusting the last term above as follows
Eq (2) becomes
Eq (3) is the base equation which is used to find roots of indicial equation. For \(n=0\) the above gives
Since \(a_{0}\neq 0\) then (4) gives
Hence the roots of the indicial equation are \(r=0\) which is a double root. Hence \(r_{1}=r_{2}=0\). This is the case when roots of indicial equation are repeated. In this case the solution \(y_{h}\left ( x\right ) \) is given by
Where \(y_{1}\left ( x\right ) \) is the first solution, which is assumed to be
This is the standard Frobenius power series, just like we did to find the indicial equation, the only difference is that now we use \(r=r_{1}\), and hence it is a known value. Once we find \(y_{1}\left ( x\right ) \), then the second solution is
Something important to notice. In the sum above, it starts from \(1\) and not from \(0\). The main issue is how to find \(b_{n}\). Since that is the only thing we need to be able to complete the solution as \(y_{1}\left ( x\right ) \) is easily found. It turns out that there is a relation between the \(b_{n}\) and the \(a_{n}\). The \(b_{n}\) can be found by taking just derivative of \(a_{n}\) as function of \(r\) for each \(n\) and then evaluating the result at \(r=r_{1}\). How this is done will be shown below.
First we need to find \(y_{1}\left ( x\right ) \). Substituting (5) in the ODE gives (3) again (but now with \(r\) having specific value \(r_{1}\)).
Now we are ready to find \(a_{n}\) for \(n>0\). We skip \(n=0\) since that was used to obtain the indicial equation.
For \(n=1\). Eq (7) gives
But \(r=r_{1}=0\). The above becomes \(a_{1}=0\). It is a good idea to use a table to keep record of the \(a_{n}\) values as function of \(r\), since this will be used later to find \(b_{n}\).
\(n\) | \(a_{n}\) | \(a_{n}\left ( r=r_{1}\right ) \) |
\(0\) | \(a_{0}\) | \(a_{0}\) |
\(1\) | \(0\) | \(0\) |
For \(n\geq 2\) now we obtain the recursive equation. Notice that the recursive equation starts from \(n\) which is the largest lower summation index. In this case it is \(n=2\). For all lower index, we have to find \(a_{n}\) without the use of recursive equation as we did above for \(a_{1}\). Using (7), the recursive equation is
The above EQ. (8) is very important, since we will use it to find all \(a_{n}\). It is valid only for \(n\geq 2\). Now we find few more \(a_{n}\) terms. From above and for \(n=2\)
and \(r=r_{1}=0\) then the above becomes
The table now becomes
\(n\) | \(a_{n}\left ( r\right ) \) | \(a_{n}\left ( r=r_{1}\right ) \) |
\(0\) | \(a_{0}\) | \(1\) |
\(1\) | \(0\) | \(0\) |
\(2\) | \(-\frac {a_{0}}{\left ( r+2\right ) ^{2}}\) | \(-\frac {a_{0}}{4}\) |
And for \(n=3\)
But \(a_{1}=0\). Then \(a_{3}=0\). The table becomes
\(n\) | \(a_{n}\left ( r\right ) \) | \(a_{n}\left ( r=r_{1}\right ) \) |
\(0\) | \(a_{0}\) | \(a_{0}\) |
\(1\) | \(0\) | \(0\) |
\(2\) | \(-\frac {a_{0}}{\left ( r+2\right ) ^{2}}\) | \(-\frac {a_{0}}{4}\) |
\(3\) | \(0\) | \(0\) |
For \(n=4\) Eq (8) gives
But \(a_{2}\) from the table is \(-\frac {1}{\left ( r+2\right ) ^{2}}\). Hence
The above becomes at \(r=r_{1}=0\)
The Table now becomes
\(n\) | \(a_{n}\left ( r\right ) \) | \(a_{n}\left ( r=r_{1}\right ) \) |
\(0\) | \(a_{0}\) | \(a_{0}\) |
\(1\) | \(0\) | \(0\) |
\(2\) | \(-\frac {a_{0}}{\left ( r+2\right ) ^{2}}\) | \(-\frac {a_{0}}{4}\) |
\(3\) | \(0\) | \(0\) |
\(4\) | \(\frac {a_{0}}{\left ( r^{2}+6r+8\right ) ^{2}}\) | \(\frac {a_{0}}{64}\) |
For \(n=5\) Eq (8) gives
But \(a_{3}=0\), hence \(a_{5}=0\). The table becomes
\(n\) | \(a_{n}\left ( r\right ) \) | \(a_{n}\left ( r=r_{1}\right ) \) |
\(0\) | \(a_{0}\) | \(a_{0}\) |
\(1\) | \(0\) | \(0\) |
\(2\) | \(-\frac {a_{0}}{\left ( r+2\right ) ^{2}}\) | \(-\frac {a_{0}}{4}\) |
\(3\) | \(0\) | \(0\) |
\(4\) | \(\frac {a_{0}}{\left ( r^{2}+6r+8\right ) ^{2}}\) | \(\frac {a_{0}}{64}\) |
\(5\) | \(0\) | \(0\) |
For \(n=6\) Eq (8) gives
But from the table \(a_{4}=\frac {a_{0}}{\left ( r^{2}+6r+8\right ) ^{2}}\), so the above becomes
At \(r=r_{1}=0\) the above becomes
The table becomes
\(n\) | \(a_{n}\) | \(a_{n}\left ( r=r_{1}\right ) \) |
\(0\) | \(a_{0}\) | \(a_{0}\) |
\(1\) | \(0\) | \(0\) |
\(2\) | \(-\frac {a_{0}}{\left ( r+2\right ) ^{2}}\) | \(-\frac {a_{0}}{4}\) |
\(3\) | \(0\) | \(0\) |
\(4\) | \(\frac {a_{0}}{\left ( r^{2}+6r+8\right ) ^{2}}\) | \(\frac {a_{0}}{64}\) |
\(5\) | \(0\) | \(0\) |
\(6\) | \(-\frac {a_{0}}{\left ( r+6\right ) ^{2}\left ( r^{2}+6r+8\right ) ^{2}}\) | \(-\frac {a_{0}}{2304}\) |
And so on. Hence \(y_{1}\left ( x\right ) \) is
But \(r=r_{1}=0\). Therefore
We are done finding \(y_{1}\left ( x\right ) \). This was not bad at all. Now comes the hard part. Which is finding \(y_{2}\left ( x\right ) \). From (6) it is given by
To find \(b_{n}\), we will use the following
Notice that \(n\) starts from \(1\). Hence
What the above says, is that we first take derivative of \(a_{n}\) w.r.t. \(r\) and evaluate the result at the root of the indicial equation. Using the table above, we obtain (recalling that \(r_{1}=0\) in this example)
\(n\) | \(a_{n}\) | \(a_{n}\left ( r=r_{1}\right ) \) | \(b_{n}=\frac {d}{dr}\left ( a_{n}\right ) \) | \(b_{n}\left ( r=r_{1}\right ) \) |
\(0\) | \(a_{0}\) | \(a_{0}\) | N/A since \(b\) starts from \(n=1\) | N/A |
\(1\) | \(0\) | \(0\) | \(0\) | \(0\) |
\(2\) | \(-\frac {a_{0}}{\left ( r+2\right ) ^{2}}\) | \(-\frac {a_{0}}{4}\) | \(\frac {d}{dr}\left ( -\frac {a_{0}}{\left ( r+2\right ) ^{2}}\right ) =\frac {2a_{0}}{\left ( r+2\right ) ^{3}}\) | \(\frac {2a_{0}}{\left ( 2\right ) ^{3}}=\) \(\frac {a_{0}}{4}\) |
\(3\) | \(0\) | \(0\) | \(0\) | \(0\) |
\(4\) | \(\frac {a_{0}}{\left ( r^{2}+6r+8\right ) ^{2}}\) | \(\frac {a_{0}}{64}\) | \(\frac {d}{dr}\left ( \frac {a_{0}}{\left ( r^{2}+6r+8\right ) ^{2}}\right ) =-2a_{0}\frac {2r+6}{\left ( r^{2}+6r+8\right ) ^{3}}\) | \(-2a_{0}\frac {6}{\left ( 8\right ) ^{3}}=-\frac {3a_{0}}{128}\) |
\(5\) | \(0\) | \(0\) | \(0\) | \(0\) |
\(6\) | \(-\frac {a_{0}}{\left ( r+6\right ) ^{2}\left ( r^{2}+6r+8\right ) ^{2}}\) | \(-\frac {a_{0}}{2304}\) | \(\frac {d}{dr}\left ( -\frac {a_{0}}{\left ( r+6\right ) ^{2}\left ( r^{2}+6r+8\right ) ^{2}}\right ) =2a_{0}\frac {3r^{2}+24r+44}{\left ( r^{3}+12r^{2}+44r+48\right ) ^{3}}\) | \(2a_{0}\frac {44}{\left ( 48\right ) ^{3}}=\frac {11a_{0}}{13\,824}\) |
We have found all \(b_{n}\) terms. Hence using (6) and since \(r=r_{1}=0\) then
But from the above table, we see that \(b_{1}=0,b_{2}=\frac {a_{0}}{4},b_{3}=0,b_{4}=-\frac {3a_{0}}{128},b_{5}=0,b_{6}=\frac {11a_{0}}{13\,824}\). The above becomes
And we know what \(y_{1}\left ( x\right ) \) is from Eq (9). Hence the above becomes
Therefore the general solution is
We can now absorb \(a_{0}\) into the constants \(c_{1},c_{2}\) and the above becomes
It it easier in implementation to just make \(a_{0}=1\) at the start of this process so we do not have to carry it around, and that is what we will do from now on.
This completes the solution. The only difficulty in this method, is to make sure when finding the \(b_{n}\) is to have access to the \(a_{n}\) with \(r\) being unevaluated form in order to take derivatives correctly. This was done above by keeping a table of these quantities updated.