Enter your complex square matrix to find eigenvalues. Check unitarity using an error score. Download CSV and PDF results for easy sharing.
| Matrix size | Example entry pattern | Expected eigenvalue magnitudes |
|---|---|---|
| 2×2 | Diagonal phases: e^{iθ1}, e^{iθ2} | All should be 1 |
| 3×3 | Normalized DFT-like matrix | All should be 1 |
| 4×4 | Rotations with phase shifts | All should be 1 |
A complex matrix U is unitary when U·Uᴴ = I, where Uᴴ is the conjugate transpose.
Eigenvalues λ satisfy det(U − λI) = 0. For unitary matrices, each eigenvalue lies on the unit circle, so |λ| = 1.
This tool builds the characteristic polynomial using Faddeev–LeVerrier, then finds complex roots using the Durand–Kerner iteration.
A matrix is unitary when its conjugate transpose equals its inverse. That identity preserves lengths and angles of vectors under multiplication.
If Uv=λv, then ||Uv||=||v|| for unitary U. This gives |λ|·||v||=||v||, so |λ|=1 for any nonzero eigenvector.
Floating-point rounding and iterative root solving can cause tiny drift. Non-unitary inputs also push magnitudes away from 1. Increase decimals or check the unitarity error.
It is ||U·Uᴴ − I|| using the Frobenius norm. A value near zero means U is close to unitary within numeric precision.
Use 2, -3.1, i, -i, 2+3i, or 2-0.5i. Keep “i” at the end and avoid spaces for best parsing.
2×2 to 6×6 are supported. Smaller sizes converge faster. For 6×6, choose reasonable tolerances and decimals to avoid slow iteration.
No. Results are numeric approximations. For exact symbolic eigenvalues, use a computer algebra system and compare numeric values with this tool.
Important Note: All the Calculators listed in this site are for educational purpose only and we do not guarentee the accuracy of results. Please do consult with other sources as well.