株式会社極東書店トップ ＞ 商品一覧 ＞ Compact Numerical Methods for Computers : Linear Algebra and Function Minimisation.
商品詳細
Compact Numerical Methods for Computers : Linear Algebra and Function Minimisation.
・ISBN 978-1-138-41310-8 2018 hard GB£ 124.99
￥39,596.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
・ISBN 978-0-85274-319-5 1990 paper GB£ 54.99
￥17,420.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
電子版あり 大学・学術機関向け電子ブック（eBook）ISBN 978-1-315-13978-4
| 著者・編者 | Nash, John C., |
|---|---|
| 出版社 | (CRC Press, UK) |
| ページ数 | 290 pp. |
| 言語 | ENG |
| ニュース番号 | ＜M25-12185＞ |
解説
This second edition of Compact Numerical Methods for Computers presents reliable yet compact algorithms for computational problems. As in the previous edition, the author considers specific mathematical problems of wide applicability, develops approaches to a solution and the consequent algorithm, and provides the program steps. He emphasizes useful applicable methods from various scientific research fields, ranging from mathematical physics to commodity production modeling. While the ubiquitous personal computer is the particular focus, the methods have been implemented on computers as small as a programmable pocket calculator and as large as a highly parallel supercomputer.
New to the Second Edition
The accompanying software (available by coupon at no charge) includes not only the algorithm source codes, but also driver programs, example data, and several utility codes to help in the software engineering of end-user programs. The codes are designed for rapid implementation and reliable use in a wide variety of computing environments. Scientists, statisticians, engineers, and economists who prepare/modify programs for use in their work will find this resource invaluable. Moreover, since little previous training in numerical analysis is required, the book can also be used as a supplementary text for courses on numerical methods and mathematical software.