Contents

• Contents
• List of Figures
• 1. Introduction
  • 1.1 Why should one use parallel computers ?
• 2. Parallel and vector computers
  • 2.1 Classifications
  • 2.2 Topologies
  • 2.3 Parallel extensions of operating systems and programming languages
• 3. Parallelism in algorithms
  • 3.1 Some definitions
  • 3.2 Synchronization of parallel processes
  • 3.3 Basic global operations
  • 3.4 Performance evaluation of parallel algorithms
• 4. Basic routines
  • 4.1 BLAS libraries
  • 4.2 Operations with sparse matrices
  • 4.3 Domain decomposition and basic numerical routines
• 5. Iterative methods
  • 5.1 CG method
  • 5.2 GMRES solver
  • 5.3 $\omega$-Jacobi iteration
  • 5.4 Gauß-Seidel iteration
  • 5.5 Incomplete factorizations
  • 5.6 Schur complement CG
  • 5.7 The multigrid method
  • 5.8 Preconditioning of iterative methods
• 6. Direct solvers
  • 6.1 Elimination by rotation matrices
  • 6.2 LU factorization
  • 6.3 Gauß elimination of tridiagonal matrices
  • 6.4 FFT
• 7. Conservation laws
  • 7.1 Incompressible Navier-Stokes equations
  • 7.2 Euler equations
  • 7.3 Compressible Navier-Stokes equations
• 8. Internet addresses
  • 8.1 MPI
  • 8.2 Further links
• 9. Some quotations
• Bibliography
• About this document ...