株式会社極東書店トップ > 商品一覧 > Polynomial and Matrix Computations: Fundamental Algorithms. Softcover reprint of the original 1st ed. 1994
商品詳細
Polynomial and Matrix Computations: Fundamental Algorithms. Softcover reprint of the original 1st ed. 1994
・ISBN 978-1-4612-6686-0 paper EUR 149.99
¥40,091.- (税込) ※(※)価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Bini, Dario / Pan, Victor Y., |
|---|---|
| シリーズ | (Progress in Theoretical Computer Science) |
| 出版社 | (Springer-Verlag New York Inc., US) |
| 出版年月 | 2012 |
| ページ数 | 416 pp. |
| 言語 | ENG |
| ニュース番号 | <A04-84014> |
解説
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.