Average polynomial time for eigenvector computations
Numerical Analysis
2014-10-09 v1
Abstract
We describe two algorithms for the eigenvalue, eigenvector problem which, on input a Gaussian matrix with complex entries, finish with probability 1 and in average polynomial time.
Cite
@article{arxiv.1410.2179,
title = {Average polynomial time for eigenvector computations},
author = {Diego Armentano and Carlos Beltrán and Michael Shub},
journal= {arXiv preprint arXiv:1410.2179},
year = {2014}
}
Related papers
View all related →
Numerical Analysis · Mathematics
A stable, polynomial-time algorithm for the eigenpair problem
Peter Bürgisser, Felipe Cucker
2014-10-02
Numerical Analysis · Mathematics
A stable, polynomial-time algorithm for the eigenpair problem
Diego Armentano, Carlos Beltrán, Peter Bürgisser, Felipe Cucker +1
2015-05-14
Numerical Analysis · Mathematics
The polynomial eigenvalue problem is well conditioned for random inputs
Carlos Beltrán, Diego Armentano
2017-06-20
Numerical Analysis · Mathematics
The real polynomial eigenvalue problem is well conditioned on the average
Carlos Beltran, Khazhgali Kozhasov
2018-02-22
Statistics Theory · Mathematics
Mean Estimation with Sub-Gaussian Rates in Polynomial Time
Samuel B. Hopkins
2019-06-05
Numerical Analysis · Mathematics
Numerical methods for eigenvalues of singular polynomial eigenvalue problems
Michiel E. Hochstenbach, Christian Mehl, Bor Plestenjak
2025-02-21
Numerical Analysis · Mathematics
Fast Algorithms for Computing Eigenvectors of Matrices via Pseudo Annihilating Polynomials
Shinichi Tajima, Katsuyoshi Ohara, Akira Terui
2019-02-19
Numerical Analysis · Mathematics
Solving two-parameter eigenvalue problems using an alternating method
Henrik Eisenmann, Yuji Nakatsukasa
2021-05-12
Optimization and Control · Mathematics
A strongly polynomial-time algorithm for the general linear programming problem
Samuel Awoniyi
2026-03-24
Quantum Physics · Physics
A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
Daniel S. Abrams, Seth Lloyd
2009-01-23
Statistics Theory · Mathematics
Polynomial methods in statistical inference: theory and practice
Yihong Wu, Pengkun Yang
2021-04-22
Numerical Analysis · Mathematics
Solving p-adic polynomial systems via iterative eigenvector algorithms
Avinash Kulkarni
2019-07-09
Numerical Analysis · Mathematics
A generalized eigenvalue algorithm for tridiagonal matrix pencils based on a nonautonomous discrete integrable system
Kazuki Maeda, Satoshi Tsujimoto
2016-01-19
Machine Learning · Computer Science
Settling the Polynomial Learnability of Mixtures of Gaussians
Ankur Moitra, Gregory Valiant
2010-04-27
Numerical Analysis · Mathematics
Simple exponential acceleration of the power iteration algorithm
Congzhou M Sha, Nikolay V Dokholyan
2021-09-23
Numerical Analysis · Mathematics
Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control
A. Fazzi, N. Guglielmi, I. Markovsky
2021-06-02
Optimization and Control · Mathematics
Validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem
Samuel Awoniyi
2026-04-28
Computational Complexity · Computer Science
Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas
Gabor Erdelyi, Lane A. Hemaspaandra, Joerg Rothe, Holger Spakowski
2008-06-17
Rings and Algebras · Mathematics
Computing Common Eigenvectors and Simultaneous Triangulation
Emanuel Malvetti
2023-09-27
Probability · Mathematics
Filtering of partially observed polynomial processes in discrete and continuous time
Jan Kallsen, Ivo Richert
2025-07-10
Computational Complexity · Computer Science
Optimal Polynomial-Time Estimators: A Bayesian Notion of Approximation Algorithm
Vanessa Kosoy, Alexander Appel
2025-06-27
Optimization and Control · Mathematics
A numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming problem
Samuel Awoniyi
2026-05-12
Quantum Physics · Physics
Polynomial computational complexity of matrix elements of finite-rank-generated single-particle operators in products of finite bosonic states
Dmitri A. Ivanov
2023-05-31
Numerical Analysis · Mathematics
Solving singular generalized eigenvalue problems by a rank-completing perturbation
Michiel E. Hochstenbach, Christian Mehl, Bor Plestenjak
2020-02-18
Numerical Analysis · Mathematics
Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
Dario A. Bini, V. Noferini
2012-07-27