arXiv · 2204.06111
Topological approach to diagonalization algorithms
Abstract
In this paper we prove that there exists an asymptotical diagonalization algorithm for a class of sparse Hermitian (or real symmetric) matrices if and only if the matrices become Hessenberg matrices after some permutation of rows and columns. The proof is based on Morse theory, Roberts' theorem on indifference graphs, toric topology, and computer-based homological calculations.
Explore related subjects
Keep this discovery
Anton Ayzenberg, Konstantin Sorokin. 2022-04-12. Topological approach to diagonalization algorithms. https://arxiv.org/abs/2204.06111
Cite the original work for its findings. Save a collection to share your selection of sources.