An Introduction to Parallel and Vector Scientific Computation

In this introductory text, the fundamental algorithms of numerical linear algebra are developed in a parallel context.

Ronald W. Shonkwiler (Author), Lew Lefton (Author)

9780521864787, Cambridge University Press

Hardback, published 14 August 2006

308 pages, 10 tables 120 exercises
23.5 x 15.8 x 2.2 cm, 0.55 kg

'… in spite of the clear need to present these concepts to a much broader technical audience, there is a perplexing dearth of training material and textbooks in the field, particularly at the introductory level. … it is indeed refreshing to see the publication of the book An Introduction to Parallel and Vector Scientific Computing, written by Ronald W. Shonkwiler and Lew Lefton, both of the Georgia institute of Technology. They have taken the bull by the horns and produced a book that appears to be entirely satisfactory as an introductory textbook for use in such a course.' Scientific Programming

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.

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.

Subject Areas: Parallel processing [UYFP], Computer networking & communications [UT], Algorithms & data structures [UMB], Numerical analysis [PBKS]