Numerical analysis of Eigenvalue algorithms based on subspace iterations

P. Smit

Research output: ThesisDoctoral Thesis


Eigenvalue problems are important in many applications involving mathematical modelling. The development of hardware and software over the years has enlarged the class of problems that can be solved efficiently. In particular, the iterative algorithms that project the problem to low-dimensional subspaces are able to find eigenvalues of very large matrices. Several aspects of such algorithms are treated here from a theoretical point of view. After considering an upperbound of the errors in approximations of an eigenvector generated by the projection-procedure, the well-known Arnoldi algorithm is described as a function of its parameters in order to answer the question which parameters generate the same sequence of eigenvalue- approximations. Then some inexact subspace methods from three different classes are described and analysed. The inexactness is caused by the fact that the solutions of the systems of linear equations that occur in these algorithms, are not calculated exactly, but only approximated.
Original languageEnglish
QualificationDoctor of Philosophy
Awarding Institution
  • Tilburg University
  • Paardekooper, M.H.C., Promotor
Award date17 Oct 1997
Place of PublicationTilburg
Print ISBNs9056680269
Publication statusPublished - 1997


Dive into the research topics of 'Numerical analysis of Eigenvalue algorithms based on subspace iterations'. Together they form a unique fingerprint.

Cite this