Spectrum through pseudospectrum
Abstract
We present an iteration for the computation of simple eigenvalues using a pseudospectrum approach. The most appealing characteristic of the proposed iteration is that it reduces the computation of a single eigenvalue to a small number of eigenvalue computations on Hermitian matrices. We show that this number is directly associated with the matrix pseudospectrum. We present numerical results and we discuss advantages and drawbacks of the method. We also discuss its relationship with an iteration that was proposed independently in [Stewart, O' Leary, ETNA, Vol 8, 1998].
Cite
@article{arxiv.math/0701368,
title = {Spectrum through pseudospectrum},
author = {Ioannis Koutis},
journal= {arXiv preprint arXiv:math/0701368},
year = {2007}
}
Comments
11 pages, 10 figures, This report was written in 2001 and it is a translation of work that was originally published in Greek, in the author's diploma thesis in July 1998. It may contain minor mistakes and should not be considered a complete study. It however touches upon several of the considerations that will be included in the complete paper. The work was done jointly with E. Gallopoulos and was presented at the FOCM99 conference, at the 5th IMACS conference on iterative methods in scientific computing, and at the 50th annual meeting of SIAM