Mean value in invexity analysis

In this paper, a generalization of the mean value theorem is considered in the case of functions defined on an invex set with respect to η (which is not necessarily connected).     

On an extension of the concept of TU-games and their values

We propose a new more general approach to TU-games and their efficient values, significantly different from the classical one. It leads to extended TU-games described by a triplet \((N,v,\Omega )\), where (N, v) is a classical TU-game on a finite grand coalition N, and \(\Omega \in {\mathbb {R}}\) is a game worth to be shared between the players in N. Some counterparts of the Shapley value, the equal division value, the egalitarian Shapley value and the least square prenucleolus are defined and axiomatized on the set of all extended TU-games. As simple corollaries of the obtained results, we additionally get some new axiomatizations of the Shapley value and the egalitarian Shapley value. Also the problem of independence of axioms is widely discussed.     

The jump of the Milnor number in the X 9 singularity class

The jump of the Milnor number of an isolated singularity f ₀ is the minimal non-zero difference between the Milnor numbers of f ₀ and one of its deformations (f _s ). We prove that for the singularities in the X ₉ singularity class their jumps are equal to 2.     

Lattice valued intuitionistic fuzzy sets

In this paper a new definition of a lattice valued intuitionistic fuzzy set (LIFS) is introduced, in an attempt to overcome the disadvantages of earlier definitions. Some properties of this kind of fuzzy sets and their basic operations are given. The theorem of synthesis is proved: For every two families of subsets of a set satisfying certain conditions, there is an lattice valued intuitionistic fuzzy set for which these are families of level sets. The research supported by Serbian Ministry of Science and Technology, Grant No. 1227.     

Functional differential equations

The method of quasilinearization is a well-known technique for obtaining approximate solutions of nonlinear differential equations. In this paper we apply this technique to functional differential problems. It is shown that linear iterations converge to the unique solution and this convergence is superlinear.     

Nonlinear Cauchy-Riemann operators in

This paper has arisen from an effort to provide a comprehensive and unifying development of the -theory of quasiconformal mappings in . The governing equations for these mappings form nonlinear differential systems of the first order, analogous in many respects to the Cauchy-Riemann equations in the complex plane. This approach demands that one must work out certain variational integrals involving the Jacobian determinant. Guided by such integrals, we introduce two nonlinear differential operators, denoted by and , which act on weakly differentiable deformations of a domain .

Solutions to the so-called Cauchy-Riemann equations and are simply conformal deformations preserving and reversing orientation, respectively. These operators, though genuinely nonlinear, possess the important feature of being rank-one convex. Among the many desirable properties, we give the fundamental -estimate

In quest of the best constant , we are faced with fascinating problems regarding quasiconvexity of some related variational functionals. Applications to quasiconformal mappings are indicated.

     

Parallel implementation of the p‐version of the finite element method for elliptic equations on a shared‐memory architecture

An implementation of the p‐version of the finite element method for solving two‐dimensional linear elliptic problems on a shared‐memory parallel computer is analyzed. The idea is to partition the problem among the available processors and perform computations corresponding to different elements in parallel. The parallelization is based on a domain decomposition technique using the Lagrange multipliers. The numerical experiments carried out on the Sequent system indicate very high performance of the mixed finite element algorithm in terms of attained speedups. This revised version was published online in August 2006 with corrections to the Cover Date.