An introduction to parallel and vector scientific computing
Author(s)
Bibliographic Information
An introduction to parallel and vector scientific computing
(Cambridge texts in applied mathematics, 41)
Cambridge University Press, 2006
- : pbk
Available at 14 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references and index
Description and Table of Contents
Description
In this text, students of applied mathematics, science and engineering are introduced to fundamental ways of thinking about the broad context of parallelism. The authors begin by giving the reader a deeper understanding of the issues through a general examination of timing, data dependencies, and communication. These ideas are implemented with respect to shared memory, parallel and vector processing, and distributed memory cluster computing. Threads, OpenMP, and MPI are covered, along with code examples in Fortran, C, and Java. The principles of parallel computation are applied throughout as the authors cover traditional topics in a first course in scientific computing. Building on the fundamentals of floating point representation and numerical error, a thorough treatment of numerical linear algebra and eigenvector/eigenvalue problems is provided. By studying how these algorithms parallelize, the reader is able to explore parallelism inherent in other computations, such as Monte Carlo methods.
Table of Contents
- Part I. Machines and Computation: 1. Introduction - the nature of high performance computation
- 2. Theoretical considerations - complexity
- 3. Machine implementations
- Part II. Linear Systems: 4. Building blocks - floating point numbers and basic linear algebra
- 5. Direct methods for linear systems and LU decomposition
- 6. Direct methods for systems with special structure
- 7. Error analysis and QR decomposition
- 8. Iterative methods for linear systems
- 9. Finding eigenvalues and eigenvectors
- Part III. Monte Carlo Methods: 10. Monte Carlo simulation
- 11. Monte Carlo optimization
- Appendix: programming examples.
by "Nielsen BookData"