The Lehmer Matrix and Its Recursive Analogue

Abstract

This paper considers the Lehmer matrix and its recursive analogue. The determinant of Lehmer matrix is derived explicitly by both its LU and Cholesky factorizations. We further 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 factorizations of this analogous matrix and we precisely compute the determinant.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2010
Accession Number
ADA548860

Entities

People

  • Emrah Kilic
  • Pantelimon Stanica

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Analogs
  • Applied Mathematics
  • Binomials
  • Information Operations
  • Mathematics
  • Schools
  • Sequences
  • Standards

Fields of Study

  • Mathematics

Readers

  • Computer Programming and Software Development.
  • Exercise and Sports Science.
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)