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 paper, the invertibility and conditioning of tridiagonal and irreducible matrices are studied. But the results in this paper are restricted to a singular perturbation boundary value problem.
TL;DR: In this paper, it was shown that if the process of Gaussian elimination with complete pivoting is applied to A then all the pivots are less than or equal to n in absolute value.
Abstract: LetA = (a ij ) be a real n x n matrix such that |a ij | < 1. It has been conjectured by WILKINSON that if the process of Gaussian elimination with complete pivoting is applied to A then all the pivots are less than or equal to n in absolute value. This conjecture is proved forn=4.
TL;DR: The level spacing distribution of general, non-normal, Gaussian random 2D matrices is derived in this article, where tridiagonal matrices have no level repulsion and show a half-sided Gaussian distribution.
Abstract: The level spacing distribution of general, non-normal, Gaussian random 2D matrices is derived. In particular, tridiagonal matrices have no level repulsion and show a halfsided Gaussian distribution. General non-normal matrices show strong level repulsion. The repulsion exponent is 2 − 0log.
TL;DR: In this paper, a new proof of a theorem of Chandler-Wilde, Chonchaiya, and Lindner that the spectra of a certain class of infinite, random, tridiagonal matrices contain the unit disc almost surely was provided.
Abstract: This paper provides a new proof of a theorem of Chandler-Wilde, Chonchaiya, and Lindner that the spectra of a certain class of infinite, random, tridiagonal matrices contain the unit disc almost surely. It also obtains an analogous result for a more general class of random matrices whose spectra contain a hole around the origin. The presence of the hole forces substantial changes to the analysis.