The Complexity of Diagonalization

Author:

Nikhil Srivastava

Keyword:

Computer Science, Symbolic Computation, Symbolic Computation (cs.SC), Computational Complexity (cs.CC), Data Structures and Algorithms (cs.DS), Numerical Analysis (math.NA)

journal:

date:

2023-05-16 16:00:00

Abstract

We survey recent progress on efficient algorithms for approximately diagonalizing a square complex matrix in the models of rational (variable precision) and finite (floating point) arithmetic. This question has been studied across several research communities for decades, but many mysteries remain. We present several open problems which we hope will be of broad interest.

PDF: The Complexity of Diagonalization.pdf