Irregular Loosely Synchronous Problems

• 12.1 Irregular Loosely Synchronous Problems Are Hard
• Simulation of the Electrosensory System of the Fish Gnathonemus petersii
  • 12.2.1 Physical Model
  • 12.2.2 Mathematical Theory
  • 12.2.3 Results
  • 12.2.4 Summary
• 12.3 Transonic Flow
  • 12.3.1 Compressible Flow Algorithm
  • 12.3.2 Adaptive Refinement
  • 12.3.3 Examples
  • 12.3.4 Performance
  • 12.3.5 Summary
• 12.4 Tree Codes for N-body Simulations
  • 12.4.1 Oct-Trees
  • 12.4.2 Computing Forces
  • 12.4.3 Parallelism in Tree Codes
  • 12.4.4 Acquiring Locally Essential Data
  • 12.4.5 Comments on Performance
• Fast Vortex Algorithm and ParallelComputing
  • 12.5.1 Vortex Methods
  • 12.5.2 Fast Algorithms
  • 12.5.3 Hypercube Implementation
  • 12.5.4 Efficiency of Parallel Implementation
  • 12.5.5 Results
• 12.6 Cluster Algorithms for Spin Models
  • 12.6.1 Monte Carlo Calculations of Spin Models
  • 12.6.2 Cluster Algorithms
  • 12.6.3 Parallel Cluster Algorithms
  • 12.6.4 Self-labelling
  • 12.6.5 Global Equivalencing
  • 12.6.6 Other Algorithms
  • 12.6.7 Summary
• 12.7 Sorting
  • 12.7.1 The Merge Strategy
  • 12.7.2 The Bitonic Algorithm
  • 12.7.3 Shellsort or Diminishing Increment Algorithm
  • 12.7.4 Quicksort or Samplesort Algorithm
• Hierarchical Tree-Structures as Adaptive Meshes
  • 12.8.1 Introduction
  • 12.8.2 Adaptive Structures
  • 12.8.3 Tree as Grid
  • 12.8.4 Conclusion