BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-79-748
       ENTRY:: June 19, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Fast algorithms for solving Toeplitz systems of equations and
               finding rational Hermite interpolants
        TYPE:: Technical Report
      AUTHOR:: Yun, David Y. Y.
        DATE:: July 1979
       PAGES:: 10
    ABSTRACT:: We present a new algorithm that reduces the computation for
               solving a Toeplitz system to O(n ${log}^2$ n) and
               automatically resolves all degenerate cases of the past. Our
               fundamental results show that all rational Hermite
               interpolants, including Pade approximants which is intimately
               related to this solution process, can be computed fast by an
               Euclidean algorithm. In this report we bring out all these
               relationships with mathematical justifications and mention
               important applications including decoding BCH codes.
       NOTES:: [Adminitrivia V1/Prg/19950619]
         END:: STAN//CS-TR-79-748