Solving the inverse eigenvalue problem via the eigenvector matrix

From MaRDI portal





A numerical algorithm for the inverse eigenvalue problem for symmetric matrices is proposed, based on continually updating the eigenvector matrix using plane rotations. The idea behind this algorithm is to utilize the matrix formed from the Rayleigh quotients of the eigenvectors with respect to each of the basis matrices involved. The computational questions involved in this approach are examined in detail. Numerical examples are given which demonstrate that the new algorithm is much more robust than the Newton's method.











This page was built for publication: Solving the inverse eigenvalue problem via the eigenvector matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803722)