Doolittle Algorithm (Square Matrix LU Decomposition LU Decomposition)

From Algorithm Wiki
Revision as of 10:32, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == 1878 == Reference ==")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

1878

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Doolittle_Algorithm_(Square_Matrix_LU_Decomposition_LU_Decomposition)&oldid=44421"