Timeline for asymptotics of the largest real root
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 10, 2016 at 1:02 | history | edited | T. Amdeberhan | CC BY-SA 3.0 |
edited body
|
| Nov 10, 2016 at 0:49 | history | edited | T. Amdeberhan | CC BY-SA 3.0 |
added 160 characters in body
|
| Nov 10, 2016 at 0:43 | comment | added | Alexandre Eremenko | Very much depends on the exact nature of your "recurrence relation". Be more specific. | |
| Nov 10, 2016 at 0:42 | comment | added | Alexandre Eremenko | @Per Alexanderson: largest root is a more subtle thing then the "root distributon". By root distribution they usually understand a probablity measure (what draction of the roots lie on an interval) and it is not sensitive to a single root. | |
| Nov 10, 2016 at 0:28 | comment | added | Liviu Nicolaescu | Can you elaborate on your statement $a_k^{(n)}$ are recursively related to the $a_j^{(n-1)}$? There are infinitely many possible recursive relations and you cannot expect to deal with all of them in the same fashion. | |
| Nov 10, 2016 at 0:26 | comment | added | Per Alexandersson | Depends on how the coefficients are related, but sometimes, one can find the root distribution in the limit, and thus the largest root, ncbi.nlm.nih.gov/pmc/articles/PMC388687 | |
| Nov 10, 2016 at 0:17 | history | asked | T. Amdeberhan | CC BY-SA 3.0 |