Bounds for Eigenvalues of ArrowheadMatrices and Their Applications to HubMatrices andWireless Communications

Abstract

This paper considers the lower and upper bounds of Eigenvalues of arrow-head matrices. We propose a parameterized decomposition of an arrowhead matrix which is a sum of a diagonal matrix and a special kind of arrowhead matrix whose Eigenvalues can be computed explicitly. The Eigenvalues of the arrowhead matrix are then estimated in terms of Eigenvalues of the diagonal matrix and the special arrowhead matrix by using Weyl s theorem. Improved bounds of the Eigenvalues are obtained by choosing a decomposition of the arrowhead matrix which can provide best bounds. Some applications of these results to hub matrices and wireless communications are discussed.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2009
Accession Number
ADA548786

Entities

People

  • Bruce W. Suter
  • Lixin Shen

Organizations

  • Syracuse University

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Air Force
  • Air Force Research Laboratories
  • Calculus
  • Communication Systems
  • Eigenvalues
  • Inequalities
  • Interlacing
  • Intervals
  • Mathematics
  • Matrix Theory
  • Military Research
  • Multiple Input Multiple Output
  • Numbers
  • Real Numbers
  • Signal Processing
  • Theorems
  • Wireless Communications

Readers

  • Graph Algorithms and Convex Optimization.
  • Traumatic Brain Injury (TBI) and Cognitive Aging in the Guam and Border Populations Affected by Alzheimer's Disease and Tau-Associated Dementias.