Structured Matrices and Polynomials: Unified Superfast Algorithms (2001)Hardcover - 2001, 26 June 2001

This book covers fundamental numerical and algebraic computations with Toeplitz, Hankel, Vandermonde, Cauchy, and other popular structured matrices. In the computations, matrices are represented by their compressed images, called displacements, enabling both a unified treatment of various matrix structures and a dramatic saving of computer time and memory. The resulting superfast algorithms allow further dramatic parallel acceleration using FFT. Intended readers: researchers, algorithm designers, advanced grads in the areas of computations with structured matrices, computer algebra, and numerical rational interpolation.