Cauchy–Euler Equation

In mathematics, an Euler–Cauchy equation, or Cauchy–Euler equation, or simply Euler's equation is a linear homogeneous ordinary differential equation with variable coefficients. It is sometimes referred to as an '' equidimensional'' equation. Because of its particularly simple equidimensional structure, the differential equation can be solved explicitly.

The equation

Let be the ''n''th derivative of the unknown function . Then a Cauchy–Euler equation of order ''n'' has the form
$a_ x^n y^(x) + a_ x^ y^(x) + \dots + a_0 y(x) = 0.$

The substitution $x = e^u$ (that is, $u = \ln(x)$; for $x < 0$, one might replace all instances of $x$ by $, x,$, which extends the solution's domain to $R_0$) may be used to reduce this equation to a linear differential equation with constant coefficients. Alternatively, the trial solution $y = x^m$ may be used to directly solve for the basic solutions.

Second order – solving through trial solution

The most common Cauchy–Euler equation is the second-order equation, appearing in a number of physics and engineering applications, such as when solving Laplace's equation in polar coordinates. The second order Cauchy–Euler equation is

$x^2\frac + ax\frac + by = 0.$

We assume a trial solution $y = x^m.$

Differentiating gives $\frac = mx^$ and $\frac = m\left(m-1\right)x^.$

Substituting into the original equation leads to requiring
$x^2\left( m\left(m-1 \right)x^ \right) + ax\left( mx^ \right) + b\left( x^m \right) = 0$

Rearranging and factoring gives the indicial equation
$m^2 + \left(a-1\right)m + b = 0.$

We then solve for ''m''. There are three particular cases of interest:

* Case 1 of two distinct real roots, and ;
* Case 2 of one real repeated root, ;
* Case 3 of complex roots, .

In case 1, the solution is $y = c_1 x^ + c_2 x^$

In case 2, the solution is $y = c_1 x^m \ln(x) + c_2 x^m$

To get to this solution, the method of reduction of order must be applied after having found one solution .

In case 3, the solution is
$y = c_1 x^\alpha \cos(\beta \ln(x)) + c_2 x^\alpha \sin(\beta \ln(x))$
$\alpha = \operatorname(m)$
$\beta = \operatorname(m)$

For $c_1, c_2 \isin \R$.

This form of the solution is derived by setting and using Euler's formula

Second order – solution through change of variables

$x^2\frac +ax\frac + by = 0$

We operate the variable substitution defined by

$t = \ln(x).$
$y(x) = \varphi(\ln(x)) = \varphi(t).$
Differentiating gives
$\frac=\frac\frac$
$\frac=\frac\left(\frac-\frac\right).$

Substituting $\varphi(t)$ the differential equation becomes
$\frac + (a-1)\frac + b\varphi = 0.$

This equation in $\varphi(t)$ is solved via its characteristic polynomial
$\lambda^2 + (a-1)\lambda + b = 0.$

Now let $\lambda_1$ and $\lambda_2$ denote the two roots of this polynomial. We analyze the case where there are distinct roots and the case where there is a repeated root:

If the roots are distinct, the general solution is $\varphi(t)=c_1 e^ + c_2 e^,$ where the exponentials may be complex.

If the roots are equal, the general solution is $\varphi(t)=c_1 e^ + c_2 t e^.$

In both cases, the solution $y(x)$ may be found by setting $t = \ln(x)$.

Hence, in the first case, $y(x) = c_1 x^ + c_2 x^,$ and in the second case, $y(x) = c_1 x^ + c_2 \ln(x) x^.$

Example

Given

(2x+1)²y'' - 6(2x+1)y' + 16y =8(2x+1)²

we substitute the simple solution :
$x^2\left(m\left(m-1\right)x^\right)-3x\left(m x^\right) + 3x^m = m\left(m-1\right)x^m - 3m x^m+3x^m = \left(m^2 - 4m + 3\right)x^m = 0\,.$

For to be a solution, either , which gives the trivial solution, or the coefficient of is zero. Solving the quadratic equation, we get . The general solution is therefore

: $u=c_1 x+c_2 x^3\,.$

Difference equation analogue

There is a difference equation analogue to the Cauchy–Euler equation. For a fixed , define the sequence as
$f_m(n) := n (n+1) \cdots (n+m-1).$

Applying the difference operator to $f_m$, we find that
$\begin Df_m(n) & = f_(n+1) - f_m(n) \\ & = m(n+1)(n+2) \cdots (n+m-1) = \frac f_m(n). \end$

If we do this times, we find that
$\begin f_m^(n) & = \frac f_m(n) \\ & = m(m-1)\cdots(m-k+1) \frac, \end$

where the superscript denotes applying the difference operator times. Comparing this to the fact that the -th derivative of equals
$m(m-1) \cdots (m-k+1)\frac$
suggests that we can solve the ''N''-th order difference equation
$f_N(n) y^(n) + a_ f_(n) y^(n) + \cdots + a_0 y(n) = 0,$
in a similar manner to the differential equation case. Indeed, substituting the trial solution
$y(n) = f_m(n)$
brings us to the same situation as the differential equation case,
$m(m-1)\cdots(m-N+1) + a_ m(m-1) \cdots (m-N+2) + \dots + a_1 m + a_0 = 0.$

One may now proceed as in the differential equation case, since the general solution of an -th order linear difference equation is also the linear combination of linearly independent solutions. Applying reduction of order in case of a multiple root will yield expressions involving a discrete version of ,
$\varphi(n) = \sum_^n \frac.$

(Compare with: $\ln (x - m_1) = \int_^x \frac .$)

In cases where fractions become involved, one may use $f_m(n) := \frac$ instead (or simply use it in all cases), which coincides with the definition before for integer .

See also

* Hypergeometric differential equation
* Cauchy–Euler operator

References

Bibliography

*

{{DEFAULTSORT:Cauchy-Euler Equation
Ordinary differential equations