Abstract
In this article we study the probability that the maximum over a symmetric interval [−a, a] of a univariate polynomial of degree at most n is attained at an endpoint. We give explicit formulas for the degree n = 1, 2,3 cases. The formula for the degree 3 case leads to a lower bound for the true probability. Numerical experiments indicate that this lower bound is actually quite a good approximation. We finish with some numerical examples indicating that these ideas may be of use in the problem of finding average Markov factors for the bounds of the uniform norm of the derivative a polynomial in terms of the norm of the polynomial itself.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Benko and V. Totik, Sets with interior extremal points for the Markoff inequality, J. Approx. Theory, 110 (2001), 261–265.
L. Bos, Markov factors on average — an L2 case, J. Approx. Theory, 241 (2019), 1–10.
L. Bos, Markov factors on average — an L∞ case, J. Approx. Theory, 247 (2019), 20–31.
P. Craig, A new reconstruction of multivariate normal orthant probabilities, J. R. Stat. Soc. Ser. B Stat. Methodol., 70 (2008), 227–243.
A. Edelman and E. Kostlan, How many zeros of a random polynomial are real?, Bull. Amer. Math. Soc., 32 (1995), 1–37.
T. Koyama and A. Takemura, Calculation of orthant probabilities by the holonomic gradient method, Jpn. J. Ind. Appl. Math., 32 (2015), 187–204.
N. Nomura, Evaluation of Gaussian orthant probabilities based on orthogonal projections to subspaces, Stat. Comput., 26 (2016), 187–197.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bos, L., Ware, T. On the probability that the maximum of a polynomial is at an endpoint of an interval. Anal Math 46, 667–698 (2020). https://doi.org/10.1007/s10476-020-0041-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10476-020-0041-y