On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Algorithm-based fault tolerance applied to high performance computing
Journal of Parallel and Distributed Computing
Optimal real number codes for fault tolerant matrix operations
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Speeding-up lattice reduction with random projections
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Constructing numerically stable real number codes using evolutionary computation
Proceedings of the 12th annual conference on Genetic and evolutionary computation
On the condition number distribution of complex wishart matrices
IEEE Transactions on Communications
Augmented lattice reduction for MIMO decoding
IEEE Transactions on Wireless Communications
A Randomized Algorithm for Principal Component Analysis
SIAM Journal on Matrix Analysis and Applications
The Exact Distribution of the Condition Number of a Gaussian Matrix
SIAM Journal on Matrix Analysis and Applications
Algorithm-based recovery for iterative methods without checkpointing
Proceedings of the 20th international symposium on High performance distributed computing
Smoothed Analysis of Moore-Penrose Inversion
SIAM Journal on Matrix Analysis and Applications
A Fast Randomized Algorithm for Orthogonal Projection
SIAM Journal on Scientific Computing
Efficient sketches for the set query problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
Correcting soft errors online in LU factorization
Proceedings of the 22nd international symposium on High-performance parallel and distributed computing
Hi-index | 0.00 |
Let $G_{m \times n}$ be an $m \times n$ real random matrix whose elements are independent and identically distributed standard normal random variables, and let $\kappa_2(G_{m \times n})$ be the 2-norm condition number of $G_{m \times n}$. We prove that, for any $m \geq 2$, $n \geq 2$, and $x \geq |n-m|+1$, $\kappa_2(G_{m \times n})$ satisfies ${\scriptsize \frac{1}{\sqrt{2\pi}}} ( { c }/{x} )^{|n-m|+1} x )}