Okunev; Johnson (Square Matrix LU Decomposition LU Decomposition)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n^{3})$

Space Complexity

$O({1})$ words

(Derived: all in-place calculations)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1997

Reference

https://arxiv.org/abs/math/0506382