What is the condition number?
A n x n matrix with fewer than n nonzero singular values is singular, such a matrix has a condition number of infinity.
Why does condition number matter?
Any matrix that isnβt of full rank is singular. Any singular matrix has a condition number infinity. Any matrix with a very large condition number is considered ill-conditioned. The larger the condition number, the closer the matrix is to being singular.
A matrix being ill-condition is bad since when doing computerized matrix arithmetic, small errors will add up when dealing with ill-conditioned matrices, resulting in large errors in the solution.
How does low rank approxmation work?
Say you have a ill-conditioned matrix with rank r. Instead of doing SVD on the whole matrix, take a number k such that and decompose the matrix like so:
.
where: : first k columns of P : top left k x k block of singular values : first k columns of Q
has rank k and among all matrices B of rank k, minimizes .
What is the Gershgorin Circle Theorem?
All real and complex eigenvalues of the matrix A like in its Gershgorin domain . Let be an n x n matrix. For each , define the ith Gershgorin disk: , where .
The full Gershgorin domain is the union of all .
What is Diagonal Dominance?
A matrix is strictly diagonally dominant if: , for all i. A strictly diagonally dominant matrix is non-singular.