Crout and LUP algorithms (Square Matrix LU Decomposition LU Decomposition)
Jump to navigation
Jump to search
Time Complexity
$O(n^{3})$
Space Complexity
$\tilde{O}({1})$ words
(Derived: only storing 1 intermediate variable)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2007