Algorithms for Inverse Eigenvalue Problems

Authors

  • Ren-Cang Li

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.  

Downloads

Published

1992-10-01

Abstract View

  • 32866

Pdf View

  • 3489

Issue

Vol. 10 No. 2 (1992)

Section

Articles

How to Cite

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