></A>
<PRE>
  For point Toeplitz matrices or sufficiently large block Toeplitz
  matrices, this algorithm uses convolution algorithms based on
  the fast Hartley transforms [1]. Otherwise, TC is copied in
  reversed order into the workspace such that C can be computed from
  barely M matrix-by-matrix multiplications.

</PRE>
<A name="References"><B><FONT SIZE="+1">References</FONT></B></A>
<PRE>
  [1] Van Loan, Charles.
      Computational frameworks for the fast Fourier transform.
      SIAM, 1992.

</PRE>