Average polynomial time for eigenvector computations
From MaRDI portal
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 page was built for publication: Average polynomial time for eigenvector computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6255323)
