Timeline for Bounds on the smallest real positive root of a polynomial
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2018 at 12:20 | comment | added | Iddo Hanniel | @Amir, a lower bound $x$ on the larger root of $Q(x)$ will give you an upper bound $1/x$ on the lower root. Since $Q(x)$ is also convex to the right of its extremum, you can bound it from below using the false position method and get a series of tighter bounds. | |
| May 23, 2018 at 7:59 | comment | added | Pietro Majer | Note there is a power series solution (after reduction of the equation to the form $x+x^s=c$, with possibly noninteger $s$ and small $c$) mathoverflow.net/questions/249060/… | |
| May 23, 2018 at 6:54 | comment | added | Amir Sagiv | Iddo thanks! Will these method yield an upper bound on the lower root? Obviously, $x_d$ is a bound, but can we do better? | |
| May 22, 2018 at 21:37 | history | edited | Iddo Hanniel | CC BY-SA 4.0 |
added 7 characters in body
|
| May 22, 2018 at 18:29 | history | answered | Iddo Hanniel | CC BY-SA 4.0 |