LU decomposition: Difference between revisions

m
correction: there stood "columns" where rows was meant
m (correction: there stood "columns" where rows was meant)
Line 98:
We see in the second formula that to get the <math>l_{ij}</math> below the diagonal, we have to divide by the diagonal element (pivot) <math>u_{jj}</math>, so we get problems when <math>u_{jj}</math> is either 0 or very small, which leads to numerical instability.
 
The solution to this problem is ''pivoting'' <math>A</math>, which means rearranging the rows of <math>A</math>, prior to the <math>LU</math> decomposition, in a way that the largest element of each column gets onto the diagonal of <math>A</math>. Rearranging the columnsrows means to multiply <math>A</math> by a permutation matrix <math>P</math>:
 
:<math>PA \Rightarrow A'</math>
Anonymous user