Fast Algorithms for Structured Matrices: Theory and Applications
Fast Algorithms for Structured Matrices: Theory and Applications
American Mathematical Society | April 2003 | ISBN-10: 0898715431 | 433 pages | PDF | 18 Mb
One of the best-known algorithms is the Fourier transform method. Its efficiency is based mainly on the special structure of the discrete Fournier transform matrix. This volume contains 22 papers devoted to the study of the design of other fast algorithms for structured matrices.
related link:
- More infomation may be in the description section, read description carefully!
- Click "Ebook Search" button to find mirrors if no download links or dead links in the description.