Abstract
The problem of computing the minimal eigenvalue of a real symmetric positive definite Toeplitz matrix is considered. Algorithms for estimating such an eigenvalue, which need only one or two inverses, are presented. The suggested algorithms are based on good initial approximations to the corresponding eigenvector which can be derived by approximating the Toeplitz matrix by circulant matrices.
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.
