Quasi-orthogonality of the best approximant sets

A concept of orthogonality on the normed linear space was introduced by Birkhoff. We shall define the quasi-orthogonal sets in best approximant sets and also some results on best approximation will be obtained.     

The asymptotic accuracy of rational best approximations to ez on a disk

The method described by D. Braess (J. Approx. Theory40 (1984), 375–379) is applied to study approximation of e^z on a disk rather than an interval. Let E_mn be the distance in the supremum norm on ¦z¦ ? ? from e^z to the set of rational functions of type (m, n). The analog of Braess' result turns out to be $\text{E}{}_{\mathrm{mn}}\text{~}\text{m! n! ?}{}^{\mathrm{m\; +\; n\; +1}}\text{(m + n)! (m + n +1)!}$ as m + n → ∞ This formula was obtained originally for a special case by E. Saff (J. Approx. Theory9 (1973), 97–101).     

Behavior of alternation points in best rational approximation

The behavior of the equioscillation points (alternants) for the error in best uniform approximation on [–1, 1] by rational functions of degreen is investigated. In general, the points of the alternants need not be dense in [–1, 1], even when approximation by rational functions of degree (m, n) is considered and asymptoticallym/n 1. We show, however, that if more thanO(logn) poles of the approximants stay at a positive distance from [–1, 1], then asymptotic denseness holds, at least for a subsequence. Furthermore, we obtain stronger distribution results when n (0 < 1) poles stay away from [–1, 1]. In the special case when a Markoff function is approximated, the distribution of the equioscillation points is related to the asymptotics for the degree of approximation.The research of this author was supported, in part, by NSF grant DMS 920-3659.     

Approximation under an arc length constraint

Let f C[a, b]. LetP be a subset ofC[a, b], L b – a be a given real number. We say thatp P is a best approximation tof fromP, with arc length constraintL, ifA[p] _b ^a [1 + (p(x)) ²]dx L andp – f q – f for allq P withA[q] L. represents an arbitrary norm onC[a, b]. The constraintA[p] L might be interpreted physically as a materials constraint.In this paper we consider the questions of existence, uniqueness and characterization of constrained best approximations. In addition a bound, independent of degree, is found for the arc length of a best unconstrained Chebyshev polynomial approximation.The work of L. L. Keener is supported by the National Research Council of Canada Grant A8755.     

Convergence and existence results for best proximity points

We provide a positive answer to a question raised by Eldred and Veeramani [A.A. Eldred, P. Veeramani, Existence and convergence of best proximity points, J. Math. Anal. Appl. 323 (2006) 1001–1006] about the existence of a best proximity point for a cyclic contraction map in a reflexive Banach space. Moreover, we introduce a new class of maps, called cyclic φ$\phi$-contractions, which contains the cyclic contraction maps as a subclass. Convergence and existence results of best proximity points for cyclic φ$\phi$-contraction maps are also obtained.     

Transfinite interpolation on the medians of a triangle and best L 1-approximation

Let be a triangle in and let be the set of its three medians. We construct interpolants to smooth functions using transfinite (or blending) interpolation on The interpolants are of type f(₁)+g(₂)+h(₃), where (₁,₂,₃) are the barycentric coordinates with respect to the vertices of . Based on an error representation formula, we prove that the interpolant is the unique best L¹-approximant by functions of this type subject the function to be approximated is from a certain convexity cone in C³().Received: 17 December 2003     

Some common fixed point theorems for Banach operator pairs with applications in best approximation

The ordered pair (T,I) of two self-maps of a metric space (X,d) is called a Banach operator pair if the set F(I) of fixed points of I is T-invariant i.e. T(F(I))⊆F(I). Some common fixed point theorems for a Banach operator pair and the existence of common fixed points of best approximation are presented in this paper. The results prove, generalize and extend some results of Al-Thagafi [M.A. Al-Thagafi, Common fixed points and best approximation, J. Approx. Theory 85 (1996) 318-323], Carbone [A. Carbone, Applications of fixed point theorems, Jnanabha 19 (1989) 149-155], Chen and Li [J. Chen, Z. Li, Common fixed points for Banach operator pairs in best approximations, J. Math. Anal. Appl. 336 (2007) 1466-1475], Habiniak [L. Habiniak, Fixed point theorems and invariant approximation, J. Approx. Theory 56 (1989) 241-244], Jungck and Sessa [G. Jungck, S. Sessa, Fixed point theorems in best approximation theory, Math. Japon. 42 (1995) 249-252], Sahab, Khan and Sessa [S.A. Sahab, M.S. Khan, S. Sessa, A result in best approximation theory, J. Approx. Theory 55 (1988) 349-351], Shahzad [N. Shahzad, Invariant approximations and R-subweakly commuting maps, J. Math. Anal. Appl. 257 (2001) 39-45] and of few others.     

