About: Tridiagonal matrix algorithm is a research topic. Over the lifetime, 1070 publications have been published within this topic receiving 21084 citations.
TL;DR: In this article, the authors give sufficient conditions for the c -numerical range of a tridiagonal matrix to be an elliptic disc, which generalizes known results on the classical numerical range.
TL;DR: A simple linear systolic array is presented for triangularizing a symmetric tridiagonal matrix by Gaussian Elimination using nearest neighbor pivoting.
TL;DR: In this paper, it was proved that in a large class of bounded tridiagonal operators (infinite Jacobi matrices), not necessarily positive or non-negative, positive eigenvalues exist and the eigenvector which corresponds to the greatest of them can be taken strictly positive.
Abstract: It is proved that in a large class of bounded tridiagonal operators (infinite Jacobi matrices), not necessarily positive or non-negative, positive eigenvalues exist and the eigenvector which corresponds to the greatest of them can be taken strictly positive. It is the unique positive eigenvector up to a constant multiple.