The fast Fourier transform (FFT) represents one of the most important advancements in scientific and engineering computing. This is a guide to learning the FFT and the multitude of ideas and computing techniques it employs. It brings together numerous and varied ideas in a common notational framework with a unified and systematic approach. It includes discussion of many widely-applicable techniques in algorithm design and analysis, efficient numerical computation, and scientific programming.

Based on the testimony of key players, "Syria: Neither Bread nor Freedom" recounts the drama of the "Damascus Spring" and its repression, and reveals what happens in a state like Syria to the institutions that occupy the political space between government and governed. From political parties to parliament; from the media to the judicial system and universities, the official veil of rhetoric and propaganda is lifted to reveal a system so demoralized and corrupted that power is wielded for no purpose but power itself; a system which, as Bashar al-Assad himself is discovering, is virtually...

This IMA Volume in Mathematics and its Appllcations GRAPH THEORY AND SPARSE MATRIX COMPUTATION is based on the proceedings of a workshop that was an integraI part of the 1991- 92 IMA program on "Applied Linear AIgebra." The purpose of the workshop was to bring together people who work in sparse matrix computation with those who conduct research in applied graph theory and grl: l, ph algorithms, in order to foster active cross-fertilization. We are grateful to Richard Brualdi, George Cybenko, Alan Geo ge, Gene Golub, Mitchell Luskin, and Paul Van Dooren for planning and implementing the...