The Lehmer Matrix and Its Recursive Analogue
Emrah Kılıç, Pantelimon Stănică · 2010
This paper considers the Lehmer matrix and its recursive analogue. The determinant of Lehmer matrix is derived ex-plicitly by both its LU and Cholesky factorizations. We fur-ther define a generalized Lehmer matrix with (i, j) entries gij = min {ui+1, uj+1} max {ui+1, uj+1} where un is the nth term of a binary sequence {un}. We derive both the LU and Cholesky factor-izations of this analogous matrix and we precisely compute the determinant. 1