scholarly journals On the upper bound of the number of real zeros of a random algebraic polynomial

2012 ◽  
pp. 147-155
Author(s):  
Bijayini Nayak
2018 ◽  
Vol 5 (1) ◽  
pp. 936-942
Author(s):  
Dipty Rani Dhal ◽  
DR.Prasana Kumar Mishra

2004 ◽  
Vol 2004 (63) ◽  
pp. 3389-3395
Author(s):  
K. Farahmand ◽  
P. Flood

This paper provides an asymptotic estimate for the expected number of real zeros of a random algebraic polynomiala0+a1x+a2x2+⋯+an−1xn−1. The coefficientsaj(j=0,1,2,…,n−1)are assumed to be independent normal random variables with nonidentical means. Previous results are mainly for identically distributed coefficients. Our result remains valid when the means of the coefficients are divided into many groups of equal sizes. We show that the behaviour of the random polynomial is dictated by the mean of the first group of the coefficients in the interval(−1,1)and the mean of the last group in(−∞,−1)∪(1,∞).


2000 ◽  
Vol 7 (2) ◽  
pp. 379-386 ◽  
Author(s):  
S. Rezakhah ◽  
A. R. Soltani

Abstract Assuming (A 0, A 1, . . . , An ) is a jointly symmetric α-stable random vector, 0 < α ≤ 2, a general formula for the expected number of real zeros of the random algebraic polynomial was obtained by Rezakhah in 1997. Rezakhah's formula is applied to the case where (A 0, . . . , An ) is formed by consecutive observations from the Lévy stable noise or from certain harmonizable stable processes, and more explicit formulas are derived for the expected number of real zeros of .


2009 ◽  
Vol 2009 ◽  
pp. 1-6 ◽  
Author(s):  
K. Farahmand ◽  
M. Sambandham

The expected number of real zeros of an algebraic polynomial with random coefficient is known. The distribution of the coefficients is often assumed to be identical albeit allowed to have different classes of distributions. For the nonidentical case, there has been much interest where the variance of the th coefficient is . It is shown that this class of polynomials has significantly more zeros than the classical algebraic polynomials with identical coefficients. However, in the case of nonidentically distributed coefficients it is analytically necessary to assume that the means of coefficients are zero. In this work we study a case when the moments of the coefficients have both binomial and geometric progression elements. That is we assume and . We show how the above expected number of real zeros is dependent on values of and in various cases.


2006 ◽  
Vol 2006 ◽  
pp. 1-6 ◽  
Author(s):  
A. Nezakati ◽  
K. Farahmand

This paper provides an asymptotic estimate for the expected number of real zeros of a random algebraic polynomial a0+a1x+a2x2+…+an−1xn−1. The coefficients aj(j=0,1,2,…,n−1) are assumed to be independent normal random variables with mean zero. For integers m and k=O(log⁡n)2 the variances of the coefficients are assumed to have nonidentical value var⁡(aj)=(k−1j−ik), where n=k⋅m and i=0,1,2,…,m−1. Previous results are mainly for identically distributed coefficients or when var⁡(aj)=(nj). We show that the latter is a special case of our general theorem.


2003 ◽  
Vol 16 (3) ◽  
pp. 249-255 ◽  
Author(s):  
K. Farahmand ◽  
M. Sambandham

There are many known asymptotic estimates for the expected number of real zeros of an algebraic polynomial a0+a1x+a2x2+⋯+an−1xn−1 with identically distributed random coefficients. Under different assumptions for the distribution of the coefficients {aj}j=0n−1 it is shown that the above expected number is asymptotic to O(logn). This order for the expected number of zeros remains valid for the case when the coefficients are grouped into two, each group with a different variance. However, it was recently shown that if the coefficients are non-identically distributed such that the variance of the jth term is (nj) the expected number of zeros of the polynomial increases to O(n). The present paper provides the value for this asymptotic formula for the polynomials with the latter variances when they are grouped into three with different patterns for their variances.


1990 ◽  
Vol 42 (2) ◽  
pp. 253-266 ◽  
Author(s):  
Jia-Ding Cao ◽  
Heinz H. Gonska

In the present note we study the question: “Under which general conditions do certain Boolean sums of linear operators satisfy Telyakovskiǐ-type estimates?” It is shown, in particular, that any sequence of linear algebraic polynomial operators satisfying a Timan-type inequality can be modified appropriately so as to obtain the corresponding upper bound of the Telyakovskiǐ-type. Several examples are included.


Author(s):  
Mina Ketan Mahanti ◽  
Amandeep Singh ◽  
Lokanath Sahoo

We have proved here that the expected number of real zeros of a random hyperbolic polynomial of the formy=Pnt=n1a1cosh⁡t+n2a2cosh⁡2t+⋯+nnancosh⁡nt, wherea1,…,anis a sequence of standard Gaussian random variables, isn/2+op(1). It is shown that the asymptotic value of expected number of times the polynomial crosses the levely=Kis alson/2as long asKdoes not exceed2neμ(n), whereμ(n)=o(n). The number of oscillations ofPn(t)abouty=Kwill be less thann/2asymptotically only ifK=2neμ(n), whereμ(n)=O(n)orn-1μ(n)→∞. In the former case the number of oscillations continues to be a fraction ofnand decreases with the increase in value ofμ(n). In the latter case, the number of oscillations reduces toop(n)and almost no trace of the curve is expected to be present above the levely=Kifμ(n)/(nlogn)→∞.


Sign in / Sign up

Export Citation Format

Share Document