Fast discrete cosine transform algorithm for Hankel matrices

MaRDI QIDQ3368009zbMATH OpenFDO

Authors Xiang Wang

Publication date 27 January 2006

zbMATH Keywords

fast algorithmHankel matricesdiscrete cosine transformfast Fourier transformation

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Fast cosine transform of Toeplitz matrices, algorithm and applications
• scientific article; zbMATH DE number 24367
• Fast radix-\(p\) discrete cosine transform
• Fast and numerically stable algorithms for discrete cosine transforms
• Fast algorithms for the discrete cosine transform

Cited in

(5)

• Fast cosine transform of Toeplitz matrices, algorithm and applications
• A fast algorithm for computing the Hankel transform of order 1
• Fast Hankel transform by fast sine and cosine transforms: The Mellin connection
• Fast Hankel transform algorithm
• A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions

This page was built for publication: Fast discrete cosine transform algorithm for Hankel matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3368009)