Polynomial and Matrix Computations

Name: Polynomial and Matrix Computations
Brand: Springer, Berlin
SKU: 9781461266860
Price: 826.09 RON
Availability: InStock

Fundamental Algorithms

Autor: Dario A. Bini, Victor Y. Pan

Limbă:

Legare: Carte broșată

Editura: Springer, Berlin

Disponibilitate: În depozitul extern

Expediem în 5-8 zile

826.09 lei

Our Subjects and Objectives. This book is about algebraic and symbolic computation and numerical com...

Informații despre carte

Autor

Dario A. Bini, Victor Y. Pan

Limbă

engleză

Legare

Carte - Carte broșată

Publicat

2013

Pagini

416

EAN

9781461266860

ISBN

1461266866

Enbook ID

06794868

Editura

Springer, Berlin

Greutate

664

Dimensiuni

155 x 235 x 22

Descriere completă

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.

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Polynomial and Matrix Computations

Fundamental Algorithms

Informații despre carte

Descriere completă

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și