A geometric Gauss-Newton method for least squares inverse eigenvalue problems

From MaRDI portal
Publication:2192604

DOI10.1007/S10543-019-00798-9zbMATH Open1452.65072arXiv1806.06327OpenAlexW2998959417MaRDI QIDQ2192604FDOQ2192604

Zheng-Jian Bai, Zhi Zhao, Xiao-Qing Jin, Tengteng Yao

Publication date: 17 August 2020

Published in: BIT (Search for Journal in Brave)

Abstract: This paper is concerned with the least squares inverse eigenvalue problem of reconstructing a linear parameterized real symmetric matrix from the prescribed partial eigenvalues in the sense of least squares, which was originally proposed by Chen and Chu [SIAM J. Numer. Anal., 33 (1996), pp. 2417--2430]. We provide a Riemannian inexact Gausss-Newton method for solving the least squares inverse eigenvalue problem. The global and local convergence analysis of the proposed method is discussed. Also, a preconditioned conjugate gradient method with an efficient preconditioner is proposed for solving the Riemannian Gauss-Newton equation. Finally, some numerical tests, including an application in the inverse Sturm-Liouville problem, are reported to illustrate the efficiency of the proposed method.


Full work available at URL: https://arxiv.org/abs/1806.06327




Recommendations




Cites Work


Cited In (6)





This page was built for publication: A geometric Gauss-Newton method for least squares inverse eigenvalue problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2192604)