Share Email Print
cover

Proceedings Paper

Fast singular value algorithm for Hankel matrices
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

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

Paper Details

Date Published: 20 November 2001
PDF: 8 pages
Proc. SPIE 4474, Advanced Signal Processing Algorithms, Architectures, and Implementations XI, (20 November 2001); doi: 10.1117/12.448657
Show Author Affiliations
Franklin T. Luk, Chinese Univ. of Hong Kong (Hong Kong)
Sanzheng Qiao, McMaster Univ. (Canada)


Published in SPIE Proceedings Vol. 4474:
Advanced Signal Processing Algorithms, Architectures, and Implementations XI
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top