Timeline for Time complexity of LU decomposition
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 28, 2020 at 1:58 | comment | added | user681443 | I am a little confused. Why don't any of the answers here also consider the part where we have to also find the upper triangular matrix? | |
| Oct 28, 2018 at 5:32 | review | Suggested edits | |||
| Oct 28, 2018 at 6:42 | |||||
| Jun 19, 2015 at 15:28 | vote | accept | amaatouq | ||
| Jun 18, 2015 at 22:29 | comment | added | lmsteffan | You can use the classical formulas for the sums of the first $n$ squares and the first $n$ integers : $$ \sum_0^n{k^2} =\frac{1}{6} {\left(2 n + 1\right)} {\left(n + 1\right)} n $$ and $$ \sum_0^n{k} =\frac{n(n+1)}{2}$$ and adapt them to $n-1$ | |
| Jun 18, 2015 at 22:19 | comment | added | amaatouq | I get it up to the $2 \sum_{j=0}^{n-1} (j^2 + j)$ .. but then I don't see how did you get the next step. I must be missing something. | |
| Jun 18, 2015 at 21:47 | history | answered | lmsteffan | CC BY-SA 3.0 |