English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper is contributed to a fast algorithm for Hankel tensor-vectorproducts. For this purpose, we first discuss a special class of Hankel tensorsthat can be diagonalized by the Fourier matrix, which is called\emph{anti-circulant} tensors. Then we obtain a fast algorithm for Hankeltensor-vector products by embedding a Hankel tensor into a largeranti-circulant tensor. The computational complexity is about $\mathcal{O}(m^2 n\log mn)$ for a square Hankel tensor of order $m$ and dimension $n$, and thenumerical examples also show the efficiency of this scheme. Moreover, the blockversion for multi-level block Hankel tensors is discussed as well. Finally, weapply the fast algorithm to exponential data fitting and the block version to2D exponential data fitting for higher performance.

Fast Hankel Tensor-Vector Products and Application to Exponential Data Fitting