Related papers: Chebyshev polynomials and best rank-one approximat…
Chebyshev polynomials of the first and second kind for a set K are monic polynomials with minimal L $\infty$-and L 1-norm on K, respectively. This articles presents numerical procedures based on semidefinite programming to compute these…
In this work, considering a general subclass of bi-univalent functions and using the Chebyshev polynomials, we obtain coefficient expansions for functions in this class.
We characterize optimal rank-1 matrix approximations with Hankel or Toeplitz structure with regard to two different norms, the Frobenius norm and the spectral norm, in a new way. More precisely, we show that these rank-1 matrix…
We announce some new results on the convergence of Chebyshev--Pad\'e approximations to real-valued algebraic function given on the segment $[-1,1]$. The rate of convergence on the segment and in the corresponding maximal domain of…
In this article, we derive a new generalization of Chebyshev inequality for random vectors. We demonstrate that the new generalization is much less conservative than the classical generalization.
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine that criterion in order to be able to give an explicit sufficient condition for a non-redundant decomposition of a tensor to be minimal and…
Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We provide improved lower bounds for the rank of a symmetric…
We first give a combinatorial interpretation of coefficients of Chebyshev polynomials, which allows us to connect them with compositions of natural numbers. Then we describe a relationship between the number of compositions of a natural…
A new necessary and sufficient stability test in a tractable number of operations for linear neutral-type delay systems is introduced. It is developed in the Lyapunov-Krasovskii framework via functionals with prescribed derivatives. The…
We expand the Chebyshev polynomials and some of its linear combination in linear combinations of the q-Hermite, the Rogers (q-utraspherical) and the Al-Salam--Chihara polynomials and vice versa. We use these expansions to obtain expansions…
In this work we study different notions of ranks and approximation of tensors. We consider the tensor rank, the nuclear rank and we introduce the notion of symmetric decomposable rank, a notion of rank defined only on symmetric tensors. We…
In this paper we obtain some statements concerning ideals of polynomials and apply these results in a number of different situations. Among other results, we present new characterizations of $\mathcal{L}_{\infty}$-spaces, Coincidence…
The canonical polyadic decomposition (CPD) of a low rank tensor plays a major role in data analysis and signal processing by allowing for unique recovery of underlying factors. However, it is well known that the low rank CPD approximation…
We compare the convergence behavior of best polynomial approximations and Legendre and Chebyshev projections and derive optimal rates of convergence of Legendre projections for analytic and differentiable functions in the maximum norm. For…
We study the problem of finding orthogonal low-rank approximations of symmetric tensors. In the case of matrices, the approximation is a truncated singular value decomposition which is then symmetric. Moreover, for rank-one approximations…
In this paper, we are concerned with the convergence rate of a FEM based numerical scheme approximating extremal functions of the Sobolev inequality. We prove that when the domain is polygonal and convex in $\R^2$, the convergence of a…
In this paper, we give a sharp lower bound for the minimum deviation of the Chebyshev polynomial on a compact subset of the real line in terms of the corresponding logarithmic capacity. Especially if the set is the union of several real…
It is shown that some q-analogues of the Fibonacci and Lucas polynomials lead to q-analogues of the Chebyshev polynomials which retain most of their elementary properties.
We obtain the best approximation in $L^1(\R)$, by entire functions of exponential type, for a class of even functions that includes $e^{-\lambda|x|}$, where $\lambda >0$, $\log |x|$ and $|x|^{\alpha}$, where $-1 < \alpha < 1$. We also give…
The existence of extremal functions for the Sobolev trace inequalities is studied using the concentration compactness theorem. The conjectured extremal, the function of conformal factor, is considered and is proved to be an actual extremal…