Rank estimation for (approximately) low-rank matrices
Abstract
References
Recommendations
A Krylov subspace based low-rank channel estimation in OFDM systems
We investigate a low-rank minimum mean-square error (MMSE) channel estimator in orthogonal frequency division multiplexing (OFDM) systems. The proposed estimator is derived by using the multi-stage nested Wiener filter (MSNWF) identified in the ...
An Implicit Multishift $QR$-Algorithm for Hermitian Plus Low Rank Matrices
Hermitian plus possibly non-Hermitian low rank matrices can be efficiently reduced into Hessenberg form. The resulting Hessenberg matrix can still be written as the sum of a Hermitian plus low rank matrix. In this paper we develop a new implicit ...
Compressing Rank-Structured Matrices via Randomized Sampling
Randomized sampling has recently been proven a highly efficient technique for computing approximate factorizations of matrices that have low numerical rank. This paper describes an extension of such techniques to a wider class of matrices that are not ...
Comments
Information & Contributors
Information
Published In
![cover image ACM SIGMETRICS Performance Evaluation Review](/cms/asset/1e98c054-7555-44b4-aa82-a2a73d6e7113/3512798.cover.jpg)
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 55Total Downloads
- Downloads (Last 12 months)10
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in