Press Solve.
Method
The characteristic polynomial is built with the Faddeev–LeVerrier recursion and its roots are the eigenvalues; each real eigenvalue λ gives eigenvectors from the null space of A − λI (via Gauss–Jordan). The inverse comes from reducing [A | I]. This is reliable for small matrices; for large ones use the QR algorithm.
Computed in your browser with double-precision arithmetic; nothing is sent to a server. Check results by substituting them back.