Function Spaces in Lipschitz Domains and Optimal Rates of Convergence for Sampling

Assume that we want to recover $f : \Omega \to {\bf C}$ in the $L_r$-quasi-norm ($0 < r \le \infty$) by a linear sampling method $$ S_n f = \sum_{j=1}^n f(x^j) h_j , $$ where $h_j \in L_r(\Omega )$ and $x^j \in \Omega$ and $\Omega \subset {\bf R}^d$ is an arbitrary bounded Lipschitz domain. We assume that $f$ is from the unit ball of a Besov space $B^s_{pq} (\Omega)$ or of a Triebel--Lizorkin space $F^s_{pq} (\Omega)$ with parameters such that the space is compactly embedded into $C(\overline{\Omega})$. We prove that the optimal rate of convergence of linear sampling methods is $$ n^{ -{s}/{d} + ({1}/{p}-{1}/{r})_+} , $$ nonlinear methods do not yield a better rate. To prove this we use a result from Wendland (2001) as well as results concerning the spaces $B^s_{pq} (\Omega) $ and $F^s_{pq}(\Omega)$. Actually, it is another aim of this paper to complement the existing literature about the function spaces $B^s_{pq} (\Omega)$ and $F^s_{pq} (\Omega)$ for bounded Lipschitz domains $\Omega \subset {\bf R}^d$. In this sense, the paper is also a continuation of a paper by Triebel (2002).     

Approximation orders of formal Laurent series by Oppenheim rational functions

We study formal Laurent series which are better approximated by their Oppenheim convergents. We calculate the Hausdorff dimensions of sets of Laurent series which have given polynomial or exponential approximation orders. Such approximations are faster than the approximation of typical Laurent series (with respect to the Haar measure).     

修正的Durrmeyer—Bernstein算子的逼近的特征刻划

本文解决了修正的Ｄｕｒｒｍｅｙｅｒ－Ｂｅｒｎｓｔｅｉｎ算子的特征刻划问题。     

Numerical simulation of anomalous plasma transport in the presence of magnetic turbulence

The structure of plasma in the interplanetary space is briefly presented, and the problems related to the variability of solar activity are discussed. The features of magnetic turbulence in the solar wind are also described. Magnetic field fluctuations are one of the causes of enhanced transport both in laboratory and astrophysical plasmas. To a first approximation, the plasma particles follow the magnetic field lines, whose equations form a non-linear one and a half degrees of freedom system. Unless the fluctuation level is very low, numerical simulations are needed to study such a system. We review three-dimensional numerical simulations of field line transport in anisotropic magnetic turbulence. Several transport regimes are found: for low Kubo number, anomalous transport is obtained, featuring both subdiffusion, corresponding to trapping in cantori structures, and superdiffusion, corresponding to Levy flights in the stochastic layer. Increasing the Kubo number, and hence stochasticity, quasilinear, intermediate, and percolative regimes are found, in the order. An expression of the diffusion coefficient valid for generalized anisotropy is presented.     

A linearized Riemann solver for the steady supersonic Euler equations

A very simple linearization of the solution to the Riemann problem for the steady supersonic Euler equations is presented. When used locally in conjunction with the Godunov method, computing savings by a factor of about four relative to the use of exact Riemann solvers can be achieved. For severe flow regimes, however, the linearization loses accuracy and robustness. We then propose the use of a Riemann solver adaptation procedure. This retains the accuracy and robustness of the exact Riemann solver and the computational efficiency of the cheap linearized Riemann solver. Numerical results for two- and three-dimensional test problems are presented.     

Generalized p-Center problems: Complexity results and approximation algorithms

In an earlier paper, two alternative p-Center problems, where the centers serving costumers must be chosen so that exactly one node from each of p prespecified disjoint pairs of nodes is selected, were shown to be NP-complete. This paper considers a generalized version of these problems, in which the nodes from which the p servers are to be selected are partitioned into k sets and the number of servers selected from each set must be within a prespecified range. We refer to these problems as the ‘Set’ p-Center problems. We establish that the triangle inequality (Δ-inequality) versions of these problems, in which the edge weights are assumed to satisfy the triangle inequality, are also NP-complete. We also provide a polynomial time approximation algorithm for the two Δ-inequality Set p-Center problems that is optimal for one of the problems in the sense that no algorithm with polynomial running time can provide a better constant factor performance guarantee, unless P = NP. For the special case ‘alternative’ p-Center problems, which we refer to as the ‘Pair’ p-Center problems, we extend the previous results in several ways. For example, the results mentioned above for the Set p-Center problems also apply to the Pair p-Center problems. Furthermore, we establish and exploit a correspondence between satisfiability and the dominating set type of problems that naturally arise when considering the decision versions of the Pair p-Center problems.     

Approximation Orders of FSI Spaces in L 2 (R d )

A second look at the authors' [BDR1], [BDR2] characterization of the approximation order of a Finitely generated Shift-Invariant (FSI) subspace of L ₂(R ^d ) results in a more explicit formulation entirely in terms of the (Fourier transform of the) generators of the subspace. Further, when the generators satisfy a certain technical condition, then, under the mild assumption that the set of 1-periodizations of the generators is linearly independent, such a space is shown to provide approximation order k if and only if contains a (necessarily unique) satisfying for |j|<k , . The technical condition is satisfied, e.g., when the generators are at infinity for some >k+d. In the case of compactly supported generators, this recovers an earlier result of Jia [J1], [J2]. March 19, 1996. Dates revised: September 6, 1996, March 4, 1997.     

Pointwise Recurrent Dynamical Systems with Pseudo-orbit Tracing Property

ＰｏｉｎｔｗｉｓｅＲｅｃｕｒｒｅｎｔＤｙｎａｍｉｃａｌＳｙｓｔｅｍｓｗｉｔｈＰｓｅｕｄｏ－ｏｒｂｉｔ　Ｔｒａｃｉｎｇ　ＰｒｏｐｅｒｔｙＭａｔＪｉｅｈｕａ（麦结华）（ＩｎｓｔｉｔｕｔｅｏｆＭａｔｈｅｍａｔｉｃｓ，ＧｕａｎｇｘｉＵｎｉｖｅｒｓｉｔｙ，Ｎａ...     

An algorithm for approximating piecewise linear concave functions from sample gradients

An effective algorithm for solving stochastic resource allocation problems is to build piecewise linear, concave approximations of the recourse function based on sample gradient information. Algorithms based on this approach are proving useful in application areas such as the newsvendor problem, physical distribution and fleet management. These algorithms require the adaptive estimation of the approximations of the recourse function that maintain concavity at every iteration. In this paper, we prove convergence for a particular version of an algorithm that produces approximations from stochastic gradient information while maintaining concavity.     

滤子的限制,性质保持与弱划分性质

本文给出划分的限制的一个基本性质，κ 连续性，证明了划分空间上的滤子的κ 完全性，精细性，超滤子性，准超滤子性，等关于限制保持．另外，本文还给出划分空