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 - 2012

by Pan, Victor Y

Add to wish list
  • Used
  • Paperback
  • first
Used: Good

Description

Birkh, 2012-10-23. Softcover reprint of the original 1st ed. 2001. paperback. Used: Good. 6.10x0.70x9.25. Buy with confidence. Excellent Customer Service & Return policy.
Ask the seller a question Add to wish list
A$155.54
Free Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Dropship order
Ships from Ergodebooks (Texas, United States)

Details

  • Title Structured Matrices and Polynomials: Unified Superfast Algorithms
  • Author Pan, Victor Y
  • Binding Paperback
  • Edition Softcover reprint of the original 1st ed. 2001
  • Condition Used: Good
  • Pages 278
  • Volumes 1
  • Language ENG
  • Publisher Birkh
  • Publication date 2012-10-23
  • Features Bibliography, Glossary
  • Bookseller's Inventory # SONG1461266254
  • ISBN 9781461266259 / 1461266254
  • Weight 0.96 lbs (0.44 kg)
  • Dimensions 9.21 x 6.14 x 0.65 in (23.39 x 15.60 x 1.65 cm)
  • Size 6.10x0.70x9.25
  • Category Computers - Languages / Programming
  • Dewey Decimal Code 004.015
  • Quantity available 1

About Ergodebooks Texas, United States

Biblio member since 2005

Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.

Terms of Sale:

We have 30 day return policy.

Browse books from Ergodebooks

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-