Press, Teukolsky, Flannery (Square Matrix LU Decomposition LU Decomposition)
Jump to navigation
Jump to search
Time Complexity
$O(n^{3})$
Space Complexity
$\tilde{O}(n)$ words
(Derived: The only auxiliary structure used is a list called "vv" that has one entry per row of the input matrix to store some sort of scaling metric)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2007