Existence of stationary,collisionless plasmas in bounded domains

We consider a collisionless plasma, which consists of electrons and positively charged ions and is confined to a bounded domain in ?³. The distribution functions of the particles are assumed to satisfy specular reflections on the boundary of the domain and the boundary is assumed to be perfectly conducting. We establish the existence of stationary plasmas in the non-relativistic, electrostatic case described by the Vlasov–Poisson system as well as in the relativistic, electrodynamic case described by the relativistic Vlasov–Maxwell system.     

Subgroup separable free products with cyclic amalgamation

Using topological methods we give a proof that the free product of two strict subgroup separable groups with infinite cyclic amalgamation is subgroup separable.     

Approaches to sharing knowledge in group problem structuring

Problem-structuring techniques are an integral aspect of ‘Soft-OR’. SSM, SAST, Strategic Choice, and JOURNEY Making, all depend for their success on a group developing a shared view of a problem through some form of explicit modelling. The negotiated problem structure becomes the basis for problem resolution. Implicit to this process is an assumption that members of the group share and build their knowledge about the problem domain. This paper explores the extent to which this assumption is reasonable. The research is based on detailed records from the use of JOURNEY Making, where it has used special purpose Group Support software to aid the group problem structuring. This software continuously tracks the contributions of each member of the group and thus the extent to which they appear to be ‘connecting’ and augmenting their own knowledge with that of other members of the group. Software records of problem resolution in real organisational settings are used to explore the sharing of knowledge among senior managers. These explorations suggest a typology of knowledge sharing. The implications of this typology for problem structuring and an agenda for future research are considered.     

Field-of-values analysis of preconditioned iterative methods for nonsymmetric elliptic problems

Summary. The convergence rate of Krylov subspace methods for the solution of nonsymmetric systems of linear equations, such as GMRES or FOM, is studied. Bounds on the convergence rate are presented which are based on the smallest real part of the field of values of the coefficient matrix and of its inverse. Estimates for these quantities are available during the iteration from the underlying Arnoldi process. It is shown how these bounds can be used to study the convergence properties, in particular, the dependence on the mesh-size and on the size of the skew-symmetric part, for preconditioners for finite element discretizations of nonsymmetric elliptic boundary value problems. This is illustrated for the hierarchical basis and multilevel preconditioners which constitute popular preconditioning strategies for such problems. Received May 3, 1996