Year: 1992
Author: Ren-Cang Li
Journal of Computational Mathematics, Vol. 10 (1992), Iss. 2 : pp. 97–111
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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1992-JCM-9344
Journal of Computational Mathematics, Vol. 10 (1992), Iss. 2 : pp. 97–111
Published online: 1992-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 15