Share Email Print
cover

Proceedings Paper

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

Paper Abstract

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

Paper Details

Date Published: 2 October 1998
PDF: 8 pages
Proc. SPIE 3461, Advanced Signal Processing Algorithms, Architectures, and Implementations VIII, (2 October 1998); doi: 10.1117/12.325685
Show Author Affiliations
Franklin T. Luk, Rensselaer Polytechnic Institute (Hong Kong)
Sanzheng Qiao, McMaster Univ. (Canada)


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

© SPIE. Terms of Use
Back to Top