Krylov space approach to singular value decomposition in non-Hermitian systems

We propose a tridiagonalization approach for non-Hermitian random matrices and Hamiltonians using singular value decomposition (SVD). This technique leverages the real and non-negative nature of singular values, bypassing the complex eigenvalues typically found in non-Hermitian systems. We analyze the tridiagonal elements, namely the Lanczos coefficients and the associated Krylov (spread) complexity, appropriately defined through the SVD, across several examples, including Ginibre ensembles and the non-Hermitian Sachdev-Ye-Kitaev model. We demonstrate that in chaotic cases, the complexity exhibits a distinct peak due to the repulsion between singular values, a feature absent in integrable cases. Using our approach, we analytically compute the Krylov complexity for two-dimensional non-Hermitian random matrices within a subset of non-Hermitian symmetry classes, including time-reversal, time-reversal${}^{\ifmmode\dagger\else\textdagger\fi{}}$, chiral, and sublattice symmetry.