FIELDS OF VALUES AND ITERATIVE METHODS

The performance of an iterative scheme to solve x = T x + c, T is-an-element-of C(nXn), c is-an-element-of C(n) is often judged by spectral properties of T. If T is not normal, it is however well known that only conclusions about the assymptotic behavior of an iterative method can be drawn from spectral information. To anticipate the progress of the iteration after a finite number of steps, the knowledge of the eigenvalues alone is often useless. in addition, the spectrum of T may be highly sensitive to perturbations if T is not normal. An iterative method which-on the basis of some spectral information-is predicted to converge rapidly for T may well diverge if T is slightly perturbed. In practice, the convergence of the iteration X(m) = Tx(m-1) + c is there fore frequently measured by some norm \\T\\, rather than by the spectral radius rho(T). But apart from the fact that norms lead to error estimates which are often too pessimistic, they cannot be used to analyze more general schemes such as, e.g., the Chebyshev iterative methods. Here, we discuss another tool to analyze the behavior of an iterative method, namely the field of values W(T), the collection of all Rayleigh quotients of T. W(T) contains the eigenvalues of T, and the numerical radius mu(T) = max(z is-an-element-of W(T))\z\ defines a norm on C(nXn). The field of values represents therefore an ''intermediate concept'' to judge an iterative scheme by-it is related to the spectral approach but bas also certain norm properties.