In this paper we studied the classical numerical range of matrices in sp(2n, C). We obtained some result on the relationship between the numerical range of a matrix in and that [...] of its diagonal block, the singular values of its off-diagonal block A2.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Consider the Hilbert space (H,〈• , •〉) equipped with the indefinite inner product[u,v]=v*J u,u,v∈ H, where J is an indefinite self-adjoint involution acting on H. The Krein space numerical range WJ(T) of an operator T acting on H is the set of all the values attained by the quadratic form [Tu,u], with u ∈H satisfying [u,u]=± 1. We develop, implement and test an alternative algorithm to compute WJ(T) in the finite dimensional case, constructing 2 by 2 matrix compressions of T and their easily determined elliptical and hyperbolical numerical ranges. The numerical results reported here indicate that this method is very efficient, since it is faster and more accurate than either of the existing algorithms. Further, it may yield easy solutions for the inverse indefinite numerical range problem. Our algorithm uses an idea of Marcus and Pesce from 1987 for generating Hilbert space numerical ranges of matrices of size n.
3
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
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.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.