The Iyengar Type Inequalities with Exact Estimations and the Chebyshev Central Algorithms of Integrals

In this paper, both low order and high order extensions of the Iyengar type inequality are obtained. Such extensions are the best possible in the same sense as that of the Iyengar inequality. hzrthermore, the Chebyshev central algorithms of integrals for some function classes and some related problems are also considered and investigated.     

ON THE RATE OF WEIGHTED Lp CONVERGENCE BY THE GRUENWALD INTERPOLATORY OPERATORS

This paper gives the weighted Lp convergence rate estimations of the Gruenwald interpolatory polynomials based on the zeros of Chebyshev polymomials of the first kind,and proves that the order of the estimations is optimal for p≥1.     

ON THE GENERALIZATIONS OF KALANDIA＇S LEMMA

Based on Bernstein＇s Theorem, Kalandia＇s Lemma describes the error estimate and the smoothness of the remainder under the second part of Hoelder norm when a HSlder function is approximated by its best polynomial approximation. In this paper, Kalandia＇s Lemma is generalized to the cases that the best polynomial is replaced by one of its four kinds of Chebyshev polynomial expansions, the error estimates of the remainder are given out under Hoeder norm or the weighted HSlder norms.     

Approximating weak Chebyshev subspaces by Chebyshev subspaces

We examine to what extent finite-dimensional spaces defined on locally compact subsets of the line and possessing various weak Chebyshev properties (involving sign changes, zeros, alternation of best approximations, and peak points) can be uniformly approximated by a sequence of spaces having related properties.     

Proximality and Chebyshev sets

This paper is a companion to a lecture given at the Prague Spring School in Analysis in April 2006. It highlights four distinct variational methods of proving that a finite dimensional Chebyshev set is convex and hopes to inspire renewed work on the open question of whether every Chebyshev set in Hilbert space is convex.     

Pseudoaffinity, de Boor algorithm, and blossoms

In order to ensure existence of a de Boor algorithm (hence of a B-spline basis) in a given spline space with (n+1)-dimensional sections, it is important to be able to generate each spline by restriction to the diagonal of a symmetric function of n variables supposed to be pseudoaffine w.r. to each variable. We proved that a way to obtain these three properties (symmetry, n-pseudoaffinity, diagonal property) is to suppose the existence of blossoms on the set of admissible n-tuples, given that blossoms are defined in a geometric way by means of intersections of osculating flats. In the present paper, we examine the converse: do symmetry, n-pseudoaffinity, and diagonal property imply existence of blossoms?     

Some inequalities for characteristic functions. II

Recently we established Matysiak and Szablowski's conjecture [V. Matysiak, P.J. Szablowski, Theory Probab. Appl. 45 (2001) 711-713] about a lower bound of real-valued characteristic functions. In this paper, applying an alternative approach we are able to give explicitly the ranges of argument for which the obtained inequalities hold true for general characteristic functions.     

On irreversibility of von Neumann additive cellular automata on grids

The von Neumann cellular automaton appears in many different settings in Operations Research varying from applications in Formal Languages to Biology. One of the major questions related to it is to find a general condition for irreversibility of a class of two-dimensional cellular automata on square grids (σ⁺-automata). This question is partially answered here with the proposal of a sufficient condition for the irreversibility of σ⁺-automata.     

近严格凸与最佳逼近

本文研究近严格凸与最佳逼近的关系．证明了Ｂａｎａｃｈ空间Ｘ是近严格凸的当且仅当Ｘ的每个子空间是紧－半－切比晓夫空间．