Related papers: The multivariate integer Chebyshev problem
A symmetric characteristic singular integral equation with two fixed singularities at the endpoints in the class of functions bounded at the ends is analyzed. It reduces to a vector Hilbert problem for a half-disc and then to a vector…
We show that product Chebyshev polynomial meshes can be used, in a fully discrete way, to evaluate with rigorous error bounds the Lebesgue constant, i.e. the maximum of the Lebesgue function, for a class of polynomial projectors on cube,…
We construct admissible polynomial meshes on piecewise polynomial or trigonometric curves of the complex plane, by mapping univariate Chebyshev points. Such meshes can be used for polynomial least-squares, for the extraction of Fekete-like…
We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…
In this paper, we consider the problem of finding a maximum cardinality subset of vectors, given a constraint on the normalized squared length of vectors sum. This problem is closely related to Problem 1 from (Eremeev, Kel'manov, Pyatkin,…
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…
In this paper, we establish a new estimate (including lower and upper bounds) for an important quantity involved in the convergence analysis of smoothed aggregation algebraic multigrid methods. The new upper bound improves the existing…
The purpose of this article is to study the relationship between numerical invariants of certain subspace arrangements coming from reflection groups and numerical invariants arising in the representation theory of Cherednik algebras. For…
For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…
The problem of replacing an integral norm with respect to a given probability measure by the corresponding integral norm with respect to a discrete measure is discussed in the paper. The above problem is studied for elements of finite…
We give upper and lower bounds for weighted Chebyshev and residual polynomials on subsets of the real line. As an application, we prove a Szeg\H{o}-type theorem in the setting of Parreau--Widom sets.
The aim of the present work is to introduce a method based on Chebyshev polynomials for the numerical solution of a system of Cauchy type singular integral equations of the first kind on a finite segment. Moreover, an estimation error is…
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…
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…
In this paper, we give a practical method to compute the Jacobian matrices of generalized Chebyshev polynomials associated to arbitrary semisimple Lie algebras. The entries of each Jacobian matrix can be expressed as a linear combination of…
Using Chebyshev polynomialsof both kinds, we construct rational fractions which are convergents of the smallest root of $x^2-\alpha x+1$ for $\alpha=3,4,5,\dots$.Some of the underlying identities suggest an identity involving…
In this paper we evaluate Chebyshev polynomials of the second-kind on a class of symmetric integer matrices, namely on adjacency matrices of simply laced Dynkin and extended Dynkin diagrams. As an application of these results we explicitly…
We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…
We present numerical solutions for differential equations by expanding the unknown function in terms of Chebyshev polynomials and solving a system of linear equations directly for the values of the function at the extrema (or zeros) of the…
Our objective in this paper is to introduce and investigate a newly-constructed subclass of normalized analytic and bi-univalent functions by means of the Chebyshev polynomials of the second kind. Upper bounds for the second and third…