Fast eigenvalue algorithm for Hankel matrices

Franklin T. Luk; Sanzheng Qiao

doi:10.1117/12.325685

2 October 1998 Fast eigenvalue algorithm for Hankel matrices

Franklin T. Luk, Sanzheng Qiao

Proceedings Volume 3461, Advanced Signal Processing Algorithms, Architectures, and Implementations VIII; (1998) https://doi.org/10.1117/12.325685
Event: SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, 1998, San Diego, CA, United States

Abstract

We present an O(n² log n) algorithm for finding all the eigenvalues of an n X n complex Hankel matrix.

Citation Download Citation

Franklin T. Luk and Sanzheng Qiao "Fast eigenvalue algorithm for Hankel matrices", Proc. SPIE 3461, Advanced Signal Processing Algorithms, Architectures, and Implementations VIII, (2 October 1998); https://doi.org/10.1117/12.325685

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available