BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Structured Matrices and Polynomials: Unified Superfast Algorithms

Structured Matrices and Polynomials: Unified Superfast Algorithms

Structured Matrices and Polynomials: Unified Superfast Algorithms
Stock photo: cover may vary

Structured Matrices and Polynomials: Unified Superfast Algorithms Paperback / softback - 2012

by Victor Y. Pan

Add to wish list
  • New
  • Paperback
New

Description

Paperback / softback. New. This user-friendly, engaging textbook makes the material accessible to graduate students and new researchers who wish to study the rapidly exploding area of computations with structured matrices and polynomials. The book goes beyond research frontiers and, apart from very recent research articles, includes previously unpublished results.
Ask the seller a question Add to wish list
A$110.16
A$19.20 Delivery to USA
Standard delivery: 14 to 21 days
More delivery options
Ships from The Saint Bookstore (Merseyside, United Kingdom)

Details

About The Saint Bookstore Merseyside, United Kingdom

Biblio member since 2018

The Saint Bookstore specialises in hard to find titles & also offers delivery worldwide for reasonable rates.

Terms of Sale: Refunds or Returns: A full refund of the price paid will be given if returned within 30 days in undamaged condition. If the product is faulty, we may send a replacement.

Browse books from The Saint Bookstore

Reader reviews for Structured Matrices and Polynomials: Unified Superfast Algorithms

From the publisher

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.
tracking-