Strong Uniqueness of Best Approximations from RS-sets in Banach Spaces

The problem of strong uniqueness of best approximation from an RS set in a Banach space is considered. For a fixed RS set G and an element x∈X , we proved that the best approximation g * to x from G is strongly unique.

BEST APPROXIMATION FOR WEIERSTRASS TRANSFORM CONNECTED WITH SPHERICAL MEAN OPERATOR

Using reproducing kernels for Hilbert spaces, we give best approximation for Weierstrass transform associated with spherical mean operator. Also, estimates of extremal functions are checked.

FIXED POINT THEOREMS AND BEST APPROXIMATION IN CONVEX METRIC SPACES

Results regarding best approximation and best Simultaneous approximation on convex metric spaces are Obtained.Existence of fixed points for an ultimately nonexpansive semigroup of mappings is also shown.

SOME BEST APPROXIMATION RESULTS IN LOCALLY CONVEX SPACES

In this note we obtain generalization of well known results of carbone and Conti,Sehgal and Singh and Tanimoto concerning the existence of best approximation and simultaneous best approximation of continuous Junctions from the set up of a normed space to the case of a Hausdorff locally convex space.

CHARACTERIZATION OF BEST APPROXIMATIONS IN METRIC LINEAR SPACES

Let (X,d) be a real metric linear space, with translation-invariant metric d and C a linear subspace of X. In this paper we use functionals in the Lipschitz dual of X to characterize those elements of G which are best approximations to elements of X.We also give simultaneous characterization of elements of best approximation and also consider elements of ε-approximation.

BEST APPROXIMATION THEOREM FOR SET-VALUED MAPPINGSWITHOUT CONVEX VELUES AND CONTINUITY

In this paper, a new concept of weakly ,convex graph for set-valued mappings is introduced and studied. By using the concept , some new coincidence, the bestapproximation and fixed point-theorems are obtained.

Some Remarks on the Convex Feasibility Problem and Best Approximation Problem

In this paper we investigate several solution algorithms for the convex fea- sibility problem(CFP)and the best approximation problem(BAP)respectively.The algorithms analyzed are already known before,but by adequately reformulating the CFP or the BAP we naturally deduce the general projection method for the CFP from well-known steepest decent method for unconstrained optimization and we also give a natural strategy of updating weight parameters.In the linear case we show the connec- tion of the two projection algorithms for the CFP and the BAP respectively.In addition, we establish the convergence of a method for the BAP under milder assumptions in the linear case.We also show by examples a Bauschke's conjecture is only partially correct.

BEST APPROXIMATION BY DOWNWARD SETS WITH APPLICATIONS

We develop a theory of downward sets for a class of normed ordered spaces. We study best approximation in a normed ordered space X by elements of downward sets, and give necessary and sufficient conditions for any element of best approximation by a closed downward subset of X. We also characterize strictly downward subsets of X, and prove that a downward subset of X is strictly downward if and only if each its boundary point is Chebyshev. The results obtained are used for examination of some Chebyshev pairs （W,x）, where ∈ X and W is a closed downward subset of X

SOME GENERALIZATIONS OF KY FAN'S BEST APPROXIMATION THEOREM

We pressent new Ky Fan type best approximation theorems for a discontinuous multivalued map on metrizable topological vector spaces and hyperconvex spaces. In addition, fixed point results are derived for the map studied. Our work generalizes severl results in approximation theory.

FUNCTIONAL INEQUALITIES AND BEST APPROXIMATION

We investigate the relationship between best approximations by elements of closed convex cones and the estimation of functionals on an inner product space (X,<·,·>)in terms of the inner product on X.

Maximal Inequalities for the Best Approximation Operator and Simonenko Indices

In an abstract set up, we get strong type inequalities in L^p＋1 by assuming weak or extra-weak inequalities in Orlicz spaces. For some classes of functions, the number p is related to Simonenko indices. We apply the results to get strong inequal- ities for maximal functions associated to best Ф-approximation operators in an Orlicz space L^Ф.

