2015/05/13 by Diego Armentano, Carlos Beltrán, Armentano, Diego +7
Computer Science · Mathematics · #65F15 #65F22 #Advanced Optimization Algorithms Research #F.2.1 #FOS: Mathematics #G.1.5 #Matrix Theory and Algorithms #Numerical Analysis (math.NA) #Polynomial and algebraic computation
paper · pdf · doi:10.48550/arxiv.1505.03290
openalex publication_date 2015/05/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) of a complex n× n matrix A. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not believe they outperform in practice the algorithms currently used for this computational problem. The merit of our paper is to give a positive answer to a long-standing open problem in numerical linear algebra.