Divide-and-conquer (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods))
Jump to navigation
Jump to search
Time Complexity
$O(n \log n)$
Space Complexity
$O(n^{2})$ words
(Stores reduction to tridiagonal form; recursion (S(n)=2S(n/2)+O(n^2)) should work out to O(n^2))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1986
Reference
https://link.springer.com/content/pdf/10.1007/BF01389480.pdf