Abstract
A highly parallel algorithm is presented for the Hermitian Toeplitz eigenproblem. It computes recursively, in increasing order, the complete eigendecompositions of the successive submatrices contained in the original matrix. At each order, a number of independent, structurally identical, nonlinear problems is solved in parallel, facilitating fast implementation. The eigenvalues are found with a constrained iterative Newton scheme, and the eigenvectors are obtained by solving Toeplitz systems. In the multiple minimum eigenvalue case, eigenvector information found at the rank before is used to identify all except one of the eigenvectors associated with the multiple eigenvalue instantaneously. The final eigenvector is found by deflation. The performance of the algorithm is evaluated in terms of eigenpair accuracy.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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 callMore From: IEEE Transactions on Acoustics, Speech, and Signal Processing
Disclaimer: 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.
