Related papers: Chebyshev polynomials and best rank-one approximat…
We consider a discrete best approximation problem formulated in the framework of tropical algebra, which deals with the theory and applications of algebraic systems with idempotent operations. Given a set of samples of input and output of…
It is well-known that tensor decompositions show separations, that is, that constraints on local terms (such as positivity) may entail an arbitrarily high cost in their representation. Here we show that many of these separations disappear…
We discuss the problem of finding optimal exponents in Diophantine estimates involving one real number and, in some cases where such an exponent is known, present some properties of the corresponding extremal numbers.
Chebyshev interpolation is a highly effective, intensively studied method and enjoys excellent numerical properties. The interpolation nodes are known beforehand, implementation is straightforward and the method is numerically stable. For…
Some new sufficient conditions for the weighted Chebyshev's inequality for real numbers to hold are provided.
In this paper we present the result of successively applying a Chebyshev polynomial to a continuous random variable. In particular we show that under mild assumptions the limiting distribution will be the same as the weight with respect to…
Given an ideal of forms in an algebra (polynomial ring, tensor algebra, exterior algebra, Lie algebra, bigraded polynomial ring), we consider the Hilbert series of the factor ring. We concentrate on the minimal Hilbert series, which is…
An optimal rank-1 approximation of state transition tensors was developed as an efficient alternative to state transition tensors for nonlinear uncertainty quantification. While previous directional state transition tensors used the…
We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials, and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves…
In this paper we give an explicit solution to the rank constrained matrix approximation in Frobenius norm, which is a generalization of the classical approximation of an m by n matrix A by a matrix of rank k at most.
An inverse polynomial has a Chebyshev series expansion 1/\sum(j=0..k)b_j*T_j(x)=\sum'(n=0..oo) a_n*T_n(x) if the polynomial has no roots in [-1,1]. If the inverse polynomial is decomposed into partial fractions, the a_n are linear…
For trigonometric series and series of Chebyshev polynomials, we defined trigonometric Hermite-Pad\'e and Hermite-Jacobi approximations, linear and nonlinear Hermite-Chebyshev approximations. We established criterion of the existence and…
Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…
Nowadays, low-rank approximations of matrices are an important component of many methods in science and engineering. Traditionally, low-rank approximations are considered in unitary invariant norms, however, recently element-wise…
We consider the unconstrained optimization of multivariate trigonometric polynomials by the sum-of-squares hierarchy of lower bounds. We first show a convergence rate of $O(1/s^2)$ for the relaxation with degree $s$ without any assumption…
The even and odd Zernike Polynomials R_n^m(x) can be expanded into sums of even and odd Chebyshev Polynomials T_i(x). This manuscript provides closed forms for the rational expansion coefficients c_{n,m,i} for a set of small 0 <= n-m <= 6…
It is proved the optimal conditioning for the infinity norm of collocation matrices of the tensor product of normalized B-bases among the tensor product of all normalized totally positive bases of the corresponding space of functions.…
Minimax and maximin problems are investigated for a special class of functions on the interval $[0,1]$. These functions are sums of translates of positive multiples of one kernel function and a very general external field function. Due to…
Functions like the exponential, Chebyshev polynomials, and monomial symmetric polynomials are preeminent among all special functions. They have simple definitions and can be expressed using easily specified integers like n!. Families of…
We study the solution set to multivariate Chebyshev approximation problem, focussing on the ill-posed case when the uniqueness of solutions can not be established via strict polynomial separation. We obtain an upper bound on the dimension…