Bisection method (Any eigenvalue Eigenvalues (Iterative Methods))

Time Complexity

$O(n^{2})$

Space Complexity

$O(n^{2})$? words

(Computing characteristic polynomial takes $O(n^2)$ space (via e.g. Faddeev–LeVerrier algorithm); rest of algo can be done in $O(n)$ space (related to root computation))

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1985

Reference

-