TAILIEUCHUNG - Fast Algorithms for Structured Matrices: Theory and Applications

Perhaps the most widely known example of fast algorithms is the fast Fourier transform (FFT) algorithm. Its importance is widely acknowledged and nicely described in numerous papers and monographs, ., as follows: "The fast Fourier transform (FFT) is one of the truly great computational developments of this century. It has changed the face of science and engineering so that it is not an exaggeration to say that life as we know it would be very different without FFT" (Charles Van Loan, Computational Frameworks for the Fast Fourier Transform, SIAM Publications, 1992). There are many different mathematical languages which can be used to derive and describe the FFT, and. | Contemporary mathematics 323 Fast Algorithms for Structured Matrices Theory and Applications AMS-IMS-SIAM Joint Summer Research Conference on Fast Algorithms in Mathematics Computer Science and Engineering August 5-9 2001 Mount Holyoke College South Hadley Massachusetts Vadim Olshevsky Editor Fast Algorithms for Structured Matrices Theory and Applications This page intentionally left .