Find the roots of $e^x+e^{1/x} + a = 0$

513 Views Asked by At

Find the roots of this equation

$e^x + e^{1/x} + a = 0$

where $a \in \Bbb R$

Is there any nice formula for this type of equation?

1

There are 1 best solutions below

0
On

An actual analytical solution will not happen here. An analytical approximation can be given as follows.

For large enough negative $a$, there are two roots, each reciprocals of each other. One is large and positive, the other is small and positive. The large and positive one can be approximated:

$$x=\ln(-a-e^{1/x})=\ln(-a)+\ln(1+e^{1/x}/a) \approx \ln(-a)+e^{1/x}/a \approx \ln(-a)+1/a+1/(ax).$$

In the first step we Taylor expanded the logarithm, committing an error on the order of $(e^{1/x}/a)^2$. In the second step we Taylor expanded the exponential, committing an error on the order of $(1/x)^2/a$.

Running with this, we get a quadratic equation, and the solution which is consistent with the approximations we just made is

$$\frac{\ln(-a)+1/a+\sqrt{(\ln(-a)+1/a)^2+4/a}}{2}.$$

The square root can be linearly approximated to give

$$\ln(-a)+1/a+\frac{1}{a\ln(-a)+1}.$$

This is a pretty good approximation, judging by numerical evidence. Heuristically it should be a pretty good approximation, because above we made errors on the order of at most $1/(a \ln(-a)^2)$ on the right side, then we multiplied both sides by $x$ which is on the order of $\ln(-a)$. So the overall error in the solution to the quadratic should be on the order of $1/(a \ln(-a))$. The error in the last step turns out to be smaller than the others, so the overall error in the final approximation should be on the order of $1/(a \ln(-a))$. (In particular, the last term is not really "significant", according to these error estimates; in terms of order of errors, we would've been just as good without including the $1/(ax)$ term. Still, that term actually does reduce the error a little bit in numerical tests.)

Higher order approximations will become quite cumbersome, if we proceed by this approach. But still, it seems that you can readily achieve convergence of numerical methods by beginning with this asymptotic as your initial guess.