Average polynomial time for eigenvector computations
classification
🧮 math.NA
cs.NA
keywords
averageeigenvectorpolynomialtimealgorithmscomplexcomputationsdescribe
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.