加载中…
Let , be a sequence of i.i.d. standard normal random variables. Consider rectangular Toeplitz and circulant matrices. Let so that . We prove that the smallest eigenvalue of converges to zero in probability and in expectation. We establish a lower bound on the rate of this convergence. The lower bound is faster than any poly-log but slower than any polynomial rate. For the ``rectangular circulant’’ matrices, we also establish a polynomial upper bound on the convergence rate, which is a simple explicit function of .

生成讲解博客的中文版本

生成AI智能校验的中文版本