Hermite Interpolation of Data Sets by Minimal Spline Spaces

Hermite interpolation of 2n + k data by spline spaces of order k with n variable knots counting multiplicities is studied. A characterization of the minimal spline spaces which admit a solution of the interpolation problem is obtained. A sufficient condition on uniqueness of interpolating spline functions is given.     

用实二次型理论解多元函数的极值问题

文章以二次型理论为依据,提出了解决多元函数极值问题的另一种方法.     

Estimates for Elements of Inverse Matrices for a Class of Operators with Matrices of Special Structure

In this paper, we consider questions related to the structure of inverse matrices of linear bounded operators acting in infinite-dimensional complex Banach spaces. We obtain specific estimates of elements of inverse matrices for bounded operators whose matrices have a special structure. Matrices are introduced as special operator-valued functions on an index set. The matrix structure is described by the behavior of the given function on elements of a special partition of the index set. The method used for deriving the estimates is based on an analysis of Fourier series of strongly continuous periodic functions.     

One-dimensional non-nearest-neighbor random walks in the presence of traps

A one-dimensional lattice random walk in the presence ofm equally spaced traps is considered. The step length distribution is a symmetric exponential. An explicit analytic expression is obtained for the probability that the random walk will be trapped at thejth trapping site.     

Fixed point theorems in metric spaces

In this paper, we establish two general theorems for equivalence between the Meir–Keeler type contractive conditions and the contractive definitions involving gauge functions. One of these theorems is an extension of a recent result of Lim (On characterization of Meir–Keeler contractive maps, Nonlinear Anal. 46 (2001) 113–120).     

Dual Characterizations of Set Containments with Strict Convex Inequalities

Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which can be either weak or strict inequalities. Particular cases of dual characterizations of set containments have played key roles in solving large scale knowledge-based data classification problems where they are used to describe the containments as inequality constraints in optimization problems. The idea of evenly convex set (intersection of open half spaces), which was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments.     

Low-lying states of 6He studied via the 6Li(t,3He)6He reaction

We present the recent experimental results on the ⁶He structure studied by the ⁶Li(t, ³He)⁶He reaction at 336 MeV. Above the conspicuous peaks for ground and first excited states for ⁶He, we have observed a broad structures at E _x∼ 5 MeV, and E _x∼ 15 MeV. The angular distribution of this structure exhibits the dominance of a ΔL = 1 transition, indicating the existence of intruder dipole states at low excitation energies in ⁶He. A slight admixture of positive-parity states in this structure has been indicated as well. Received: 1 May 2001 / Accepted: 4 December 2001     

The Hadamard Theorem and Borel–Carathéodory Theorem on Riemann Surfaces

In this paper, we first define a kind of pseudo–distance function and annulus domain on Riemann surfaces, then prove the Hadamard Theorem and the Borel–Carathéodory Theorem on any Riemann surfaces. Supported by NSFC 10501052     

Minimax Results and Finite-Dimensional Separation

In this paper, we review and unify some classes of generalized convex functions introduced by different authors to prove minimax results in infinite-dimensional spaces and show the relations between these classes. We list also for the most general class already introduced by Jeyakumar (Ref. 1) an elementary proof of a minimax result. The proof of this result uses only a finite-dimensional separa- tion theorem; although this minimax result was already presented by Neumann (Ref. 2) and independently by Jeyakumar (Ref. 1), we believe that the present proof is shorter and more transparent.     

Reductions of interval noncooperative games

Noncooperative games of a finite number of persons with interval-valued payoff functions are considered. The concept of an equilibrium situation is introduced. A reduction of such games to deterministic noncooperative games is proposed. Properties of the reduced games are discussed. Interval antagonistic and bimatrix games are examined, and illustrative examples are considered.