Aasen's method (Non-Definite, Symmetric Matrix Linear System)
Jump to navigation
Jump to search
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