… In addition to ordering symmetric matrices, the minimum degree algorithm has been
shown to be an effective column ordering algorithm for unsymmetric matrices. Given an
unsymmetric matrix A, it has been shown that a symmetric order of A� A is a good column
ordering of A. The following theorems present bounds on the structure of either LU or QR
factorization of A based upon the symmetric factorization of A� A. George and Ng [19]
showed the following theorem in reference to LU factorization with partial pivoting. … 2.10�…