Monotonic sequences and rates of convergence of asynchronized iterative methods
In a recent paper B. Vemmer and the authors investigated the effect of varying the number of processors on the rate of convergence of the asynchronized parallel block Jacobi method associated with monotone matrices. It was found that, under certain simplifying assumptions, increasing the number of processors in relation to the number of blocks (or, what comes to the same in more general settings, the number of iteration operators) slows down the convergence. One interpretation for these results given in that paper was that increasing the number of processors means that when the current global approximation is updated by a local approximation from one of the processors, that local approximation was computed from a “much” earlier global approximation received from the host node. Hence the slowdown in the rate of convergence. The principal purpose of this paper is to remove some of the simplifying assumptions that were made in the above-mentioned paper and to prove that many of the results there hold under much more general conditions. Our present assumptions do not yield a fixed iteration matrix which models the process as was the case previously. This means that different tools have to be developed to establish results comparing the rate of convergence of two assynchronized processes.

title: Cone reachability for linear differential systems
abstract: Given a real nxn matrix A and a simplicial cone which is positively invariant under the linear differential system , we consider the problem of characterizing the closure of the set XA(K) of all initial points x(0) ∈ Rn which give rise to solutions x(t) that enter (and remain in) K. An explicit characterization of the closure of XA(K) is given first in case A is diagon-able with a real spectrum. Subsequently a characterization for the closure of XA(K) is given in case there exist k ∈ int K such that −Ak ∈ K, but in the absence of any other explicit assumptions on A.

title: Corrections and additions to: "principal components of minus m-matrices"

title: The Kahan S.O.R. convergence bound for nonsingular and irreducible M-matrices
abstract: Let A be a nonsingular M -matrix, and let π be a block partitioning of A such that the diagonal blocks are square. Denote by J A π and A π ω the block Jacobi and the block S.O.R. iteration matrices arising from and associated with the partitioning π of A , respectively. In  Kahan showed that ρ ( A π ω J A π )]. Under the assumption that J A π is irreducible we examine the question of when ρ( A π ω' )=1 for certain recurring M -matrices.

title: A note on generalizations of strict diagonal dominance for real matrices
abstract: We investigate classes of real square matrices possessing some weakened from of strict diagonal dominance of a real matrix whose diagonal entries are all positive. The intersection of each one of these classes with the set of all real matrices, with nonpositive off-diagonal elements, coincides with the set of all nonsingular M - matrices.

title: A combined direct-iterative approach for solving large scale singular and rectangular consistent systems of linear equations
abstract: We construct a certain iterative scheme for solving large scale consistent systems of linear equations Ax = b , (*) where A is a complex m X n matrix of rank r , m ⩾ n , and where A is assumed reasonably well conditioned. The iterative method is obtained through a careful exploitation of an LU -decomposition of A , and, disregarding roundoff errors, it converges to a solution to ( * ), though not necessarily the minimal l 2 -norm one, from any starting vector in r iterations. Moreover, once the LU -decomposition of A is complete, only about r 3 /2 arithmetic operations (multiplications and divisions) are needed to execute the r iterations.

title: On the Strassen disintegration theorem

title: Bemerkungen zum von Neumannschen Minimaxtheorem

title: Varianten zum Konvergenzsatz von Simons und Anwendungen in der Choquettheorie