Bounds for eigenvalues of arrowhead matrices and their applications to hub matrices and wireless communications
DOI10.1155/2009/379402zbMATH Open1192.15018DBLPjournals/ejasp/ShenS09OpenAlexW2158226585WikidataQ59249126 ScholiaQ59249126MaRDI QIDQ983750FDOQ983750
Authors: Bruce W. Suter, Lixin Shen 
Publication date: 26 July 2010
Published in: EURASIP Journal on Advances in Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2009/379402
Recommendations
- Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
- The eigenvalue problem for ‘‘arrow’’ matrices
- Computational Science and Its Applications – ICCSA 2004
- A hub matrix theory and applications to wireless communications
- On the inverse eigenproblem for symmetric and nonsymmetric arrowhead matrices
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Communication networks in operations research (90B18) Special matrices (15B99)
Cites Work
- A survey of matrix inverse eigenvalue problems
- Two inverse eigenvalue problems for a special kind of matrices
- Bounds for eigenvalues using traces
- Matrices with prescribed Ritz values
- Extremal inverse eigenvalue problem for bordered diagonal matrices
- A hub matrix theory and applications to wireless communications
Cited In (5)
- A hub matrix theory and applications to wireless communications
- Associating hub-directed multigraphs to arrowhead matrices
- Inversion and pseudoinversion of block arrowhead matrices
- On the inverse eigenproblem for symmetric and nonsymmetric arrowhead matrices
- Some results on structured \(M\)-matrices with an application to wireless communications
This page was built for publication: Bounds for eigenvalues of arrowhead matrices and their applications to hub matrices and wireless communications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q983750)
