1 December 1991 Accurate fast Hankel matrix solver
Author Affiliations +
Abstract
We present a simple matrix representation of the Berlekamp-Massey algorithm for solving a Hankel system of linear equations, and we show how pivoting can be added to the algorithm to improve numerical accuracy of the method.
© (1991) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Adam W. Bojanczyk, Tong J. Lee, Franklin T. Luk, "Accurate fast Hankel matrix solver", Proc. SPIE 1566, Advanced Signal Processing Algorithms, Architectures, and Implementations II, (1 December 1991); doi: 10.1117/12.49813; https://doi.org/10.1117/12.49813
PROCEEDINGS
10 PAGES


SHARE
RELATED CONTENT

Fast RNS algorithm for computational geometry problems
Proceedings of SPIE (November 20 2001)
Reciprocal approximation theory with table compensation
Proceedings of SPIE (November 13 2000)
Stability of Bareiss algorithm
Proceedings of SPIE (December 01 1991)
Alternative To The SVD: Rank Revealing QR-Factorizations
Proceedings of SPIE (April 04 1986)
Solution of the Yule-Walker equations
Proceedings of SPIE (December 01 1991)

Back to Top