LU decomposition: Difference between revisions
Content added Content deleted
m (added section headers, added whitespace before the TOC.) |
m (used a section header instead of a bold font.) |
||
| Line 125: | Line 125: | ||
;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 fullfilled. |
so that the above equation is fullfilled. |
||
| Line 132: | Line 131: | ||
;Example 1: |
|||
<pre> |
<pre> |
||
A |
A |
||