Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-11T05:05:33.895Z Has data issue: false hasContentIssue false
  • English
  • Français

A numerical method for solving inverse eigenvalue problems

Published online by Cambridge University Press:  15 August 2002

Hua Dai
Hua Dai*
Affiliation:
Department of Mathematics, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China. The research was supported in part by the National Natural Science Foundation of China and the Jiangsu Province Natural Science Foundation. This work was done while the author was visiting CERFACS, France (March-August 1998).
Get access

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.

Keywords

Inverse eigenvalue problemsQR-like decompositionleast squaresGauss-Newton method.
Type
Research Article
Information
ESAIM: Mathematical Modelling and Numerical Analysis , Volume 33 , Issue 5 , September 1999 , pp. 1003 - 1017
Copyright
© EDP Sciences, SMAI, 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)