Detailed description of Kovacic algorithm for solving second order linear ode with rational coefficients is given with many solved examples showing how the algorithm works step by step.
The algorithm is first described based on Kovacic original 1985 paper (1) and later described in separate section based on modified Saunders/Smith algorithm in papers (2,3). The same ode examples are solved using both algorithms to show the difference.
Given the ode
It is transformed to the following ode by eliminating the first derivative
Before describing how the algorithm works, there are necessary (but not sufficient) conditions that should be checked to determine which case of the above the ode satisfies.
The following are the necessary conditions for each case. To check each case, let
For an example, if
The poles of
Knowing these two pieces of information is all what is needed to determine the necessary conditions for each case. The necessary conditions for each case are the following
If the conditions are not satisfied then there is no need to try that specific case as there will be no solution. However if the conditions are satisfied, this does not necessarily mean a solution exists for that case. This is what necessary but not sufficient conditions means.
The following table summarizes the above conditions and the possible
Case |
Allowed pole order for |
Allowed value for |
1 |
|
|
2 |
Need to have at least one pole
that is either order |
no condition |
3 |
|
|
Some observations: In case one no odd order pole is allowed except for order 1. And for case
3, only poles of order 1,2 are allowed. If
The following are examples to help understand these conditions. Notice that if a pole is of
order 2 and