On zeros of polynomials orthogonal over a convex domain

We establish a discrepancy theorem for signed measures, with a given positive part, which are supported on an arbitrary convex curve. As a main application, we obtain a result concerning the distribution of zeros of polynomials orthogonal on a convex domain.     

Characterization of an extremal sum of ridge functions

The approximation problem considered in the paper is to approximate a continuous multivariate function f(x)=f(_x1,…,_xd)$f(\mathbf{x})=f(x_1,\dots ,x_d)$ by sums of two ridge functions in the uniform norm. We give a necessary and sufficient condition for a sum of two ridge functions to be a best approximation to f(x)$f(\mathbf{x})$. This main result is next used in a special case to obtain an explicit formula for the approximation error and to construct one best approximation. The problem of well approximation by such sums is also considered.     

Bivariate Lagrange interpolation at the Padua points: the ideal theory approach

The Padua points are a family of points on the square [−1, 1]² given by explicit formulas that admits unique Lagrange interpolation by bivariate polynomials. Interpolation polynomials and cubature formulas based on the Padua points are studied from an ideal theoretic point of view, which leads to the discovery of a compact formula for the interpolation polynomials. The L ^p convergence of the interpolation polynomials is also studied. S. De Marchi and M. Vianello were supported by the “ex-60%” funds of the University of Padua and by the INdAM GNCS (Italian National Group for Scientific Computing). Y. Xu was partially supported by NSF Grant DMS-0604056.     

Bounding the number of zeros of certain Abelian integrals

In this paper we prove a criterion that provides an easy sufficient condition in order for any nontrivial linear combination of n Abelian integrals to have at most n+k−1 zeros counted with multiplicities. This condition involves the functions in the integrand of the Abelian integrals and it can be checked, in many cases, in a purely algebraic way.     

Asymptotics for the zeros of the generalized Bessel polynomials

Summary We investigate the location of the zeros of the normalized generalized Bessel polynomials and the normalized reversed generalized Bessel polynomials. Also, the rate at which these zeros approach certain well-defined curves is investigated. On the basis of numerical computations and graphs, four new conjectures are proposed.Dedicated to Richard S. Varga on the occasion of his sixtieth birthday (October 9, 1988)This research was made possible and supported by a Butler University Fellowship Award     

Approximation of monomials by lower degree polynomials

Our topic is the uniform approximation ofx ^k by polynomials of degreen (n on the interval [–1, 1]. Our major result indicates that good approximation is possible whenk is much smaller thann ² and not possible otherwise. Indeed, we show that the approximation error is of the exact order of magnitude of a quantity,p _k,n , which can be identified with a certain probability. The numberp _k,n is in fact the probability that when a (fair) coin is tossedk times the magnitude of the difference between the number of heads and the number of tails exceedsn.     

On the degree of approximation by spline functions with free knots

Summary A comparison theorem is derived for Chebyshev approximation by spline functions with free knots. This generalizes a result of Bernstein for approximation by polynomials.     

Characterization of best Chebyshev approximations with prescribed norm

In this paper a new characterization of smooth normed linear spaces is discussed using the notion of proximal points of a pair of convex sets. It is proved that a normed linear space is smooth if and only if for each pair of convex sets, points which are mutually nearest to each other from the respective sets are proximal.     

Linear best approximation using a class of polyhedral norms

A class of polyhedral norms is introduced, which contains thel ₁ andl norms as special cases. Of primary interest is the solution of linear best approximation problems using these norms. Best approximations are characterized, and an algorithm is developed. This is a methods of descent type which may be interpreted as a generalization of existing well-known methods for solving thel ₁ andl problems. Numerical results are given to illustrate the performance of two variants of the algorithm on some problems.Communicated by C. Brezinski     

Best coapproximation in quotient spaces

As a counterpart to best approximation in normed linear spaces, best coapproximation was introduced by Franchetti and Furi. In this paper, we apply the above coapproximation, and obtain some results on the upper semi-continuity of cometric projection maps. Also we shall determine under what conditions coproximinality can be transmitted to and from quotient spaces.     

Best approximation theorems for nonexpansive and condensing mappings in hyperconvex spaces

In hyperconvex metric spaces we consider best approximation, invariant approximation and best proximity pair problems for multivalued mappings that are condensing or nonexpansive.