Displaying 2141 – 2160 of 2610

Showing per page

The multiplicity of the zero at 1 of polynomials with constrained coefficients

Peter Borwein, Tamás Erdélyi, Géza Kós (2013)

Acta Arithmetica

For n ∈ ℕ, L > 0, and p ≥ 1 let κ p ( n , L ) be the largest possible value of k for which there is a polynomial P ≠ 0 of the form P ( x ) = j = 0 n a j x j , | a 0 | L ( j = 1 n | a j | p 1/p , aj ∈ ℂ , such that ( x - 1 ) k divides P(x). For n ∈ ℕ and L > 0 let κ ( n , L ) be the largest possible value of k for which there is a polynomial P ≠ 0 of the form P ( x ) = j = 0 n a j x j , | a 0 | L m a x 1 j n | a j | , a j , such that ( x - 1 ) k divides P(x). We prove that there are absolute constants c₁ > 0 and c₂ > 0 such that c 1 ( n / L ) - 1 κ ( n , L ) c 2 ( n / L ) for every L ≥ 1. This complements an earlier result of the authors valid for every n ∈ ℕ and L ∈ (0,1]. Essentially...

The norm of the polynomial truncation operator on the unit disk and on [-1,1]

Tamás Erdélyi (2001)

Colloquium Mathematicae

Let D and ∂D denote the open unit disk and the unit circle of the complex plane, respectively. We denote by ₙ (resp. c ) the set of all polynomials of degree at most n with real (resp. complex) coefficients. We define the truncation operators Sₙ for polynomials P c of the form P ( z ) : = j = 0 n a j z j , a j C , by S ( P ) ( z ) : = j = 0 n a ̃ j z j , a ̃ j : = a j | a j | m i n | a j | , 1 (here 0/0 is interpreted as 1). We define the norms of the truncation operators by S , D r e a l : = s u p P ( m a x z D | S ( P ) ( z ) | ) / ( m a x z D | P ( z ) | ) , S , D c o m p : = s u p P c ( m a x z D | S ( P ) ( z ) | ) / ( m a x z D | P ( z ) | . Our main theorem establishes the right order of magnitude of the above norms: there is an absolute constant c₁ > 0 such...

The Rate of Convergence for Linear Shape-Preserving Algorithms

Dmitry Boytsov, Sergei Sidorov (2015)

Concrete Operators

We prove some results which give explicit methods for determining an upper bound for the rate of approximation by means of operators preserving a cone. Thenwe obtain some quantitative results on the rate of convergence for some sequences of linear shape-preserving operators.

The Schwarz-Pick theorem and its applications

M. Qazi, Q. Rahman (2011)

Annales UMCS, Mathematica

Various derivative estimates for functions of exponential type in a half-plane are proved in this paper. The reader will also find a related result about functions analytic in a quadrant. In addition, the paper contains a result about functions analytic in a strip. Our main tool in this study is the Schwarz-Pick theorem from the geometric theory of functions. We also use the Phragmén-Lindelöf principle, which is of course standard in such situations.

The sharpness of convergence results for q -Bernstein polynomials in the case q > 1

Sofiya Ostrovska (2008)

Czechoslovak Mathematical Journal

Due to the fact that in the case q > 1 the q -Bernstein polynomials are no longer positive linear operators on C [ 0 , 1 ] , the study of their convergence properties turns out to be essentially more difficult than that for q < 1 . In this paper, new saturation theorems related to the convergence of q -Bernstein polynomials in the case q > 1 are proved.

Currently displaying 2141 – 2160 of 2610