pith. sign in

arxiv: 1806.06327 · v1 · pith:4WVISV56new · submitted 2018-06-17 · 🧮 math.NA · cs.NA

A Preconditioned Riemannian Gauss-Newton Method for Least Squares Inverse Eigenvalue Problems

classification 🧮 math.NA cs.NA
keywords methodinverseleastproposedsquareseigenvalueproblemriemannian
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.