In this paper, some results of the Chebyshev type integral inequality for the pseudo-integral are proven. The obtained results, are related to the measure of a level set of the maximum and the sum of two non-negative integrable functions. Finally, we applied our results  to the case of comonotone functions.

We study the rate-distortion relationship in the set of permutations endowed with the Kendall τ-metric and the Chebyshev metric. Our study is motivated by the application of permutation rate-distortion to the average-case and worst-case analysis of algorithms for ranking with incomplete information and approximate sorting algorithms. For the Kendall τ-metric we provide bounds for small, medium,...

Interpolation polynomial pn at the Chebyshev nodes cosπj/n (0 ≤ j ≤ n) for smooth functions is known to converge fast as n → ∞. The sequence {pn} is constructed recursively and efficiently in O(n log2 n) flops for each pn by using the FFT, where n is increased geometrically, n = 2i (i = 2, 3, . . . ), until an estimated error is within a given tolerance of ε. This sequence {2j}, however, grows ...

This paper establishes a direct method for solving variational problems via a set of Radial basis functions (RBFs) with Gauss-Chebyshev collocation centers. The method consist of reducing a variational problem into a mathematical programming problem. The authors use some optimization techniques to solve the reduced problem. Accuracy and stability of the multiquadric, Gaussian and inverse multiq...

A simple strategy for constructing a sequence of increasingly refined interpolation grids over the triangle or the tetrahedron is discussed with the goal of achieving uniform convergence and ensuring high interpolation accuracy. The interpolation nodes are generated based on a one-dimensional master grid comprised of the zeros of the Lobatto, Legendre, Chebyshev, and second-kind Chebyshev polyn...

in this paper, a chebyshev finite difference method has been proposed in order to solvenonlinear two-point boundary value problems for second order nonlinear differentialequations. a problem arising from chemical reactor theory is then considered. the approachconsists of reducing the problem to a set of algebraic equations. this method can be regardedas a non-uniform finite difference scheme. t...

A closed set of a Euclidean space is said to be Chebyshev if every point in the space has one and only one closest point in the set. Although the situation is not settled in infinite-dimensional Hilbert spaces, in 1932 Bunt showed that in Euclidean spaces a closed set is Chebyshev if and only if the set is convex. In this paper, from the more general perspective of Bregman distances, we show th...

The main purpose of this paper is to consider the new kind of approximation which is called as t-best coapproximation in fuzzy n-normed spaces. The set of all t-best coapproximation define the t-coproximinal, t-co-Chebyshev and F-best coapproximation and then prove several theorems pertaining to this sets. Keywords—Fuzzy-n-normed space, best coapproximation, co-proximinal, co-Chebyshev, F-best ...

8 In his paper " Lagrange interpolation on Chebyshev points of two variables " (J. 9 220–238), Y. Xu proposed a set of Chebyshev like points for polynomial interpolation in the square 10 [−1, 1] 2 , and derived a compact form of the corresponding Lagrange interpolation formula. We inves-11 tigate computational aspects of the Xu polynomial interpolation formula like numerical stability and 12 ef...