Constructing Packings in Grassmannian Manifolds via Alternating Projection
From MaRDI portal
Publication:3546249
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 where 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.
Recommendations
- A group-theoretic framework for the construction of packings in Grassmannian spaces
- A notion of optimal packings of subspaces with mixed-rank and solutions
- A family of optimal packings in Grassmannian manifolds
- Families of optimal packings in real and complex Grassmannian spaces
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
Cited in
(24)- On Grassmannian frames with spectral constraints
- Grassmannian codes from paired difference sets
- Combinatorial constructions of packings in Grassmannian spaces
- Packings in real projective spaces
- Sphere-packing bounds in the Grassmann and Stiefel manifolds
- Harmonic Grassmannian codes
- Constructing subspace packings from other packings
- Robust dimension reduction, fusion frames, and Grassmannian packings
- Equi-isoclinic subspaces, covers of the complete graph, and complex conference matrices
- On block coherence of frames
- Harmonic equiangular tight frames comprised of regular simplices
- An efficient algorithm for overcomplete sparsifying transform learning with signal denoising
- Geometric mean and geodesic regression on Grassmannians
- New upper bounds for equiangular lines by pillar decomposition
- A group-theoretic framework for the construction of packings in Grassmannian spaces
- A family of optimal packings in Grassmannian manifolds
- Naimark-spatial families of equichordal tight fusion frames
- Optimal arrangements of classical and quantum states with limited purity
- Uniform recovery of fusion frame structured sparse signals
- Schubert varieties and distances between subspaces of different dimensions
- Equiangular subspaces in Euclidean spaces
- Families of optimal packings in real and complex Grassmannian spaces
- A notion of optimal packings of subspaces with mixed-rank and solutions
- Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations
This page was built for publication: Constructing Packings in Grassmannian Manifolds via Alternating Projection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546249)
