Abstract
A projection method for computing the minimal eigenvalue of a symmetric and positive definite Toeplitz matrix is presented. It generalizes and accelerates the algorithm considered in [12] (W. Mackens, H. Voss, SIAM J. Matrix Anal. Appl. 18 (1997) 521–534). Global and cubic convergence is proved. Randomly generated test problems up to dimension 1024 demonstrate the methods good global behaviour.
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.
