Probabilistic and Average Linear Widths of Sobolev Space with Gaussian Measure in L \infty-Norm

In this paper we investigate the probabilistic linear $(n,\delta)$-widths and $p$-average linear $n$-widths of the Sobolev space $W^r_2$ equipped with the Gaussian measure $\mu$ in the $L_{\infty}$-norm, and determine the asymptotic equalities \begin{eqnarray*} \lambda_{n,\delta}(W^r_2,\mu,L_{\infty}) &\asymp&\frac{\sqrt{\ln (n/\delta)}}{n^{r+(s-1)/2}},\\[3pt] \lambda^{(a)}_n(W^r_2,\mu,L_{\infty})_p &\asymp&\frac{\sqrt{\ln n}}{n^{r+(s-1)/2}}, \qquad 0 < p < \infty. \end{eqnarray*}     

On the stationary Lp-approximation power to derivatives by radial basis function interpolation

In this paper, we consider approximation to derivatives of a function by using radial basis function interpolation. Most of well-known theories for this problem provide error analysis in terms of the so-called native space, say C_φ. However, if a basis function φ is smooth, the space C_φ is extremely small. Thus, the purpose of this study is to extend this result to functions in the homogenous Sobolev space.     

DUAL RECIPROCITY HYBRID BOUNDARY NODE METHOD FOR THREE-DIMENSIONAL ELASTICITY WITH BODY FORCE

Combining Dual Reciprocity Method （DRM） with Hybrid Boundary Node Method （HBNM）, the Dual Reciprocity Hybrid Boundary Node Method （DRHBNM） is developed for three-dimensional linear elasticity problems with body force. This method can be used to solve the elasticity problems with body force without domain integral, which is inevitable by HBNM. To demonstrate the versatility and the fast convergence of this method, some numerical examples of 3-D elasticity problems with body forces are examined. The computational results show that the present method is effective and can be widely applied in solving practical engineering problems.     

New Results on the Queens_n 2 Graph Coloring Problem

For the Queens_n ² graph coloring problems no chromatic numbers are available for n > 9 except where n is not a multiple of 2 or 3. In this paper we propose an exact algorithm that takes advantage of the particular structure of these graphs. The algorithm works on the independent sets of the graph rather than on the vertices to be colored. It combines branch and bound, for independent set assignment, with a clique based filtering procedure. A first experimentation of this approach provided the coloring number values ranging for n = 10 to n = 14.     

第二类变型Bessel函数的Chebyshev逼近

第二类变型Bessel函数Kn(z)在自变量趋于无穷时就是指数变小的，使用多项式逼近的方法求解往往误差很大．采用指数变换和J．P．Boyd的有理Chebyshev多项式计算第二类变型Bessel函数，得到了令人满意的在较大范围内有效的解．     

Iterative Schemes for Nonconvex Variational Inequalities

In this paper, we suggest and analyze some iterative methods for solving nonconvex variational inequalities using the auxiliary principle technique, the convergence of which requires either only pseudomonotonicity or partially relaxed strong monotonicity. Our proofs of convergence are very simple. As special cases, we obtain earlier results for solving general variational inequalities involving convex sets.     

Separating the solution sets of analytical and polynomial systems

A linear inequality system with infinitely many constraints is polynomial (analytical) if its index set is a compact interval of the real line and all its coefficients are polynomial (analytical, respectively) functions of the index on this interval. This paper provides an example of analytical system whose solution set cannot be the solution set of any polynomial system. Research supported by DGES of Spain and FEDER of UE, Grant BFM2002-04114-C02-01. Research supported by CONACyT of Mexico, Grant 130036. Research partially supported by CONACyT of Mexico, Grant 44003.     

ANTI FUZZY VECTOR SPACES（Ⅱ）

ＡＮＴＩＦＵＺＺＹＶＥＣＴＯＲＳＰＡＣＥＳ（Ⅱ）ＣｈｅｎＹｏｎｇｎｉａｎ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＸｉｎｊｉａｎｇＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，８３００５４，Ｘｉｎｊｉａｎｇ，Ｐ．Ｒ．Ｃｈｉｎａ）ＡＮＴＩＦＵＺＺＹＶＥＣＴ...     

Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis

In this paper we present a framework for solving stochastic programs with complete integer recourse and discretely distributed right-hand side vector, using Gröbner basis methods from computational algebra to solve the numerous second-stage integer programs. Using structural properties of the expected integer recourse function, we prove that under mild conditions an optimal solution is contained in a finite set. Furthermore, we present a basic scheme to enumerate this set and suggest improvements to reduce the number of function evaluations needed.     

Continuous Selectors of Fixed Point Sets of Multifunctions with Decomposable Values

Existence theorems of continuous selectors whose values are fixed points of multivalued contractions are proved. As an application, the existence of continuous selectors to generalized solution sets of partial differential inclusions, depending on a parameter, is obtained.