The Complexity of Diagonalization
Symbolic Computation
2023-05-19 v1 Computational Complexity
Data Structures and Algorithms
Numerical Analysis
Numerical Analysis
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.
Cite
@article{arxiv.2305.10575,
title = {The Complexity of Diagonalization},
author = {Nikhil Srivastava},
journal= {arXiv preprint arXiv:2305.10575},
year = {2023}
}
Comments
11pp. Invited survey for ISSAC 2023. Comments welcome