Approximate factorization seems for certain problems a viable alternative to time splitting. Since a splitting error is avoided, accuracy will in general be favourable compared to time splitting methods. However, it is not clear to what extent stability is a ected by factorization. Therefore we study here the e ects of factorization on a simple, low order method, namely the -method. For this si...

We study some classes of generalized convex functions, using a generalized di¤erential approach. By this we mean a set-valued mapping which stands either for a derivative, a subdi¤erential or a pseudodi¤erential in the sense of Jeyakumar and Luc. We establish some links between the corresponding classes of pseudoconvex, quasiconvex and another class of generalized convex functions we introduced...

We study a formal speci cation of the shared data space architecture, JavaSpaces. This Java technology provides a virtual space for entities, like clients and servers, to communicate by sharing objects. We use CRL, a language that combines abstract data types with process algebra, to model an abstraction of this coordination architecture. Besides the basic primitives write, read and take, our m...

The paper serves as an introduction to etale cohomology of rigid analytic spaces. A number of basic results are proved, e.g. concerning cohomological dimension, base change, invariance for change of base elds, the homotopy axiom and comparison for etale cohomology of algebraic varieties. The methods are those of classical rigid analytic geometry and along the way a number of known results on ri...

The problem of minimizing a polynomial function in several variables over Rn is considered and an algorithm is given. When the polynomial has a minimum the algorithm returns the global minimum and nds at least one point in every connected component of the set of minimizers. A characterization of such points is given. When the polynomial does not have a minimum the algorithm can compute its in m...

The aim of this paper is to construct an e¢ cient iterative method to solve nonlinear equations. This method is obtained from M. Javidi’s method (Appl. Math. Comput. 193 (2007) 360-365), which is third-order. The convergence order of new method is established to six and the e¢ ciency index is 1.5651. The Proposed method is compared with the second, third and sixth order methods. Some numerical ...

In the variable-sized online bin packing problem, one has to assign items to bins one by one. The bins are drawn from some xed set of sizes, and the goal is to minimize the sum of the sizes of the bins used. We present the rst unbounded space algorithms for this problem. We also show the rst lower bounds on the asymptotic performance ratio. The case where bins of two sizes, 1 and 2 (0; 1), are ...

The paper contains a detailed computation about the algebra of canonical commutation relation, the representation of the Weyl unitaries, the quasi-free states and their von Neumann entropy. The Markov triplet is de ned by constant entropy increase. The Markov property of a quasi-free state is described by the representing block matrix. The proof is based on results on the statistical su ciency ...

In this paper, we study the position value for games in which partial cooperation exist, that is based on a union stable coalition system. The concept of basis is introduced for these systems, allowing for a de...nition of the position value. Moreover, an axiomatic characterization of the position value is provided for a speci...c class of union stable systems. Conditions under which convexity ...

A nite-volume method is presented for the computation of compressible ows of two immiscible uids at very di erent densities. The novel ingredient in the method is a twouid linearized Godunov scheme, allowing for ux computations in case of di erent uids (e.g., water and air) left and right of a cell face. A level-set technique is employed to distinguish between the two uids. The level-set equati...