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.
Recommendations
- A numerical method for solving inverse eigenvalue problems
- Solving inverse eigenvalue problems by a projected newton method
- Solving inverse eigenvalue problems by a projected Newton method
- An algorithm for symmetric generalized inverse eigenvalue problems
- On the real symmetric inverse eigenvalue problem
Cites work
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- A Numerical Approach to the Inverse Toeplitz Eigenproblem
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 3891554 (Why is no real title available?)
- The Formulation and Analysis of Numerical Methods for Inverse Eigenvalue Problems
- The numerically stable reconstruction of Jacobi matrices from spectral data
Cited in
(12)- A matrix inverse eigenvalue problem and its application
- Isospectral flows and the inverse eigenvalue problem for Toeplitz matrices
- Centrosymmetric isospectral flows and some inverse eigenvalue problems
- A quadratically convergent algorithm based on matrix equations for inverse eigenvalue problems
- Solution of the linearly structured partial polynomial inverse eigenvalue problem
- The reconstruction of an Hermitian Toeplitz matrix with prescribed eigenpairs
- A Motivational Example for the Numerical Solution of the Algebraic Eigenvalue Problem
- scientific article; zbMATH DE number 844461 (Why is no real title available?)
- A numerical algorithm for the optimal approximation solution to inverse eigenvalue problem for symmetric matrices
- A numerical method for solving inverse eigenvalue problems
- Solving an inverse eigenvalue problem with triple constraints on eigenvalues, singular values, and diagonal elements
- Solving inverse eigenvalue problems via Householder and rank-one matrices
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)