Fast singular value algorithm for Hankel matrices

Franklin T. Luk; Sanzheng Qiao

doi:10.1117/12.448657

20 November 2001 Fast singular value algorithm for Hankel matrices

Franklin T. Luk, Sanzheng Qiao

Proceedings Volume 4474, Advanced Signal Processing Algorithms, Architectures, and Implementations XI; (2001) https://doi.org/10.1117/12.448657
Event: International Symposium on Optical Science and Technology, 2001, San Diego, CA, United States

Abstract

We present an O(n²logn) algorithm for finding all the singular values of an n-by-n complex Hankel matrix.

Citation Download Citation

Franklin T. Luk and Sanzheng Qiao "Fast singular value algorithm for Hankel matrices", Proc. SPIE 4474, Advanced Signal Processing Algorithms, Architectures, and Implementations XI, (20 November 2001); https://doi.org/10.1117/12.448657

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