Advertisement

Review of Matrix Factorization

Chapter
  • 177 Downloads
Part of the Series in Computer Science book series (SCS)

Abstract

Matrix factorization algorithms lie at the heart of many signal processing applications. For example, the problem of finding a vector x, such that Ax = b, where A is an m × n complex matrix and b is a complex n-length vector, is a particularly important and computationally intensive problem in adaptive beamforming applications. When mn, the problem is overdetermined- there are more equations than unknowns.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  1. 1.Mercury Computer System, Inc.ChelmsfordUSA
  2. 2.John Hopkins UniversityBaltimoreUSA

Personalised recommendations