The regularizing properties of anisotropic radial basis functions

In the present work we consider the problem of interpolating scattered data using radial basis functions (RBF). In general, it is well known that this leads to a discrete linear inverse problem that needs to be regularized in order to provide a meaningful solution. The work focuses on a metric-regularization approach, based on a new class of RBF, called anisotropic RBF. The work provides theoretical justifications for the regularization approach and it considers a suitable proposal for the metric, supporting it by numerical examples.     

Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions

We prove the Kuhn-Tucker sufficient optimality condition, the Wolfe duality, and a modified Mond-Weir duality for vector optimization problems involving various types of invex-convexlike functions. The class of such functins contains many known generalized convex functions. As applications, we demonstrate that, under invex-convexlikeness assumptions, the Pontryagin maximum principle is a sufficient optimality condition for cooperative differential games. The Wolfe duality is established for these games.The author is indebted to the referees and Professor W. Stadler for valuable remarks and comments, which have been used to revise considerably the paper.     

Generalized Christoffel functions and error of positive quadrature

The author gives some upper and lower bounds for the generalized Christoffel functions related to a Ditzian-Totik generalized weight. As an application, an error estimate of Gauss quadrature formula inL ₁-weighted norm is derived.Dedicated to Prof. Luigi Gatteschi on the occasion of his 70th birthdayWork sponsored by MURST 40%.     

A numerically stable algorithm for two server queue models

In this paper, we consider a queueing system in which there are two exponential servers, each having his own queue, and arriving customers will join the shorter queue. Based on the results given in Flatto and McKean, we rewrite the formula for the probability that there are exactlyk customers in each queue, wherek = 0, 1,…. This enables us to present an algorithm for computing these probabilities and then to find the joint distribution of the queue lengths in the system. A program and numerical examples are given.     

关于“信息熵”分析及其应用的研究

本文用Ｓｈａｎｎｏｎ熵函数的观点及最大离散熵原理，探讨了对随机试验项目的优选问题：即压缩某种“不确定性”试验项目的实施与探索．并通过应用实例的计算，获得了满意的聚类效果．这种方法对于信息资料的数据处理及压缩“不确定性“验项目具有普遍意义．     

Invariants of chaotic Hamiltonian systems

The invariants of chaotic bounded Hamiltonian systems and their relation to the solutions of the first variational equations of the equations of motion are studied. We show that these invariants are characterized by the fact that they either lose the property of differentiability as functions on phase space or that a certain formal power series defined in terms of the derivatives of the invariants has zero radius of convergence. For a specific example, we show that the former possibility appears to apply.     

Sparse-grid finite-volume multigrid for 3D-problems

We introduce a multigrid algorithm for the solution of a second order elliptic equation in three dimensions. For the approximation of the solution we use a partially ordered hierarchy of finite-volume discretisations. We show that there is a relation with semicoarsening and approximation by more-dimensional Haar wavelets. By taking a proper subset of all possible meshes in the hierarchy, a sparse grid finite-volume discretisation can be constructed.The multigrid algorithm consists of a simple damped point-Jacobi relaxation as the smoothing procedure, while the coarse grid correction is made by interpolation from several coarser grid levels.The combination of sparse grids and multigrid with semi-coarsening leads to a relatively small number of degrees of freedom,N, to obtain an accurate approximation, together with anO(N) method for the solution. The algorithm is symmetric with respect to the three coordinate directions and it is fit for combination with adaptive techniques.To analyse the convergence of the multigrid algorithm we develop the necessary Fourier analysis tools. All techniques, designed for 3D-problems, can also be applied for the 2D case, and — for simplicity — we apply the tools to study the convergence behaviour for the anisotropic Poisson equation for this 2D case.     

A PICARD TYPE THEOREM AND BLOCH LAW

Ａ ＰＩＣＡＲＤ ＴＹＰＥ ＴＨＥＯＲＥＭ ＡＮＤ ＢＬＯＣＨ ＬＡＷ ￥ＹＥＹＡＳＨＥＮＧＡｂｓｔｒａｃｔ：Ａｐｉｃａｒｄｔｙｐｅｔｈｅｏｒｅｍｉｓｐｒｏｖｅｄ，ａｎｄａｃｏｕｎｔｅｒｅｘａｍｐｌｅｉｓｇｉｖｅｎｔｏｓｈｏｗｔｈａｔｔｈｅＢｏｌｃｈ...     

Tangent cones and Dini derivatives

We prove a property of the Bouligand tangent cone to the epigraph (or to the graph) of a locally Lipschitz function. It is also shown how this result can be used in determining Dini sequences. Finally, some relationships between such a cone and Dini derivatives are provided.     

Hypersurface with Constant Main Curvature Symmetric Functions

ＨｙｐｅｒｓｕｒｆａｃｅｗｉｔｈＣｏｎｓｔａｎｔＭａｉｎＣｕｒｖａｔｕｒｅＳｙｍｍｅｔｒｉｃＦｕｎｃｔｉｏｎｓ￥ＷｕＢａｏｑｉａｎｇ；ＳｏｎｇＨｏｎｇｚａｏ（ＸｕｚｈｏｕＴｅａｃｈｅｒｓＣｏｌｌｅｇｅ，２２１００９）（ＨｅｎａｎＵｎｉｖｅｒｓｉｔｙ，...