| Автор | Dai, Hua |
| Дата выпуска | 1999 |
| dc.description | 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. |
| Формат | application.pdf |
| Издатель | EDP Sciences |
| Копирайт | © EDP Sciences, SMAI, 1999 |
| Тема | Inverse eigenvalue problems |
| Тема | QR-like decomposition |
| Тема | least squares |
| Тема | Gauss-Newton method. |
| Название | A numerical method for solving inverse eigenvalue problems |
| Тип | research-article |
| DOI | 10.1051/m2an:1999131 |
| Electronic ISSN | 1290-3841 |
| Print ISSN | 0764-583X |
| Журнал | ESAIM: Mathematical Modelling and Numerical Analysis |
| Том | 33 |
| Первая страница | 1003 |
| Последняя страница | 1017 |
| Аффилиация | Dai Hua; 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). |
| Выпуск | 5 |
