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     

The change of the superstructure of semicrystalline polymers during deformation: results from small-angle scattering with synchrotron radiation

The change of the superstructure of different polyethylenes during uniaxial deformation is investigated. The method used is small-angle scattering with synchrotron radiation. For branched polyethylene (Lupolen 1840D) the whole deformation range is analyzed. Beginning with superstructure of the lamellar cluster type, the superstructure partly disappears on a time scale of a few minutes and the fibrillar structure is built up. The degree of destruction and rebuilding depends on the drawing temperature. For very high molecular weight polyethylene (GUR) a reversible change of the superstructure at higher deformation ratios and at different temperatures is observed. The superstructure of (ethylene—hexene) copolymers (TIPELIN) at high draw ratios depends on the drawing temperature and is almost independent of the side group content. Interfibrillar microcracks parallel to the draw direction are produced in samples with a low side group content for draw ratios λ ≥ 1.5.     

Lebesgue constants for periodic Hermite spline interpolation operators on uniform lattices

We derive a complex line integral representation for the ebyshev norm of periodic spline interpolation operators of odd degree on uniform lattices. Several generalizations are indicated.     

About the Linear Stability of the Spherically Symmetric Solution for the Equations of a Barotropic Viscous Fluid under the Influence of Self-Gravitation

This paper is concerned with the question of linear stability of motionless, spherically symmetric equilibrium states of viscous, barotropic, self-gravitating fluids. We prove the linear asymptotic stability of such equilibria with respect to perturbations which leave the angular momentum, momentum, mass and the position of the center of gravity unchanged. We also give some decay estimates for such perturbations, which we derive from resolvent estimates by means of analytic semigroup theory.     

Eliminating graphs by means of parallel knock-out schemes

In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex eliminates exactly one of its neighbors. The parallel knock-out number of a graph is the minimum number of rounds after which all vertices have been eliminated (if possible). The parallel knock-out number is related to well-known concepts like perfect matchings, hamiltonian cycles, and 2-factors.We derive a number of combinatorial and algorithmic results on parallel knock-out numbers: for families of sparse graphs (like planar graphs or graphs of bounded tree-width), the parallel knock-out number grows at most logarithmically with the number n of vertices; this bound is basically tight for trees. Furthermore, there is a family of bipartite graphs for which the parallel knock-out number grows proportionally to the square root of n. We characterize trees with parallel knock-out number at most 2, and we show that the parallel knock-out number for trees can be computed in polynomial time via a dynamic programming approach (whereas in general graphs this problem is known to be NP-hard). Finally, we prove that the parallel knock-out number of a claw-free graph is either infinite or less than or equal to 2.