On nonlinear simultaneous Chebyshev approximation problems

This paper is concerned with the problem of nonlinear simultaneous Chebyshev approximation in a real continuous function space. Some results on existence are established, in addition to characterization conditions of Kolmogorov type and also of alternation type. Applications are given to approximation by rational functions, by exponential sums and by Chebyshev splines with free knots.     

On well posedness of best simultaneous approximation problems in Banach spaces

The well posedness of best simultaneous approximation problems is considered. We establish the generic results on the well posedness of the best simultaneous approximation problems for any closed weakly compact nonempty subset in a strictly convex Kadec Banach space. Further, we prove that the set of all points inE(G) such that the best simultaneous approximation problems are not well posed is a u- porous set inE(G) whenX is a uniformly convex Banach space. In addition, we also investigate the generic property of the ambiguous loci of the best simultaneous approximation.     

Exponential approximation schemata for some network design problems

We study approximation of some well-known network design problems such as the traveling salesman problem (for both minimization and maximization versions) and the min steiner tree problem by moderately exponential algorithms. The general goal of the issue of moderately exponential approximation is to catch up on polynomial inapproximability by designing superpolynomial algorithms achieving approximation ratios unachievable in polynomial time. Worst-case running times of such algorithms are significantly smaller than those needed for optimal solutions of the problems handled.     

Existence and approximation of nonlocal optimal design problems driven by parabolic equations

This work is a follow‐up to a series of articles by the authors where the same topic for the elliptic case is analyzed. In this article, a class of nonlocal optimal design problem driven by parabolic equations is examined. After a review of results concerning existence and uniqueness for the state equation, a detailed formulation of the nonlocal optimal design is given. The state equation is of nonlocal parabolic type, and the associated cost functional belongs to a broad class of nonlocal integrals. In the first part of the work, a general result on the existence of nonlocal optimal design is proved. The second part is devoted to analyzing the convergence of nonlocal optimal design problems toward the corresponding classical problem of optimal design. After a slight modification of the problem, either on the cost functional or by considering a new set of admissibility, the G‐convergence for the state equation and, consequently, the convergence of the nonlocal optimal design problem are proved.     

Real Taylor shifts and simultaneous approximation

We are interested in the Taylor shift operator acting on the space of infinitely differentiable functions. In particular if we choose a countable family of centers of Taylor expansion, we prove that the associated family of real Taylor shifts fulfills the approximation of any given family of infinitely differentiable functions with a common subsequence of iterates applied on a common vector. We obtain similar conclusions in the context of universal series improving recent statements. Finally we introduce the notion of doubly universal Taylor shift. All these results give new and natural examples of disjoint universality.     

A new approach to the weighted peak-constrained least-square error FIR digital filter optimal design problem

This paper deals with the design of linear-phase finite impulse response (FIR) digital filters using weighted peak-constrained least-squares (PCLS) optimization. The PCLS error design problem is formulated as a quadratically constrained quadratic semi-infinite programming problem. An exchange algorithm with a new exchange rule is proposed to solve the problem. The algorithm provides the approximate optimal solution after a finite number of iterations. In particular, the subproblem solved at each iteration is a quadratically constrained quadratic programming. We can rewrite it as a conic optimization problem solvable in polynomial time. For illustration, numerical examples are solved using the proposed algorithm.     

An approximation algorithm for network design problems with downwards-monotone demand functions

Building on an existing 2-approximate algorithm for the class of network design problems with downwards-monotone demand functions, many of which are NP-hard, we present an algorithm that produces solutions that are at least as good as and typically better than solutions produced by the existing algorithm.     

Rational approximation to algebraic varieties and a new exponent of simultaneous approximation

This paper deals with two main topics related to Diophantine approximation. Firstly, we show that if a point on an algebraic variety is approximable by rational vectors to a sufficiently large degree, the approximating vectors must lie in the topological closure of the rational points on the variety. In many interesting cases, in particular if the set of rational points on the variety is finite, this closure does not exceed the set of rational points on the variety itself. This result enables easier proofs of several known results as special cases. The proof can be generalized in some way and encourages to define a new exponent of simultaneous approximation. The second part of the paper is devoted to the study of this exponent.     

Bernstein算子的点态同时逼近

借助光滑模ω_φ~2(f,t)(φ是一般步权函数),研究了Bernstein算子的点态同时逼近问题,给出了Bernstein算子同时逼近的等价定理,建立了其导数与光滑函数间的关系,对以前已有的结果予以补充和完善.     

Complexity of approximation problems

We consider some aspects of optimal encoding and renewal related to the problem of complexity of the ε-definition of functions posed by Kolmogorov in 1962. We present some estimates for the ε-complexity of the problem of renewal of functions in the uniform metric and Hausdorff metric.     

Lipschitz-Nikolski\imath constants and asymptotic simultaneous approximation on theM n -operatorsconstants and asymptotic simultaneous approximation on theM n -operators

This note is a study of approximation of classes of functions and asymptotic simultaneous approximation of functions by theM _n -operators of Meyer-König and Zeller which are defined by $$(M_n f)(x) = (1 - x)^{n + 1} \sum\limits_{k = 0}^\infty {f\left( {\frac{k}{{n + k}}} \right)} \left( \begin{array}{l} n + k \\ k \\ \end{array} \right)x^k , n = 1,2,....$$ Among other results it is proved that for 0<α≤1 $$\mathop {\lim }\limits_{n \to \infty } n^{\alpha /2} \mathop {\sup }\limits_{f \in Lip_1 \alpha } \left| {(M_n f)(x) - f(x)} \right| = \frac{{\Gamma \left( {\frac{{\alpha + 1}}{2}} \right)}}{{\pi ^{1/2} }}\left\{ {2x(1 - x)^2 } \right\}^{\alpha /2} $$ and if for a functionf, the derivativeD ^m+2 f exist at a pointx∈(0, 1), then $$\mathop {\lim }\limits_{n \to \infty } 2n[D^m (M_n f) - D^m f] = \Omega f,$$ where Ω is the linear differential operator given by $$\Omega = x(1 - x)^2 D^{m + 2} + m(3x - 1)(x - 1)D^{m + 1} + m(m - 1)(3x - 2)D^m + m(m - 1)(m - 2)D^{m - 1} .$$      

Values of general dirichlet series and simultaneous diophantine approximation

We show a joint denseness theorem for values of a general Dirichlet series \( \sum\nolimits_{n = 1}^\infty {{{\text{a}}_n}{{\text{e}}^{ - {\lambda_n}s}}} \) in a certain class and its derivatives, where the numbers {λ _n } are not necessarily linearly independent over \( \mathbb{Q} \).     

On shape-preserving properties and simultaneous approximation of Stancu operator

In the present paper,the shape-preserving properties and the monotonicity for convex functions of Stancu operator are given.Moreover,the simultaneous approximation problems of this operator are also considered.     

Perturbations of best approximation problems

Summary The purpose of this paper is to unify a number of continuity, perturbation, and discretization properties of best approximations in normed linear spaces or in metric or semimetric spaces. It extends work of Aubin and, more specifically, of Daniel.Research supported in part by AEC AT(45-1)-1947     

A converse of asymptotic formulae in simultaneous approximation

In the general setting of simultaneous approximation by sequences of linear shape preserving operators, this paper contains a sort of converse result of Voronovskaya-type asymptotic formulae. As a by-product a saturation result is derived. Applications to some very well-known approximation processes are also presented.