Progress in Theoretical Computer Science

Polynomial and Matrix Computations

Fundamental Algorithms

Authors: Bini, Dario A., Pan, Victor

Buy this book

eBook $139.00
price for USA (gross)
  • ISBN 978-1-4612-0265-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $199.00
price for USA
  • ISBN 978-0-8176-3786-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $179.00
price for USA
  • ISBN 978-1-4612-6686-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

Our Subjects and Objectives. This book is about algebraic and symbolic computation and numerical computing (with matrices and polynomials). It greatly extends the study of these topics presented in the celebrated books of the seventies, [AHU] and [BM] (these topics have been under-represented in [CLR], which is a highly successful extension and updating of [AHU] otherwise). Compared to [AHU] and [BM] our volume adds extensive material on parallel com­ putations with general matrices and polynomials, on the bit-complexity of arithmetic computations (including some recent techniques of data compres­ sion and the study of numerical approximation properties of polynomial and matrix algorithms), and on computations with Toeplitz matrices and other dense structured matrices. The latter subject should attract people working in numerous areas of application (in particular, coding, signal processing, control, algebraic computing and partial differential equations). The au­ thors' teaching experience at the Graduate Center of the City University of New York and at the University of Pisa suggests that the book may serve as a text for advanced graduate students in mathematics and computer science who have some knowledge of algorithm design and wish to enter the exciting area of algebraic and numerical computing. The potential readership may also include algorithm and software designers and researchers specializing in the design and analysis of algorithms, computational complexity, alge­ braic and symbolic computing, and numerical computation.

Reviews

"We strongly recommend this book as a reference for a graduate course in symbolic computation or computer algebra… An excellent companion for researchers and advanced students."

—SIGSAM Bulletin

"Written in a clear and elegant style… One of the best books in the fields considered."

—Zentralblatt Math.


Table of contents (4 chapters)

  • Fundamental Computations with Polynomials

    Bini, Dario (et al.)

    Pages 1-80

  • Fundamental Computations with General and Dense Structured Matrices

    Bini, Dario (et al.)

    Pages 81-227

  • Bit-Operation (Boolean) Cost of Arithmetic Computations

    Bini, Dario (et al.)

    Pages 228-294

  • Parallel Polynomial and Matrix Computations

    Bini, Dario (et al.)

    Pages 295-384

Buy this book

eBook $139.00
price for USA (gross)
  • ISBN 978-1-4612-0265-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $199.00
price for USA
  • ISBN 978-0-8176-3786-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $179.00
price for USA
  • ISBN 978-1-4612-6686-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Polynomial and Matrix Computations
Book Subtitle
Fundamental Algorithms
Authors
Series Title
Progress in Theoretical Computer Science
Copyright
1994
Publisher
Birkhäuser Basel
Copyright Holder
Springer Science+Business Media New York
eBook ISBN
978-1-4612-0265-3
DOI
10.1007/978-1-4612-0265-3
Hardcover ISBN
978-0-8176-3786-6
Softcover ISBN
978-1-4612-6686-0
Edition Number
1
Number of Pages
XVI, 416
Topics