Related papers: Monic integer Chebyshev problem

We develop the notion of higher Cheeger constants for a measurable set $\Omega \subset \mathbb{R}^N$. By the $k$-th Cheeger constant we mean the value \[h_k(\Omega) = \inf \max \{h_1(E_1), \dots, h_1(E_k)\},\] where the infimum is taken…

We investigate the weighted Bojanov-Chebyshev extremal problem for trigonometric polynomials, that is, the minimax problem of minimizing $\|T\|_{w,C({\mathbb T})}$, where $w$ is a sufficiently nonvanishing, upper bounded, nonnegative weight…

The estimates of the uniform norm of the Chebyshev polynomial associated with a compact set $K$ consisting of a finite number of continua in the complex plane are established. These estimates are exact (up to a constant factor) in the case…

We employ the generalized Remez algorithm, initially suggested by P. T. P. Tang, to perform an experimental study of Chebyshev polynomials in the complex plane. Our focus lies particularly on the examination of their norms and zeros. What…

A class P_{n,m,p}(x) of polynomials is defined. The combinatorial meaning of its coefficients is given. Chebyshev polynomials are the special cases of P_{n,m,p}(x). It is first shown that P_{n,m,p}(x) may be expressed in terms of…

Let $p(z)$ be a monic polynomial of degree $n$, with complex coefficients, and let $q(z)$ be its monic factor. We prove an asymptotically sharp inequality of the form $\|q\|_{E} \le C^n \|p\|_E$, where $\|\cdot\|_E$ denotes the sup norm on…

Approximating a univariate function on the interval $[-1,1]$ with a polynomial is among the most classical problems in numerical analysis. When the function evaluations come with noise, a least-squares fit is known to reduce the effect of…

The discrete Chebyshev polynomials $t_n(x,N)$ are orthogonal with respect to a distribution, which is a step function with jumps one unit at the points $x=0,1,\cdots, N-1$, $N$ being a fixed positive integer. By using a double integral…

We present a survey of central developments in the theory of Chebyshev polynomials, introduced by P.~L.~Chebyshev and later extended to the complex plane by G.~Faber. Our primary focus is their defining extremal property: among all…

We investigate an infinite sequence of polynomials of the form: \[a_0T_{n}(x)+a_{1}T_{n-1}(x)+\cdots+a_{m}T_{n-m}(x)\] where $(a_0,a_1,\ldots,a_m)$ is a fixed m-tuple of real numbers, $a_0,a_m\ne0$, $T_i(x)$ are Chebyshev polynomials of the…

The estimates of the uniform norm of the Chebyshev polynomials associated with a compact set $K$ in the complex plane are established. These estimates are exact (up to a constant factor) in the case where $K$ consists of a finite number of…

We consider the problem of estimating the support size of a discrete distribution whose minimum non-zero mass is at least $ \frac{1}{k}$. Under the independent sampling model, we show that the sample complexity, i.e., the minimal sample…

Approximation theorem is one of the most important aspects of numerical analysis that has evolved over the years with many different approaches. Some of the most popular approximation methods include the Lebesgue approximation theorem, the…

We consider the classical problem of estimating norms of higher order derivatives of algebraic polynomial via the norms of polynomial itself. The corresponding extremal problem for general polynomials in uniform norm was solved by A. A.…

For $0<\alpha<1$, we study the zeros of the sequence of polynomials $\left\{ P_{m}(z)\right\} _{m=0}^{\infty}$ generated by the reciprocal of $(1-t)^{\alpha}(1-2zt+t^{2})$, expanded as a power series in $t$. Equivalently, this sequence is…

We introduce and study the unconstrained polarization (or Chebyshev) problem which requires to find an $N$-point configuration that maximizes the minimum value of its potential over a set $A$ in $p$-dimensional Euclidean space. This problem…

Let an algebraic polynomial $P_n(\zeta)$ of degree $n$ be such that $|P_n(\zeta)|\le 1$ for $\zeta\in E\subset\mathbb{T}$ and $|E|\ge 2\pi -s$. We prove the sharp Remez inequality $$ \sup_{\zeta\in\mathbb{T}}|P_n(\zeta)|\le…

A new Chebyshev-type family of stabilized explicit methods for solving mildly stiff ODEs is presented. Besides conventional conditions of order and stability we impose an additional restriction on the methods: their stability function must…

We prove that $$\max_{t \in [-\pi,\pi]}{|Q(t)|} \leq T_{2n}(\sec(s/4)) = \frac 12 ((\sec(s/4) + \tan(s/4))^{2n} + (\sec(s/4) - \tan(s/4))^{2n})$$ for every even trigonometric polynomial $Q$ of degree at most $n$ with complex coefficients…

In computational practice, we often encounter situations where only measurements at equally spaced points are available. Using standard polynomial interpolation in such cases can lead to highly inaccurate results due to numerical…