References
- Kung , HT and Suter , BW . 2007 . A hub matrix theory and applications to wireless communications . EURASIP J. Adv. Signal Process. 2007 , : 60
- Shen , L and Suter , BW . 2009 . Bounds for eigenvalues of arrowhead matrices and their applications to hub matrices and wireless communications . EURASIP J. Adv. Signal Process., Article ID 379402, , 2009 (12 pages)
- Boley , D and Golub , G . 1987 . A survey of matrix inverse eigenvalue problems . Inverse Probl. , 3 : 595 – 622 .
- Horn , RA and Johnson , CR . 1985 . Matrix Analysis , Cambridge, , UK : Cambridge University Press .
- O'Leary , DP and Stewart , GW . 1990 . Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices . J. Comput. Phys. , 90 : 497 – 505 .
- Wolkowicz , H and Styan , G . 1980 . Bounds for eigenvalues using traces . Linear Algebra Appl. , 29 : 471 – 506 .
- Bhatia , R . 1997 . “ Matrix Analysis ” . In Volume of 169 Graduate Texts in Mathematics , New York : Springer-Verlag .
- I. Daubechies, Ten Lectures on Wavelets, Volume 61 of CBMS Conference Series in Applied Mathematics, SIAM, Philadelphia, 1992.
- Casazza , P and Kovacevic , J . 2003 . Equal-norm tight frames with erasures . Adv. Comput. Math. , 18 : 387 – 430 .
- Holmes , RB and Paulsen , VI . 2004 . Optimal frames for erasures . Linear Algebra Appl. , 377 : 31 – 51 .
- Strohmer , T and Heath , R . 2003 . Grassmannian frames with applications to coding and communications . Appl. Comput. Harmonic Anal. , 14 : 257 – 275 .
- Tropp , J . 2004 . Greed is good: Algorithmic results for sparse approximation . IEEE Trans. Inform. Theory , 50 : 2231 – 2242 .
- Malozemov , V and Pevnyi , A . 2009 . Equiangular tight frames . J. Math. Sci. , 157 : 3 – 25 .
- Rao , KR and Yip , P . 1990 . Discrete Cosine Transform: Algorithms, Advantages, Applications , Boston : Academic Press .