3.2 worked examples for case one
3.2.1 Example 1
Let Therefore
Step 1 In this we find all and associated for each pole. There is only one pole at of order 4.
Hence . And . This is step (C3) now in the paper (1).
We need now to find Laurent series of expanded around . This is given by (using series
command on the computer) We need to add all terms in the Laurent series expansion of
from down to . Hence Is only term from 2. Comparing the above to shows that
Hence
Where and . We still need to find . But is the coefficient of the term in minus the
coefficient of in which we just found above. Looking at from Eq (1) we see that the term
has coefficient . And looking at Eq (3) we see that there is no term in it. Hence
Now we found , then (5,6) becomes (since )
We are done with all the poles.
Now we consider which is . Since this is even order and negative then or We need the
Laurent series of around . Using the computer this is Now we only want the terms
where . This implies the above is reduced to The is the coefficient of which
is Now we need to find associated with . For this we need to first find . Recall
from above that is the coefficient of or in minus the coefficient of in . Since
then we want the coefficient of in and subtract from it the coefficient of in .
But
Hence the coefficient of in is . To find the coefficient of in long division is
done
Where is the quotient and is the remainder. This gives For the case of then the coefficient
is read from above. Which is . Hence
For the other case of then the coefficient of in is found using which will give in this case.
(More examples below).
Now that we found , then from the above section describing the algorithm, we see in this
case that
This completes step 1 of the solution. We have found and its associated and found and its
associated . Now we go to step 2 which is to find the .
step 2 Since we have a pole at zero, and we have one , each with signs, then we set up this
table to make it easier to work with. This implements Therefore we obtain 4 possible
values.
We see from the above that we took each pole in this problem (there is only one pole here at
) and its associated with each and generated all possible values from all the combinations.
Hence we obtain 4 possible values in this case. If we had 2 poles, then we would have 8
possible values. Hence the maximum possible values we can get is where is number of
poles. Now we remove all negative values. Hence the trial values remaining is Now for each
value, we generate using To apply the above, we update the table above, now using only
values, but also add columns for to make the computation easier. Here is the new
table
The above are the two candidate values. For each we need to find polynomial by
solving If we are able to find , then we stop and the ode is solved. If we try all
candidate and can not find then this case is not successful and we go to the next
case.
step 3 Now for each candidate we solve the above Eq (8). Starting with associated with in
the table, then (8) becomes
Since this the case for , then has zero degree, Hence is constant. Therefore the above
simplifies to Which means Which is not possible for all . Hence do not generate valid
polynomial. We now try the case of . Since , it means the polynomial is of degree two. Let
Substituting this in (8) using . This gives
Using the above becomes
Therefore
hence from last equation. Using first or second equation gives . Therefore a solution is
found. Hence Therefore the solution to is
The second solution can be found by reduction of order.
3.2.2 Example 2
Let Therefore
Step 1 In this we find all and associated for each pole. There is one pole at of order 2. In
this case, from the description of the algorithm earlier, we write
Where is the coefficient of in the partial fraction decomposition of which is . Hence .
Therefore
We are done with all the poles. Now we consider which is . This falls in the case . Hence We
need the Laurent series of around . Using the computer this is . Hence we need the
coefficient of in this series ( because that is value of ). Recall that is the sum
of terms of for or for since . Looking at the series above, we see that Which
is the coefficient of the term . Now we need to find associated with . For this
we need to first find which is the coefficient of in minus the coefficient of in .
But Hence the coefficient of in is . To find the coefficient of in long division is
done
Where is the quotient and is the remainder. This gives For the other case of then the
coefficient of is found by looking up the coefficient in of to the degree of of then
subtracting one and dividing result by . But degree of is . Therefore we want the coefficient
of or in which is zero. Hence .
Now that we found , then from the above section describing the algorithm, we see in this
case that
This completes step 1 of the solution. We have found and its associated and found and its
associated . Now we go to step 2 which is to find the .
step 2 Since we have a pole at zero, and we have one , each with signs, then we set up this
table to make it easier to work with. This implements Therefore we obtain 4 possible
values.
We see from the above that we took each pole in this problem (there is only one pole here at
) and its associated with each and generated all possible values from all the combinations.
Hence we obtain 4 possible values in this case. If we had 2 poles, then we would have
8 possible values. Hence the maximum possible values we can get is where
is number of poles. Now we remove all negative values. Hence the trial values
remaining is There is one value to try. We can pick any one of the two values of
generated since there are both . Both will give same solution. We generate using To
apply the above, we update the table above, now using only the first value in
the above table. (selecting the second row, will not change the final solution).
but we also add columns for to make the computation easier. Here is the new
table
The above gives one candidate value to try. For this we need to find polynomial by
solving If we are able to find , then we stop and the ode is solved. If we try all
candidate and can not find then this case is not successful and we go to the next
case.
step 3 Now for each candidate we solve the above Eq (8). Starting with associated
with first in the table, then (8) becomes
This needs to be solved for . Since degree of is . Let . The above becomes
Which means Hence we found the polynomial Therefore the solution to is
The second solution can be found by reduction of order. The full general solution to
is
3.2.3 Example 3
Let Therefore
Step 1 In this step we find all and associated for each pole. There are no poles. In this case
(paper was not explicit in saying this, but from example 3 in paper this can be inferred).
Hence the value of is decided by only in this case.
Now we consider which is . This falls in the case . Hence or We need the Laurent series of
around . Using the computer this is Hence we need the coefficient of in this series ( because
that is value of ). Recall that is the sum of terms of for or for since . Looking at the
series above, we see that Which is the coefficient of the term . There is no term .
Hence Now we need to find associated with . For this we need to first find . Recall
from above that is the coefficient of or in minus the coefficient of in . But
. Hence the coefficient of is zero. To find the coefficient of in long division is
done
Where is the quotient and is the remainder. This gives For the case of then the coefficient
is read from above. Which is . Hence
Now that we found , then from the above section describing the algorithm, we see in this
case that
This completes step 1 of the solution. We have found and its associated (these are zero, in
this example, since there are no poles) and found and its associated . Now we go to step 2
which is to find the .
step 2 We set up this table to make it easier to work with. This implements Therefore we
obtain 2 possible values.
| | | | |
pole |
values (all zero) |
value |
|
value |
| | | | |
N/A | | | | |
| | | | |
N/A | | | | |
| | | | |
Picking the positive integers, this gives There is one value to try. We can pick any one of
the two values of generated since there are both . Both will give same solution. We generate
using To apply the above, we update the table above, now using only the first value in the
above table. (selecting the first row). but we also add columns for to make the computation
easier. Here is the new table
The above gives one candidate value to try. For this we need to find polynomial by
solving If we are able to find , then we stop and the ode is solved. If we try all
candidate and can not find then this case is not successful and we go to the next
case.
step 3 Now for each candidate (there is only one in this example) we solve the above Eq (8).
Starting with associated with first in the table, then (8) becomes
This needs to be solved for . Since degree of is . Let . The above becomes
Which means Hence we found the polynomial Therefore the solution to is
The second solution can be found by reduction of order. The full general solution to
is
3.2.4 Example 4
Let Therefore
Step 1 In this we find all and associated for each pole. There is one pole at of order 2. In
this case, from the description of the algorithm earlier, we write
Where is the coefficient of in the partial fraction decomposition of which is . Hence .
Therefore
We are done with all the poles. Now we consider which is . Since then from the
algorithm above Now we calculate for this case. This is given by the leading
coefficient of divided by the leading coefficient of when . In this case , hence .
Therefore
This completes step 1 of the solution. We have found and its associated and found and its
associated . Now we go to step 2 which is to find the .
step 2 Since we have a pole at zero, and we have one , each with signs, then we set up this
table to make it easier to work with. This implements Therefore we obtain 4 possible
values.
Hence the trial values which are not negative are For , since it shows in two rows, we take
the first row. Now we generate for each using To apply the above, we update the table
above, but we also add columns for to make the computation easier. Here is the new
table
The above gives two candidate value to try. For this we need to find polynomial by
solving If we are able to find , then we stop and the ode is solved. If we try all
candidate and can not find then this case is not successful and we go to the next
case.
step 3 Now for each candidate we solve the above Eq (8). Starting with associated
with first in the table, then (8) becomes
This needs to be solved for . Since degree of is . Let . The above becomes No unique
solution. Hence did not work. Now we try the second associated with . Substituting in 8
gives
Since , let Then becomes
Hence is solution. is arbitrary. Taking then Therefore the solution to is
The second solution can be found by reduction of order. The full general solution to
is
3.2.5 Example 5
Let Therefore
The necessary conditions for case 1 are met.
Step 1 In this we find all and associated for each pole. There is one pole at of order 2 and
one pole at of order 2. For the pole at since order is then
Where is the coefficient of in the partial fraction decomposition of given in Eq (2) which is
. Hence . Therefore
And for the pole at which is order 2,
Where is the coefficient of in the partial fraction decomposition of given in Eq (2) which is
. Hence . Therefore the above becomes
We are done with all the poles. Now we consider which is . Since then from the algorithm
above Now we calculate for this case. This is given by the leading coefficient of
divided by the leading coefficient of when . In this case from Eq (1) , hence .
Therefore
This completes step 1 of the solution. We have found and its associated and found and its
associated . Now we go to step 2 which is to find the .
step 2 Since we have a pole at and pole at , and we have one , each with signs. The
following now implements By trying all possible combinations. There are 8 possible values.
This gives
None of the found are integer. Hence case 1 did not work we need to try case 2 and if that
also fail, try case 3. We will find all three cases fail on this ode..
3.2.6 Example 6
Let Therefore The necessary conditions for case 1 are met since zero order pole and
.
Step 1 In this we find all and associated for each pole. There are no poles. In this case and .
Since , we are in case . Hence . Then now is the sum of all terms for in the Laurent series
expansion of at . Hence . And is the coefficient of in minus the coefficient of in . Hence .
Then
This completes step 1 of the solution. We have found and its associated and found and its
associated . Now we go to step 2 which is to find the .
step 2 Since we have a pole at zero and pole at , and we have one , each with signs, then we
set up this table to make it easier to work with. This implements Therefore we obtain 2
possible values.
Hence the trial values which are not negative integers are For , since it shows in two rows,
we take the first row. Now we generate for each using To apply the above, we update the
table above, but we also add columns for to make the computation easier. Here is the new
table
The above gives candidate value to try. For this we need to find polynomial by solving If
we are able to find , then we stop and the ode is solved.
step 3 Now for each candidate we solve the above Eq (8). Starting with associated with in
the table. Let since degree is zero, then (8) becomes
Hence is valid solution. Therefore the solution to is
The second solution can be found by reduction of order. The full general solution to
is
3.2.7 Example 7
Let Normalizing so that coefficient of is one gives
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 in (2) is given
by
Hence the DE we will solve using Kovacic algorithm is Eq (2) which is Therefore
The necessary conditions for case 1 are met.
Step 1 In this we find all and associated for each pole. There is one pole at of order 2 and
one pole at of order 2. For the pole at since order is then
Where is the coefficient of in the partial fraction decomposition of which is Hence .
Therefore
And for the pole at which is order 2,
Where is the coefficient of in the partial fraction decomposition of given in Eq (6). Hence .
Therefore the above becomes
We are done with all the poles. Now we consider which is . Since , we are in case . Hence .
Then now is the sum of all terms for in the Laurent series expansion of at which is We
want only terms for but Therefore only the constant term. Hence Which means As it is the
the term that matches . Hence and the coefficient of is zero. To find the coefficient of in
long division is done
Where is the quotient and is the remainder. This gives Since then the coefficient of in is
found using . This gives as seen from above. Hence . Therefore
This completes step 1 of the solution. We have found and its associated and found and its
associated . Now we go to step 2 which is to find the .
step 2 Since we have a pole at and pole at , and we have one , each with signs. The
following now implements By trying all possible combinations. There are 8 possible values.
This gives
Need to complete the solution next.
3.2.8 Example 8
Let Normalizing so that coefficient of is one gives
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 in (2) is given
by
Hence the DE we will solve using Kovacic algorithm is Eq (2) which is Therefore
The necessary conditions for case 1 are met.
Step 1 In this we find all and associated for each pole. There is one pole at of order 2 and
one pole at of order 2. For the pole at since order is then
Where is the coefficient of in the partial fraction decomposition of which is (in Maple this
can be found using fullparfrac. Hence . Therefore
And for the pole at which is order 2,
Where is the coefficient of in the partial fraction decomposition of given in Eq (6). Hence .
Therefore the above becomes
We are done with all the poles. Now we consider which is . Since , then . Now is the
coefficient of in minus coefficient of in which is zero. the coefficient of in is found from
which from Eq (5A) above is . Hence
This completes step 1 of the solution. We have found and its associated and found and its
associated . Now we go to step 2 which is to find the .
step 2 Since we have a pole at and pole at each of order 2, and we have one , each with
signs. The following now implements By trying all possible combinations. There are 8
possible values. This gives
Need to complete the solution next.
3.2.9 Example 9
Let Normalizing so that coefficient of is one gives
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 in (2) is given
by
Hence the DE we will solve using Kovacic algorithm is Eq (2) which is Therefore
The necessary conditions for case 1 are met.
Step 1 In this we find all and associated for each pole. There is one pole at of order 2.
Hence
Where is the coefficient of in the partial fraction decomposition of which is (in Maple this
can be found using fullparfrac). Hence . Therefore
We are done with all the poles. Now we consider which is . Since , we are in case . Hence
Then now is the sum of all terms for in the Laurent series expansion of at which is We
want only terms for but . Therefore only the constant term. Hence Which means As it is
the term that matches . Now we need to find . This will be the coefficient of in .
But . So coefficient of is zero in . To find the coefficient of in long division is
done
Where is the quotient and is the remainder. This gives Hence the coefficient of is .
Therefore . Hence
This completes step 1 of the solution. We have found and its associated and found and its
associated . Now we go to step 2 which is to find the .
step 2 Now is found using By trying all possible combinations. There are 4 possible values.
This gives
Using entry entry above now we find using Hence
If this fails to find , then we will try the entry . Which will give Will finish the solution
later.
3.2.10 Example 10
Let
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 in (2) is given
by
Hence the DE we will solve using Kovacic algorithm is Eq (2) which is Therefore
The necessary conditions for case 1 are met.
Step 1 In this we find all and associated for each pole. There are no poles. Hence set of
poles is empty. Now we consider which is . We are in case . Hence or Then now is
the sum of all terms for in the Laurent series expansion of at which is We
want only terms for but . Therefore need to sum terms . From the above we see
that
Which means As that is the term which matches . Now we need to find . This
will be the coefficient of in minus coefficient of in. But Hence the coefficient
is zero here. Now we find coefficient of in . But hence the coefficient of is .
Therefore
Hence
This completes step 1 of the solution. We have found and its associated and found and its
associated . Now we go to step 2 which is to find the .
step 2 Now is found using By trying all possible combinations. There are 4 possible values.
This gives
Using entry above now we find using Hence, since there are no poles, only last term above
survives giving Will finish the solution next.
3.2.11 Example 11
Let
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 in (2) is given
by
Hence the DE we will solve using Kovacic algorithm is Eq (2) which is Therefore
The necessary conditions for case 1 are met.
Step 1 In this we find all and associated for each pole. There are no poles. Hence
set of poles is empty. Now we consider which is . We are in case . Hence or
Then now is the sum of all terms for in the Laurent series expansion of at
which is We want only terms for but . Therefore need to sum terms . From the
above we see that Which means As it is the the term that matches . Now we
need to find . This will be the coefficient of in minus the coefficient of in . But
Hence the coefficient of is zero. Now we find coefficient of in . Since then coefficient of is .
Hence . Therefore
This completes step 1 of the solution. We have found and its associated and found and its
associated . Now we go to step 2 which is to find the .
step 2 Now is found using By trying all possible combinations. There are 2 possible values
since no poles.
Using entry above now we find using Hence, since there are no poles, only last term above
survives giving Will finish the solution next.
3.2.12 Example 12
Let
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 in (2) is given
by
Hence the DE we will solve using Kovacic algorithm is Eq (2) which is Therefore
The necessary conditions for case 1 are met.
Step 1 In this we find all and associated for each pole. There is one pole at of order 2.
Hence
Where is the coefficient of in the partial fraction decomposition of which is (in Maple this
can be found using fullparfrac). Hence . Therefore
Now we consider which is . We are in case . Hence or Then now is the sum of all terms
for in the Laurent series expansion of at which is We want only terms for but . Therefore
need to sum terms . From the above we see that Which means As it is the the term that
matches . Now we need to find . This will be the coefficient of in minus the coefficient of
in . But
Hence the coefficient is zero here. Now we find coefficient of in . Since then coefficient of is
zero also. Hence . Therefore
This completes step 1 of the solution. We have found and its associated and found and its
associated . Now we go to step 2 which is to find the .
step 2 Now is found using By trying all possible combinations. There are 4 possible values.
This gives
Using first entry above now we find using Hence Notice that if have taken the last entry,
we will get In practice, we will try the second one if the first fails. Will finish the solution
next.
3.2.13 Example 13
Let
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 in (2) is given
by
Hence the DE we will solve using Kovacic algorithm is Eq (2) which is Therefore
The necessary conditions for case 1 are met.
Step 1 In this we find all and associated for each pole. There is one pole at of order 2.
Hence
Where is the coefficient of in the partial fraction decomposition of which is Hence .
Therefore
Now we consider which is . We are in case . Hence or Then now is the sum of all terms
for in the Laurent series expansion of at which is But we want only terms for but .
Therefore need to sum terms . Which is the constant term Which means Now we need to
find . Which is given by the coefficient of in minus coefficient of in . But Hence the
coefficient is zero here. To find the coefficient of in long division is done (here paper is not
clear at all what it means by coefficient of in as that depends on the form of and how it is
represented). This method of using long division to find the coefficient works to
obtain the correct result. But it is still not clear what the paper actually means by
this.
Where is the quotient and is the remainder. This gives For the case of then the coefficient
of is . Notice that if we just expanded it will give and we see there is no coefficient of in
this representation. So we would have obtain wrong value of if we just used what the paper
said. Now . Therefore
This completes step 1 of the solution. We have found and its associated and found and its
associated . Now we go to step 2 which is to find the .
step 2 Now is found using By trying all possible combinations. There are 4 possible values.
This gives
Using first entry from above we find using Hence And if use the last entry then
In practice, we will try the second one if the first fails. Will finish the solution
next.
3.2.14 Example 14
Let
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 in (2) is given
by
Hence the DE we will solve using Kovacic algorithm is Eq (2) which is Therefore
The necessary conditions for case 1 are met.
Step 1 In this we find all and associated for each pole. There are no poles. Hence is
empty.
Now we consider which is . We are in case . Hence or Then now is the sum of all terms
for in the Laurent series expansion of at which is But we want only terms for but .
Therefore need to sum terms . Therefore Which means Now we need to find . Which is
given by the coefficient of or the constant term in minus coefficient of in . But . Hence the
coefficient of is zero here. Now we find coefficient of in . Since then the coefficient of is .
Hence . Therefore
This completes step 1 of the solution. We have found and its associated and found and its
associated . Now we go to step 2 which is to find the .
step 2 Now is found using By trying all possible combinations. There are 2 possible values
(since no poles). This gives
Using entry from above we find using Hence
3.2.15 Example 15
Let
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 in (2) is given
by
Hence the DE we will solve using Kovacic algorithm is Eq (2) which is Therefore
The necessary conditions for case 1 are met.
Step 1 In this we find all and associated for each pole. There are two poles at each of order
2. For pole at
Where is the coefficient of in the partial fraction decomposition of which is Hence .
Therefore
And for pole at
Now we consider which is . Therefore . In this case And The coefficient of is zero in . To
find coefficient of in and since then using gives . Hence . Therefore
This completes step 1 of the solution. We have found and its associated and found and its
associated . Now we go to step 2 which is to find the .
step 2 Now is found using By trying all possible combinations. There are 8 possible values.
These are
There are no integers. This means case 1 does not apply. We need to try case 2
now.