On estimates of the spectrum of a linear operator
Sergey M. Ermakov, K. O. Vidyaeva · Vestnik St Petersburg University Mathematics · 2012
The paper is concerned with new approaches to the analysis of spectra of linear operators. New algorithms are proposed to calculate the coefficients of the minimal polynomial of a matrix; they are based on the well-known Krylov’s method, SSA decomposition, and the “Caterpillar” method of recurrent translation. The extension obtained is capable of dealing with matrices of infinite order; this has great value in solving queuing problems. Results from numerical experiments for matrices of various orders are given.