CaltechAUTHORS
  A Caltech Library Service

Constructing Packings in Grassmannian Manifolds via Alternating Projection

Dhillon, I. S. and Heath, R. W., Jr. and Strohmer, T. and Tropp, J. A. (2008) Constructing Packings in Grassmannian Manifolds via Alternating Projection. Experimental Mathematics, 17 (1). pp. 9-35. ISSN 1058-6458. doi:10.1080/10586458.2008.10129018. https://resolver.caltech.edu/CaltechAUTHORS:20180831-112106252

[img] PDF - Accepted Version
See Usage Policy.

589kB

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20180831-112106252

Abstract

This paper describes a numerical method for finding good packings in Grassmannian manifolds equipped with various metrics. This investigation also encompasses packing in projective spaces. In each case, producing a good packing is equivalent to constructing a matrix that has certain structural and spectral properties. By alternately enforcing the structural condition and then the spectral condition, it is often possible to reach a matrix that satisfies both. One may then extract a packing from this matrix. This approach is both powerful and versatile. In cases in which experiments have been performed, the alternating projection method yields packings that compete with the best packings recorded. It also extends to problems that have not been studied numerically. For example, it can be used to produce packings of subspaces in real and complex Grassmannian spaces equipped with the Fubini–Study distance; these packings are valuable in wireless communications. One can prove that some of the novel configurations constructed by the algorithm have packing diameters that are nearly optimal.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.1080/10586458.2008.10129018DOIArticle
http://arxiv.org/abs/0709.0535arXivDiscussion Paper
ORCID:
AuthorORCID
Tropp, J. A.0000-0003-1024-1791
Additional Information:© 2007 A. K. Peters. Date: May 2004. Revised November 2006 and August 2007. ISD was supported by NSF grant CCF-0431257, NSF Career Award ACI-0093404, and NSF-ITR award IIS-0325116. RWH was supported by NSF CCF Grant #514194. TS was supported by NSF DMS Grant #0511461. JAT was supported by an NSF Graduate Fellowship, a J. T. Oden Visiting Faculty Fellowship, and NSF DMS 0503299.
Funders:
Funding AgencyGrant Number
NSFCCF-0431257
NSFACI-0093404
NSFIIS-0325116
NSFCCF-514194
NSFDMS-0511461
NSF Graduate Research FellowshipUNSPECIFIED
J. T. Oden Visiting Faculty FellowshipUNSPECIFIED
NSFDMS-0503299
Subject Keywords:Combinatorial optimization, packing, projective spaces, Grassmannian spaces, Tammes' Problem
Issue or Number:1
Classification Code:Primary 51N15, 52C17
DOI:10.1080/10586458.2008.10129018
Record Number:CaltechAUTHORS:20180831-112106252
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20180831-112106252
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:89329
Collection:CaltechAUTHORS
Deposited By: George Porter
Deposited On:04 Sep 2018 15:09
Last Modified:16 Nov 2021 00:34

Repository Staff Only: item control page