Cauchy-Euler equation
From Wikipedia, the free encyclopedia
In mathematics, a Cauchy-Euler equation (also Euler-Cauchy equation) is a linear homogeneous ordinary differential equation with variable coefficients. They are sometimes known as equi-dimensional equations. Because of its simple structure the equation can be replaced with an equivalent equation with constant coefficients which can then be solved explicitly.
Contents |
[edit] The equation
Let y(n)(x) be the nth derivative of the unknown function y(x). Then a Cauchy-Euler equation of order n has the form
The substitution reduces this equation to a linear differential equation with constant coefficients.
[edit] Second order
The Euler-Cauchy equation crops up in a number of engineering applications. It is given by the equation:
We assume a trial solution given by
Differentiating, we have:
and
Substituting into the original equation, we have:
Or rearranging gives:
We then can solve for m. There are three particular cases of interest:
- Case #1: Two distinct roots, m1 and m2
- Case #2: One real repeated root, m
- Case #3: Complex roots, α ± iβ
In case #1, the solution is given by:
In case #2, the solution is given by:
To get to this solution, the method of reduction of order must be applied after having found one solution y = xm.
In case #3, the solution is given by:
This equation also can be solved with x = et transformation.
This particular case is of no great practical importance and hence this has been left as a challenge for the reader.
[edit] Example
Given
we substitute the simple solution xα:
For this to indeed be a solution, either x=0 giving the trivial solution, or the coefficient of xα is zero, so solving that quadratic, we get α=1,3. So, the general solution is
[edit] Difference equation analogue
There is a difference equation analogue to the Cauchy–Euler equation. For a fixed m > 0, define the sequence fm(n) as
Applying the difference operator to fm, we find that
If we do this k times, we will find that
where the superscript (k) denotes applying the difference operator k times. Comparing this to the fact that the k-th derivative of xm equals suggests that we can solve the N-th order difference equation
in a similar manner to the differential equation case. Indeed, substituting the trial solution
- y(n) = fm(n)
brings us to the same situation as the differential equation case,
One may now proceed as in the differential equation case, since the general solution of an N-th order linear difference equation is also the linear combination of N linearly independent solutions. Applying reduction of order in case of a multiple root m1 will yield expressions involving a discrete version of ln,
(Compare with: )
In cases where fractions become involved, one may use
instead (or simply use it in all cases), which coincides with the definition before for integer m.