Matrix inverse (General Linear system of equations)
Revision as of 10:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^omega)$ where omega is the exponent on the complexity of matrix multiplication;<br/>currently $O(n^{2.37285956})$ == Space Complexity == $O(n^{2})$ words (equivalent to matrix multiplication) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == == Reference ==")
Time Complexity
$O(n^omega)$ where omega is the exponent on the complexity of matrix multiplication;
currently $O(n^{2.37285956})$
Space Complexity
$O(n^{2})$ words
(equivalent to matrix multiplication)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM