computation of antieigenvalues计算antieigenvalues.pdfVIP

COMPUTATION OF ANTIEIGENVALUES MORTEZA SEDDIGHIN Received 22 July 2004 and in revised form 4 December 2004 ˘ We will use a theorem by M. G. Kreın and properties of the numerical range of an opera- tor to develop a method of computation for the first antieigenvalue of a strictly accretive operator. 1. Introduction An operator on a Hilbert space is called accretive if Re( T f ,f ) ≥ 0 and strictly accretive if Re(T f ,f ) 0, for every vector f . For an accretive operator or matrix T on a Hilbert space, the first antieigenvalue of T, denoted by µ1(T), is defined by Gustafson to be Re(T f ,f ) µ1(T) = inf (1.1) T f = 0 T f f (see [3, 4, 5]). The quantity µ1(T) is also denoted by cos T and is called the cosine of T. Definition (1.1) is equivalent to Re(T f ,f ) µ1(T) = inf . (1.2) T f = 0 T f f =1 µ1(T) measures the maximum turning capability of T. A vector f for which the inf in (1.1) is attained is called an antieigenvector of T. Cosine of T has important applications in pure operator theory as well as numerical analysis (see [3, 4, 6]). In [7, 8, 11], we have computed the first antieigenvalue of normal accretive operators in terms of eigenvalues of these operators. In [12], we computed the first antieigenvalue for certain classes of ma- trices on the real field. In this note, we will focus on computation and approximation of the first antieigenvalue of general accretive operators. Our work in this note is a general- ization of our work in