Skip to main content alibris logo

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

by

Write The First Customer Review
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 - Ams-Ims-Siam Joint Summer Research Conference on Fast Algori, Computer
Filter Results
Item Condition
Seller Rating
Other Options
Change Currency

One of the best known fast computational algorithms is the fast Fourier transform method. Its efficiency is based mainly on the special structure of the discrete Fourier transform matrix. Recently, many other algorithms of this type were discovered, and the theory of structured matrices emerged. This volume contains 22 survey and research papers devoted to a variety of theoretical and practical aspects of the design of fast algorithms for structured matrices and related issues. Included are several papers containing various ...

loading
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 2003, American Mathematical Society(RI)

ISBN-13: 9780821831779

New edition

Trade paperback