Bunch; Hopcroft (Square Matrix LU Decomposition LU Decomposition)

From Algorithm Wiki

Revision as of 10:35, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2.{37}6})$ == Space Complexity == $\tilde{O}(n^{2})$ words (Derived: Uses Strassen multiplication and a constant number of $n \times n$ auxiliary matrices) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1974 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?id=248979")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n^{2.{37}6})$

Space Complexity

$\tilde{O}(n^{2})$ words

(Derived: Uses Strassen multiplication and a constant number of $n \times n$ auxiliary matrices)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1974

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?id=248979

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Bunch;_Hopcroft_(Square_Matrix_LU_Decomposition_LU_Decomposition)&oldid=44516"