A Note on Pad Approximants Pairs as Limits of Algebraic Polynomials Pairs of Weighted Best Approximation in Orlicz Spaces

In this short note, we show the behavior in Orlicz spaces of best approximations by algebraic polynomials pairs on union of neighborhoods, when the measure of them tends to zero.

On Converse Theorem of Best Approximation by Polynomials in Bergman Spaces H_q^p(p>0,q>1)

A Bernstein type theorem and a converse theorem of best approximation by polynomials in Bergman spaces Hq^p(p>0,q>1) are proved.Some proofs and results in [1] are in proved.

PADE APPROXIMANTS AS LIMITS OF RATIONAL FUNCTIONS OF BEST APPROXIMATION IN ORLICZ SPACE

In this paper, we prove that the best rational approximation of a given analytic function in Orlicz space L~*(G), where G = {|z|≤∈}, converges to the Pade approximants of the function as the measure of G approaches zero.

BEST APPROXIMATION BY NORMAL MATRICES WITH SPECTRAL CONSTRAINTS

The problem of best approximating, a given square complex matrix in the Frobenius norm by normal matrices under a given spectral restriction is considered. The ne cessary and sufficient condition for the solvability of the problem is given. A numerical algorithm for solving the problem is provided and a numerical example is presented.

The Equivalence Relations between the Best Approximation and Linear Operators Approximation in a Besov Space

In this paper, we characterize Besov type space introduced by the best approximation, best approximating elements and a kind of linear operators.

Monotonicity and Best Approximation in Banach Lattices

Hudzik and Kurc discussed some best approximation problems in Banach lattices by means of monotonicities. This paper deals with more general best approximation problems in Banach lattices. Existence, uniqueness, stability and continuity for such best approximation problems are discussed.

On Best Approximations from RS-sets in Complex Banach Spaces

The concept of an RS–set in a complex Banach space is introduced and theproblem of best approximation from an RS–set in a complex space is investigated. Results consistingof characterizations, uniqueness and strong uniqueness are established.

Leibniz seminorms and best approximation from C*-subalgebras

We show that if B is a C*-subalgebra of a C*-algebra A such that B contains a bounded approximate identity for A,and if L is the pull-back to A of the quotient norm on A/B,then L is strongly Leibniz.In connection with this situation we study certain aspects of best approximation of elements of a unital C*-algebra by elements of a unital C*-subalgebra.

The Jackson Inequality for the Best L^2-Approximation of Functions on [0,1] with the Weight x

Let L^2（[0, 1], x） be the space of the real valued, measurable, square summable functions on [0, 1] with weight x, and let n be the subspace of L2（[0, 1], x） defined by a linear combination of Jo（μkX）, where Jo is the Bessel function of order 0 and {μk} is the strictly increasing sequence of all positive zeros of Jo. For f ∈ L^2（[0, 1], x）, let E（f, n） be the error of the best L2（[0, 1], x）, i.e., approximation of f by elements of n. The shift operator off at point x ∈[0, 1] with step t ∈[0, 1] is defined by T（t）f（x）=1/π∫0^π f（√x^2 ＋t^2-2xtcosO）dθ The differences （I- T（t））^r/2f = ∑j=0^∞（-1）^j（j^r/2）T^j（t）f of order r ∈ （0, ∞） and the L^2（[0, 1],x）- modulus of continuity ωr（f,τ） = sup{｜｜（I- T（t））^r/2f｜｜：0≤ t ≤τ] of order r are defined in the standard way, where T^0（t） = I is the identity operator. In this paper, we establish the sharp Jackson inequality between E（f, n） and ωr（f, τ） for some cases of r and τ. More precisely, we will find the smallest constant n（τ, r） which depends only on n, r, and % such that the inequality E（f, n）≤ n（τ, r）ωr（f, τ） is valid.