full
search.png

Search

close.png

Cancel

arrow
Volume 10, Issue 2
Algorithms for Inverse Eigenvalue Problems

Ren-Cang Li

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

Published online: 1992-10

Preview Full PDF 1771 19494

Cited by

google scholar semantic scholar
Export citation
  • 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.  

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-10-97, author = {Li , Ren-Cang}, title = {Algorithms for Inverse Eigenvalue Problems}, journal = {Journal of Computational Mathematics}, year = {1992}, volume = {10}, number = {2}, pages = {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.  

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9344.html} }
TY - JOUR T1 - Algorithms for Inverse Eigenvalue Problems AU - Li , Ren-Cang JO - Journal of Computational Mathematics VL - 2 SP - 97 EP - 111 PY - 1992 DA - 1992/10 SN - 10 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9344.html KW - AB -

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.  

Ren-Cang Li. (1970). Algorithms for Inverse Eigenvalue Problems. Journal of Computational Mathematics. 10 (2). 97-111. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard