An Improved Two‐Step Method for Inverse Eigenvalue Problems
ABSTRACT In this article, we investigate the numerical solutions of the inverse eigenvalue problem (IEP). Motivated by the techniques of Aishima in 2018, we propose here an improved two‐step method for the IEP. Compared with other existing methods, the proposed method has higher convergence order and/or requires less operations. Under the assumption that the relative generalized Jacobian matrices at a solution are nonsingular, the proposed method is proved to be convergent with cubic root‐convergence rate. Numerical examples demonstrate the effectiveness of the improved method.
Authors
- Enping Lou
- Rui Guo (ORCID: https://orcid.org/0000-0002-5294-923X)
- Xiaoguang Yang (ORCID: https://orcid.org/0000-0002-1121-9011)
- Weiping Shen (ORCID: https://orcid.org/0000-0002-0098-886X)
Institutions
- Zhejiang Normal University (CN)
Publication Details
- Journal
- Numerical Linear Algebra with Applications
- Published
- 2024-10-23
- DOI
- https://doi.org/10.1002/nla.2590
- Citations
- 1
- Primary Topic
- Matrix Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.36
Funders
- National Natural Science Foundation of China