0
$\begingroup$

Is there a known expression for the solution of the following simple equation, or at least good bounds on the solution? Assume $\epsilon \in [0,1)$ is a given parameter and $x \in (0,1)$.

$$x^{(1-\epsilon)/2}=1-x.$$

When $\epsilon=0$, we have a quadratic equation with explicit solution $x=(3-\sqrt{5})/2$.

$\endgroup$
11
  • $\begingroup$ So $x + x^\alpha - 1 = 0$ where $\alpha \in \left(0,\dfrac12\right]$? $\endgroup$
    – Kenny Lau
    Oct 11, 2017 at 18:53
  • $\begingroup$ Yes, that's right. $\endgroup$
    – MCH
    Oct 11, 2017 at 18:54
  • $\begingroup$ Experimentation shows that $f(a)$ is increasing is always in the interval $[0,f(0.5)]$ where $f(0.5)$ is the solution you calculated, namely $\dfrac{3-\sqrt5}2$. $\endgroup$
    – Kenny Lau
    Oct 11, 2017 at 19:12
  • 2
    $\begingroup$ What would you consider sharp enough? $\endgroup$ Oct 11, 2017 at 20:56
  • 1
    $\begingroup$ Similar question has already been asked here mathoverflow.net/questions/249060/… There is a series solution $\endgroup$
    – yarchik
    Oct 12, 2017 at 12:38

2 Answers 2

2
$\begingroup$

The function $g_e(x)=1-x^{(1-e)/2}$ is strictly decreasing on $[0,1]$ with $g_e(0)=1$ and $g_e(1)=0$, so there is a unique fixed point $h(e)$, and this is what we want to find. Put $x_0=h(0)=(3-\sqrt{5})/2$. Experiment makes it clear that $$ g_e(x_0) \leq g_e^3(x_0) \leq g_e^5(x_0) \leq \dotsb \leq h(e) \leq \dotsb \leq g_e^6(x_0) \leq g_e^4(x_0) \leq g_e^2(x_0) $$ for all $e$, and that $g_e^k(x_0)\to h(e)$ as $k\to\infty$. The above inequalities might or might not give bounds of the type that you need.

$\endgroup$
0
2
$\begingroup$

The minimax function in Maple's numapprox package gives this degree-$10$ polynomial approximation for the solution in $[0,1]$ of $x + x^\alpha = 1$ for $0 \le \alpha \le 1/2$, with maximum absolute error approximately $0.0009402242$:

$$0.0009400602+ 3.91194320\,\alpha- 77.4120170\,{\alpha}^{2}+ 1347.847663\,{\alpha}^{3}- 14566.47202\,{\alpha}^{4}+ 97487.90253\,{ \alpha}^{5}- 412006.0427\,{\alpha}^{6}+ 1100200.930\,{\alpha}^{7}- 1798435.690\,{\alpha}^{8}+ 1641636.824\,{\alpha}^{9}- 640721.0464\,{ \alpha}^{10} $$

EDIT: In view of Kenny Lau's comment, it might be better to allow half-integer powers. The following approximation has maximum absolute error approximately $0.0000307661$:

$$- 0.00003071092+ 0.028174589\, {\alpha^{1/2}}+ 5.33946514\,\alpha- 37.24787894\,{ \alpha}^{3/2}+ 211.7897251\,{\alpha}^{2}- 867.3432359\,{\alpha}^{5/2}+ 2385.793281\,{ \alpha}^{3}- 4267.365191\,{\alpha}^{7/2}+ 4745.954493\,{\alpha}^{4}- 2975.673043\,{\alpha} ^{9/2}+ 802.7705561\,{\alpha}^{5} $$

$\endgroup$
1
  • $\begingroup$ Thanks. But rather than a numerical approximation, I'm interested in explicit and clean upper and lower bounds that can be derived analytically. $\endgroup$
    – MCH
    Oct 12, 2017 at 10:50

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.