Fundamental algorithms
Author(s)
Bibliographic Information
Fundamental algorithms
（Progress in theoretical computer science, . Polynomial and matrix computations ; 1）
Birkhäuser, 1994
- :us
- :sz
Available at / 29 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
- Volume
-
:us ISBN 9780817637866
Description
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.
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..
- Volume
-
:sz ISBN 9783764337865
Description
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.
by "Nielsen BookData"
