LU decomposition: Difference between revisions
Content added Content deleted
m (used a section header instead of a bold font.) |
m (fixed a typo.) |
||
| Line 127: | Line 127: | ||
;Task description: |
;Task description: |
||
The task is to implement a routine which will take a square nxn matrix <math>A</math> and return a lower triangular matrix <math>L</math>, a upper triangular matrix <math>U</math> and a permutation matrix <math>P</math>, |
The task is to implement a routine which will take a square nxn matrix <math>A</math> and return a lower triangular matrix <math>L</math>, a upper triangular matrix <math>U</math> and a permutation matrix <math>P</math>, |
||
so that the above equation is |
so that the above equation is fulfilled. |
||
You should then test it on the following two examples and include your output. |
You should then test it on the following two examples and include your output. |
||