Timeline for Positive root of a polynomial
Current License: CC BY-SA 4.0
22 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
May 10, 2018 at 22:56 | comment | added | Abhishek Halder | @Suvrit: Thanks a lot. I just wanted to clarify that immediately after my first arxiv submission (which was hasty, I admit, should have figured out how to cite MO before doing that), I updated the manuscript with attribution. It is just that it took 4 days till Mar 28 for the updated arxiv version to appear. Anyway, I kept feeling uncomfortable with the glaring "without attribution" comment staying there for some time. Just my feeling. | |
May 10, 2018 at 21:55 | history | edited | Suvrit | CC BY-SA 4.0 |
updated.
|
May 10, 2018 at 21:53 | comment | added | Suvrit | @AbhishekHalder Please note the original omission to cite was yours, not mine. I just did not get a chance to update this answer since then, and since the comment thread below it completes the picture, the delay in 're-EDITING' is not too severe imo, hence you are not missing anything -- I am a little surprised at your somehwat aggressive comment though. | |
May 10, 2018 at 18:22 | comment | added | Abhishek Halder | @Suvrit: It has been 1.5 months since my last comment. Yet your post's EDIT does not reflect or acknowledge my attribution. What am I missing here? | |
Mar 28, 2018 at 3:49 | comment | added | Abhishek Halder | The updated version is now available: arxiv.org/abs/1803.08157 | |
Mar 24, 2018 at 14:01 | comment | added | Abhishek Halder | @Suvrit: Thanks for pointing that out. I have just updated the arxiv submission with an acknowledgement section with citations and MO link. Sorry it took a while to figure out how to cite MO in a paper. | |
Mar 23, 2018 at 14:01 | history | edited | Suvrit | CC BY-SA 3.0 |
fixed.
|
Mar 23, 2018 at 13:55 | comment | added | Suvrit | @GerryMyerson: Yes, indeed, FPI stands for fixed-point iteration (sorry for sloppy usage!) | |
Mar 23, 2018 at 6:20 | comment | added | Gerry Myerson | FPI stands for fixed-point iteration? | |
Mar 23, 2018 at 2:00 | history | edited | Suvrit | CC BY-SA 3.0 |
just bumping to the front...
|
Mar 23, 2018 at 1:58 | comment | added | Suvrit | @AbhishekHalder I saw that you wrote a preprint arxiv.org/pdf/1803.08157.pdf which seems to use the above FPI, but your preprint contains no link to MO nor any acknowledgment? am I missing something? | |
Aug 30, 2017 at 1:04 | comment | added | Suvrit | If I recall correctly, you can directly show it by choosing $x < y$ and computing $b(x)/a(x)- b(y)/a(y)$, which is rather close of course to computing derivatives. | |
Aug 29, 2017 at 23:39 | comment | added | Abhishek Halder | @Suvrit: I know it's bit late to ask, but do you recall how did you prove monotonicity without using differentiation? | |
Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
Jan 20, 2017 at 20:02 | history | edited | Suvrit | CC BY-SA 3.0 |
edited to note that the iteration shown is well-defined.
|
Jan 20, 2017 at 19:59 | comment | added | Suvrit | It seems an interesting exercise to prove monotonicity of the iteration that I wrote up there; by differentiating the map $b(x)/a(x)$ it is easy to verify for small $n$; the general case works out quite nicely without using differentiation, actually. I'll type up the details when I get some time! | |
Jan 20, 2017 at 7:38 | comment | added | Federico Poloni | @AbhishekHalder Since the rational equation has poles, it is easier to bracket the roots. | |
Jan 20, 2017 at 6:21 | history | edited | Suvrit | CC BY-SA 3.0 |
typo fix
|
Jan 20, 2017 at 6:07 | history | edited | Suvrit | CC BY-SA 3.0 |
Added an additional idea
|
Jan 20, 2017 at 5:44 | comment | added | Suvrit | Not really; I just wrote it back in this form as it seems more amenable to points (i) and (iii) above. | |
Jan 20, 2017 at 5:35 | comment | added | Abhishek Halder | any reason you would prefer numerically solving the rational equation rather than the polynomial? | |
Jan 20, 2017 at 5:06 | history | answered | Suvrit | CC BY-SA 3.0 |