This paper is concerned with the problem of best weighted simultaneous approximations to totally bounded sequences in Banach spaces. Characterization results from convex sets in Banach spaces are established under the assumption that the Banach space is uniformly smooth.

In this paper we established some of the results of the best simultaneous approximation in the context of linear 2-normed space. 2000 Mathematics Subject Classification: 41A50, 41A52, 41A99, 41A28.

Let X be a Banach space, (I, μ) be a finite measure space, and Φ be an increasing subadditive continuous function on [0,+∞) with Φ(0) = 0. In the present paper, we discuss the best p-simultaneous approximation of L(I,G) in L(I,X) where G is a closed subspace of X .

in this paper, we prove some results on characterization of $varepsilon$-simultaneous approximations of downward sets in vector lattice banach spaces. also, we give some results about simultaneous approximations of normal sets.

in this paper, we prove some results on characterization of $varepsilon$-simultaneous approximations of downward sets in vector lattice banach spaces. also, we give some results about simultaneous approximations of normal sets.

Let T be a compact Hausdorff topological space and let M denote an n–dimensional subspace of the space C(T ), the space of real–valued continuous functions on T and let the space be equipped with the uniform norm. Zukhovitskii [7] attributes the Basic Theorem to E.Ya.Remez and gives a proof by duality. He also gives a proof due to Shnirel’man, which uses Helly’s Theorem, now the paper obtains a...

Keywords: Baskakov-Szász operators Modulus of continuity Asymptotic formula Simultaneous approximation Statistical convergence Bounded variation a b s t r a c t In the present paper, we introduce generalized Baskakov-Szász type operators and study some approximation properties of these operators e.g., rate of convergence in ordinary and simultaneous approximation, statistical convergence and th...

An approximation algorithm for the maximum independent set problem is given, improving the best performance guarantee known to O(n=(logn) 2 ). We also obtain the same performance guarantee for graph coloring. The results can be combined into a surprisingly strong simultaneous performance guarantee for the clique and coloring problems. The framework of subgraph-excluding algorithms is presented....