A numerical method for solving inverse eigenvalue problems

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Based on QR-like decomposition with column pivoting, a new and efficient numerical method for solving symmetric matrix inverse eigenvalue problems is proposed, which is suitable for both the distinct and multiple eigenvalue cases. A locally quadratic convergence analysis is given. Some numerical experiments are presented to illustrate our results.

Cite

CITATION STYLE

APA

Dai, H. (1999). A numerical method for solving inverse eigenvalue problems. Mathematical Modelling and Numerical Analysis, 33(5), 1003–1017. https://doi.org/10.1051/m2an:1999131

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free