Logo - springer
Slogan - springer

Birkhäuser - Birkhäuser Computer Science | Polynomial and Matrix Computations - Fundamental Algorithms

Polynomial and Matrix Computations

Fundamental Algorithms

Bini, Dario, Pan, Victor

1994, XVI, 416 p.

A product of Birkhäuser Basel
Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$119.00

(net) price for USA

ISBN 978-1-4612-0265-3

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$199.00

(net) price for USA

ISBN 978-0-8176-3786-6

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$149.00

(net) price for USA

ISBN 978-1-4612-6686-0

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

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.

Content Level » Research

Keywords » Approximation - Matrix - algorithm - algorithm design - algorithms - complexity - computer - computer science

Related subjects » Birkhäuser Computer Science - Birkhäuser Mathematics

Table of contents 

1. Fundamental Computations with Polynomials..- 2. Fundamental Computations with General and Dense Structured Matrices..- 3. Bit-Operation (Boolean) Cost of Arithmetic Computations..- 4. Parallel Polynomial and Matrix Computations..- Bibliography..- Index..

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Mathematical Applications in Computer Science.