Volume 10, Issue 2
Algorithms for Inverse Eigenvalue Problems

Ren-cang Li

J. Comp. Math., 10 (1992), pp. 97-111

Preview Full PDF BiBTex 2 192
  • 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 behaveior.

  • History

Published online: 1992-10

  • Keywords

  • AMS Subject Headings

  • Cited by