Abstract
The inverse eigenvalue problem of quasi-tridiagonal matrices involves reconstruction of quasi-tridiagonal matrices with the given eigenvalues satisfying some properties. In particular, we first analyze the eigenvalue properties from two aspects. On this basis, we investigate the inverse eigenvalue problem of quasi-tridiagonal matrices from the theoretic issue on solvability and the practical issue on computability. Sufficient conditions of existence of solutions of the inverse eigenvalue problem of quasi-tridiagonal matrices concerning solvability are found, and algorithms concerning computability are given with the unitary matrix tool from which we construct matrices. Finally, examples are presented to illustrate the algorithms.
Sign-in/Register to access full text options 
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.
