Algorithms for Inverse Eigenvalue Problems

Author(s)

Abstract

Two new algorithms based on QR decompositions (QRDs) (with column pivoting) are proposed for solving inverse eigenvalue problems, and under some non-singularity assumptions they are both locally quadratically convergent.
Several numerical tests are presented to illustrate their convergence behavior.  

About this article

Abstract View

  • 32960

Pdf View

  • 3506

How to Cite

Algorithms for Inverse Eigenvalue Problems. (1992). Journal of Computational Mathematics, 10(2), 97-111. https://www.global-sci.com/index.php/JCM/article/view/11057