Abstract
ABSTRACTIn 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
