Arnoldi iteration and Chebyshev polynomials
In this thesis, we examine the Arnoldi iteration - an iterative algorithm used for finding a Hessenberg form of a matrix as well as approximating its eigenvalues by forming an orthonormal basis of a Krylov subspace. We explore the mechanism behind the work of the algorithm and how the values it finds approximate the eigenvalues. In the process of answering these questions we consider the concepts
