A numerical solver has to solve for hundreds of different right-hand sides , so instead of eliminating from scratch every time it factors once and stores the two triangular pieces.
The factorization is , computed by ordinary elimination with no row swaps, using the standard convention:
| Factor | Shape | What its entries hold |
|---|---|---|
| lower triangular | s on the diagonal; below the diagonal, is the multiplier used to clear position | |
| upper triangular | whatever elimination leaves behind, zeros below the diagonal |
So is the multiplier that clears the entry in row 3, column 2, and is the third pivot — the bottom-right entry of .
Report the value of . Your answer is an exact integer.