Volume 18, pp. 81-90, 2004.
Some theoretical results derived from polynomial numerical hulls of Jordan blocks
Anne Greenbaum
Abstract
The polynomial numerical hull of degree for a square matrix
is a set in the complex plane designed to give useful information
about the norms of functions of the matrix; it is defined as
In a previous paper [V. Faber, A. Greenbaum, and D. Marshall,
The polynomial numerical hulls of Jordan blocks and related
matrices, Linear Algebra Appl., 374 (2003), pp. 231–246]
analytic expressions
were derived for the polynomial numerical hulls of Jordan blocks.
In this paper, we explore some consequences of these results.
We derive lower bounds on the norms of functions of Jordan blocks
and triangular Toeplitz matrices that approach equalities as the
matrix size approaches infinity. We demonstrate that even for
moderate size matrices these bounds give fairly good estimates
of the behavior of matrix powers, the matrix exponential, and the
resolvent norm. We give new estimates of the convergence rate
of the GMRES algorithm applied to a Jordan block. We also derive
a new estimate for the field of values of a general Toeplitz matrix.
Full Text (PDF) [284 KB],
BibTeX
Key words
polynomial numerical hull, field of values, Toeplitz matrix.
AMS subject classifications
15A60, 65F15, 65F35.
Links to the cited ETNA articles
[1] |
Vol. 18 (2004), pp. 1-41 Albrecht Böttcher:
Transient behavior of powers and exponentials of large Toeplitz matrices
|
ETNA articles which cite this article
Vol. 26 (2007), pp. 453-473 Petr Tichý, Jörg Liesen, and Vance Faber:
On worst-case GMRES, ideal GMRES, and the polynomial numerical hull of a Jordan block
|