Algorithm for computing an LU decomposition

Created almost 9 years ago, updated about 8 hours ago

For each pivot column $k$, select a nonzero pivot (swap rows if needed), compute multipliers $\ell_{ik}=a_{ik}/a_{kk}$, and subtract $\ell_{ik}$ times row $k$ from lower rows. The resulting upper triangular matrix is $U$; stored multipliers form $L$. If pivoting is used, previously stored multiplier columns must be swapped consistently. Check the result with $PA=LU$.

Like how this is organised?

Build your own knowledge tree on knowen.md: notes, decisions and tasks in one connected markdown graph, shared with your team and your AI agents.