Algorithms for Computing Bases for the Perron Eigenspace with PrescribedNonnegativity and Combinatorial Properties
Let $P$ be an $n \times n$ nonnegative matrix. In this paper the authors introduce a method called the SCANBAS algorithm for computing a union of (Jordan) chains $\cal{C}$ corresponding to the Perron eigenvalue of $P$, such that $\cal{C}$ consists of nonnegative vectors only and such that at each height, $\cal{C}$ contains the maximal number of nonnegative vectors of that height possible in a height basis for the Perron eigenspace of $P$. It is further shown that $\cal{C}$ can be extended to a height basis for the Perron eigenspace of $P$. The chains are extracted from transform components of $P$ that are, in turn, polynomials in $P$. When the Perron eigenspace has a Jordan basis consisting of nonnegative vectors only, this algorithm computes such a basis. The paper concludes with various examples computed by the algorithm using MATLAB. The work here continues and deepens work on computing nonnegative bases for the Perron eigenspace from polynomials in the matrix already begun by Hartwig, Neumann, and Rose and by Neumann and Schneider.

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

title: On the square roots of strictly quasiaccretive complex matrices
abstract: The square roots of a complex n × n matrix A for which the real part of e ix A , where χϵ[ −π 2 , π 2 ] , is positive definite are investigated. It is shown, for example, that when χ= −π 2 (i.e., A is strictly dissipative), A has a unique square root whose real and imaginary parts are both positive definite.

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: 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: 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: On the Strassen disintegration theorem

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

title: Continuity of sublinear operators on F-spaces
abstract: In this note, some of the fundamental theorems concerning the automatic continuity of positive linear functionals and positive linear operators (see [9,14,21]) as well as certain uniform boundedness type theorems (see [5,13,15,19]) will be extended to derive various continuity properties of (even discontinuous) sublinear operators from some metrizable topological vector space to some ordered topological vector space.

title: A maximality theorem concerning extreme points

title: Automatic Continuity of Linear Operators
abstract: The present survey is essentially based on some recent automatic continuity results which have been obtained by Ernst Albrecht and the author in the joint papers [1;2;3]. In contrast to the excellent account of automatic continuity theory in Sinclair's lecture notes [29] and in Dales' recent survey article , the emphasis of the present exposition lies on the automatic continuity problem for linear operators acting between spaces of functions and distributions. The continuity of such operators will be derived from certain conditions which naturally arise in the theory of linear systems, namely from time-invariance and causality on the one side and from dissipativity on the other. The automatic continuity of all time-invariant and causal linear operators turns out to be just one achievement of a far-reaching new theory on automatic continuity which also applies to the problem of continuity for algebrahomomorphisms, derivations, intertwining operators, and local operators. Some central features of this theory will be sketched; in particular, some extensions and variants of the classical principle of uniform boundedness will be discussed.