Comonotone Jackson''s Inequality

Let 2s points y_i=−πy_2s<…<y₁<π be given. Using these points, we define the points y_i for all integer indices i by the equality y_i=y_i+2s+2π. We shall write fΔ⁽¹⁾(Y) if f is a 2π-periodic continuous function and f does not decrease on [y_i, y_i−1], if i is odd; and f does not increase on [y_i, y_i−1], if i is even. In this article the following Theorem 1—the comonotone analogue of Jackson's inequality—is proved. 1. If fΔ⁽¹⁾(Y), then for each nonnegative integer n there is a trigonometric polynomial τ_n(x) of order n such that τ_nΔ⁽¹⁾(Y), and |f(x)−π_n(x)|c(s) ω(f; 1/(n+1)), x , where ω(f; t) is the modulus of continuity of f, c(s)=const. Depending only on s.     

Local polynomial reproduction and moving least squares approximation

Local polynomial reproduction is a key ingredient in providingerror estimates for several approximation methods. To boundthe Lebesgue constants is a hard task especially in a multivariatesetting. We provide a result which allows us to bound the Lebesgueconstants uniformly and independently of the space dimensionby oversampling. We get explicit and small bounds for the Lebesgueconstants. Moreover, we use these results to establish errorestimates for the moving least squares approximation scheme,also with special emphasis on the involved constants. We discussthe numerical treatment of the method and analyse its effort.Finally, we give large scale examples.     

Korovkin-type approximation in spaces of vector-valued and set-valued functions

We consider some Korovkin-type approximation results for sequences of linear continuous operators in spaces of vector-valued and set-valued continuous functions without assuming the existence of the limit operator. Even in spaces of real continuous functions, where similar results have already been established, we replace the positivity assumption with a weaker condition. We also give some quantitative estimate of the convergence and some applications where previous results cannot be applied.     

有理逼近的一些最新进展

作为非线性逼近的一个重要特殊情形，有理函数逼近（即有理逼近）无论在实践中还是在应用中有都有重要的意义，有理逼近日益成为逼近论的一个重要和具有很强生命力的课题。近年来，在这一方面的研究成果不断涌现，其中许多都是非常有意义的。本文将对此作一个总结，特别对其中涉及我们自己的工作作一个回顾。     

Lipschitz continuity and Gateaux differentiability of the best approximation operator in vector-valued Chebyshev approximation

When G is a finite-dimensional Haar subspace of C(X,R^k), the vector-valued functions (including complex-valued functions when k is 2) from a finite set X to Euclidean k-dimensional space, it is well-known that at any function f in C(X,R^k) the best approximation operator satisfies the strong unicity condition of order 2 and a Lipschitz (Hőlder) condition of order . This note shows that in fact the best approximation operator satisfies the usual Lipschitz condition of order 1 and has a Gateaux derivative on a dense set of functions in C(X,R^k).     

NEAR MINIMAX POLYNOMIAL APPROXIMATION

In this paper a representation for linear polynomial projection is given. Then it isshown that the near minimax approximation is equivalant to a problem of the best approxima-tion of hivariste functions. And some properties for near minimax are obtained.     

The Existence and Local Behavior of Multivariate Algebraic Function Approximations

The existing scheme of rational polynomial approximants, defined by multivariate power series, is extended to define approximants with branch points. The existence theorem is obtained. The basic properties used to define the rational approximants can be preserved almost intactly. Especially, the local behavior of the     

Monotonicity Preserving Approximation of Multivariate Scattered Data

This paper describes a new method of monotone interpolation and smoothing of multivariate scattered data. It is based on the assumption that the function to be approximated is Lipschitz continuous. The method provides the optimal approximation in the worst case scenario and tight error bounds. Smoothing of noisy data subject to monotonicity constraints is converted into a quadratic programming problem. Estimation of the unknown Lipschitz constant from the data by sample splitting and cross-validation is described. Extension of the method for locally Lipschitz functions is presented. AMS subject classification (2000) 41A29, 65D05, 41A15, 65D10     

Rational approximation with sign-sensitive weight

For metrics of sign-sensitive weight, a generalization of the Jackson theorem and an analog of the Dolzhenko theorem on the estimate of the variation of a function in terms of its least rational deviations are obtained. In the same metric, two-sided estimates for rational deviations of the function signx are given.Translated fromMatematickeskie Zametki, Vol. 60, No. 5, pp. 715–725, November, 1996.     

Minimization methods for approximating tensors and their comparison

Application of various minimization methods to trilinear approximation of tensors is considered. These methods are compared based on numerical calculations. For the Gauss-Newton method, an efficient implementation is proposed, and the local rate of convergence is estimated for the case of completely symmetric tensors.     

Lipschitz continuity of the best approximation operator in vector-valued Chebyshev approximation

When G is a finite dimensional Haar subspace of C(X,R^k), the vector-valued continuous functions (including complex-valued functions when k is 2) from a finite set X to Euclidean k-dimensional space, it is well-known that at any function f in C(X,R^k) the best approximation operator satisfies the strong unicity condition of order 2 and a Lipschitz (Hőlder) condition of order . This note shows that in fact the best approximation operator satisfies the usual Lipschitz condition of order 1.     

A -functional and the rate of convergence of some linear polynomial operators

We show that the -functional

where , is equivalent to the rate of convergence of a certain linear polynomial operator. This operator stems from a Riesz-type summability process of expansion by Legendre polynomials. We use the operator above to obtain a linear polynomial approximation operator with a rate comparable to that of the best polynomial approximation.

     

由Fourier系数确定的函数类的最佳m-项单边逼近渐近估计

结合最佳m项逼近和单边逼近的思想引进所谓最佳m项单边逼近的概念,给出由Fourier系数确定的光滑函数类通过三角函数系在Lp(1≤P≤∞)的最佳m-项单边逼近渐近估计以及m-项类贪婪单边逼近结果.     

Copositive approximation by rational functions with prescribed numerator degree

The paper proves that, if f（x） ∈ L^p[-1,1],1≤p〈∞ ,changes sign I times in （-1, 1）,then there exists a real rational function r（x） ∈ Rn^（2μ-1）l which is eopositive with f（x）, such that the following Jackson type estimate ｜｜f-r｜｜p≤Cδl^2μωφ（f,1/n）p holds, where μ is a natural number ≥3/2＋1/p, and Cδ is a positive constant depending only on δ.     

Weak Copositive and Intertwining Approximation

It is known that shape preserving approximation has lower rates than unconstrained approximation. This is especially true for copositive and intertwining approximations. ForfL_p, 1p<∞, the former only has rateω(f, n⁻¹)_p, and the latter cannot even be bounded byC f_p. In this paper, we discuss various ways to relax the restrictions in these approximations and conclude that the most sensible way is the so-calledalmostcopositive/intertwining approximation in which one relaxes the restriction on the approximants in a neighborhood of radiusΔ_n(y_j) of each sign changey_j.     

Coconvex approximation in the uniform norm: the final frontier

Summary The paper deals with approximation of a continuous function, on a finite interval, which changes convexity finitely many times, by algebraic polynomials which are coconvex with it. We give final answers to open questions concerning the validity of Jackson type estimates involving the weighted Ditzian-Totik moduli of smoothness.     

代数数的有理逼近及其在求解丢番图方程中的应用

在本文中,我们利用Ｔｈｕｅ－Ｓｉｅｐｅｌ方法研究一类代数数的有理逼近,证明了对此代数数的有效有一逼近,最后我们利用此结果研究了ｄｉｏｐｈａｎｔｉｎｅ方程。ａｘ＾２－ｂｙ＾４＝－１得出关于此方程完整的结论。     

A generalization of Dirichlet approximation theorem for the affine actions on real line

In this paper, we obtain strong density results for the orbits of real numbers under the action of the semigroup generated by the affine transformations T₀(x)=x/a and T₁(x)=bx+1, where a,b>1. These density results are formulated as generalizations of the Dirichlet approximation theorem and improve the results of Bergelson, Misiurewicz, and Senti. We show that for any x,u>0 there are infinitely many elements γ in the semigroup generated by T₀ and T₁ such that |γ(x)−u|<C(t1/|γ|−1), where C and t are constants independent of γ, and |γ| is the length of γ as a word in the semigroup. Finally, we discuss the problem of approximating an arbitrary real number by the ratios of prime numbers and the ratios of logarithms of prime numbers.     

The strong approximation property and the weak bounded approximation property

We show that the strong approximation property (strong AP) (respectively, strong CAP) and the weak bounded approximation property (respectively, weak BCAP) are equivalent for every Banach space. This gives a negative answer to Oja's conjecture. As a consequence, we show that each of the spaces _c0$c_0$ and _?1${?}_1$ has a subspace which has the AP but fails to have the strong AP.