Matrix and polynomial computations are fundamental to the theory and practice of computing. The authors present here a systematic treatment of algorithms and complexity in these two related areas. Its study of computations with Toeplitz matrices and other dense structured matrices demonstrates the links between numerical and algebraic approaches to computation. The authors begin with classical fundamental problems and gradually introduce the reader to current research. In particular, the book provides improved parallel algorithms for computations with structured matrices and their further applications to some fundamental computations with matrices and polynomials. The book is designed as a text for advanced graduates in mathematics and computer science.
Publisher: Birkhauser Verlag AG
Number of pages: 423
Dimensions: 241 x 139 mm
You may also be interested in...
Please sign in to write a review
Thank you for your reservation
Your order is now being processed and we have sent a confirmation email to you at
When will my order be ready to collect?
Call us on or send us an email at
Unfortunately there has been a problem with your order
Please try again or alternatively you can contact your chosen shop on or send us an email at