2022 Developer Survey is open! Take survey.

New answers tagged

1 vote

Complexity of matrix diagonalization

Reducing to a tridiagonal matrix takes $O(n^3)$ independent of $\epsilon$. I believe the fastest algorithm after that is divide and conquer, which I believe is $O(n^2 \log(1/\epsilon))$, for a total ...
user avatar

Top 50 recent answers are included