2 October 1998 Fast eigenvalue algorithm for Hankel matrices
Author Affiliations +
Abstract
We present an O(n2 log n) algorithm for finding all the eigenvalues of an n X n complex Hankel matrix.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Franklin T. Luk, Franklin T. Luk, Sanzheng Qiao, Sanzheng Qiao, } "Fast eigenvalue algorithm for Hankel matrices", Proc. SPIE 3461, Advanced Signal Processing Algorithms, Architectures, and Implementations VIII, (2 October 1998); doi: 10.1117/12.325685; https://doi.org/10.1117/12.325685
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT

Analysis of a fast Hankel eigenvalue algorithm
Proceedings of SPIE (November 02 1999)
Structured null space problem
Proceedings of SPIE (October 02 1998)
Some fast Toeplitz least-squares algorithms
Proceedings of SPIE (December 01 1991)
Recursive ULV decomposition
Proceedings of SPIE (November 13 2000)

Back to Top