We survey results related to the Kreiss Matrix Theorem, especially examining extensions of this theorem to Banach space and Hilbert space. The survey includes recent and established results together with proofs of many of the interesting facts concerning the Kreiss Matrix Theorem.
We discuss some numerical ranges for Lipschitz continuous nonlinear operators and their relations to spectral sets. In particular, we show that the spectrum defined by Kachurovskij (1969) for Lipschitz continuous operators is contained in the so-called polynomial hull of the numerical range introduced by Rhodius (1984).
The paper is devoted to an algorithm for computing matrices and for a given square matrix and a real . The algorithm uses the binary expansion of and has the logarithmic computational complexity with respect to . The problem stems from the control theory.
We introduce and study an envelope-type region ɛ(A) in the complex plane that contains the eigenvalues of a given n×n complex matrix A. ɛ(A) is the intersection of an infinite number of regions defined by cubic curves. The notion and method of construction of ɛ(A) extend the notion of the numerical range of A, F(A), which is known to be an intersection of an infinite number of half-planes; as a consequence, ɛ(A) is contained in F(A) and represents an improvement in localizing the spectrum of A.