• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Structured Matrices and Polynomials: Unified Superfast Algorithms

Structured Matrices and Polynomials: Unified Superfast Algorithms

Hardcover

AlgebraGeneral MathematicsProgramming

ISBN10: 0817642404
ISBN13: 9780817642402
Publisher: Springer Nature
Published: Jun 26 2001
Pages: 278
Weight: 1.34
Height: 0.75 Width: 6.14 Depth: 9.21
Language: English
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.

1 different editions

Also available

Also in

Programming