Topological approach to diagonalization algorithms

Publication date 12 April 2022

Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Grassmannians, Schubert varieties, flag manifolds (14M15) Diagonalization, Jordan forms (15A20) Dynamical systems involving smooth mappings and diffeomorphisms (37C05) Fixed points and periodic points of dynamical systems; fixed-point index theory; local dynamics (37C25) Morse-Smale systems (37D15) Combinatorial complexity of geometric structures (52C45) Finite groups of transformations in algebraic topology (including Smith theory) (55M35) Homology with local coefficients, equivariant cohomology (55N25) Sheaf cohomology in algebraic topology (55N30) Serre spectral sequences (55T10) Software, source code, etc. for problems pertaining to manifolds and cell complexes (57-04) Computational methods for problems pertaining to manifolds and cell complexes (57-08) Toric topology (57S12)

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.

This page was built for publication: Topological approach to diagonalization algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6396374)