Aasen's method (Non-Definite, Symmetric Matrix Linear System)
Revision as of 11:32, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n^{2})$ total words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1971 == Reference == https://link.springer.com/article/10.1007/BF01931804")
Time Complexity
$O(n^{3})$
Space Complexity
$O(n^{2})$ total words
(can be easily derived)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1971