News for hackers. Stuff that matters.
Re:Is the largest root of a random polynomial more likely to... by chongli on Friday May 10, 2024 @07:20AM (#40317606)
Did you read the post? The researcher is specifically using a numerical approach. Generating lots of random polynomials with coefficients in uniform (-1,1) and then numerically finding the largest root.
Re:Is the largest root of a random polynomial more likely to... by vouaobrasil on Friday May 10, 2024 @07:23AM (#40317636)
Hi, I read the post. The numerical approach gives the data. But the proof of the result uses analysis. I was talking about the proof. Thanks.
Re:Is the largest root of a random polynomial more likely to... by lupire on Friday May 10, 2024 @11:33AM (#40320199)
The roots of a polynomial vary smoothly as the coefficients vary. This is intuitively obvious. This is an important part of Abel's proof of the unsolvability of the quinitic. The probability of a random number being ambiguously real or complex has measure 0 (measure < epsilon, for all epsilon > 0), so you can ignore all computationally ambiguous cases. You don't need an exact calculation of any specific polynomial's root, to get the right answer of the measurement over all polynomials.