Binary interaction algorithms for the simulation of flocking and swarming dynamics

G. Albi, L. Pareschi

Research output: Contribution to journalArticlepeer-review

63 Scopus citations

Abstract

Microscopic models of flocking and swarming take into account large numbers of interacting individuals. Numerical resolution of large flocks implies huge computational costs. Typically for N interacting individuals we have a cost of O(N2). We tackle the problem numerically by considering approximated binary interaction dynamics described by kinetic equations and simulating such equations by suitable stochastic methods. This approach permits us to compute approximate solutions as functions of a small scaling parameter e at a reduced complexity of O(N) operations. Several numerical results show the efficiency of the algorithms proposed.

Original languageEnglish
Pages (from-to)1-29
Number of pages29
JournalMultiscale Modeling and Simulation
Volume11
Issue number1
DOIs
StatePublished - 2013
Externally publishedYes

Keywords

  • Collective behavior
  • Flocking
  • Kinetic models
  • Mean-field models
  • Monte carlo methods
  • Swarming

Fingerprint

Dive into the research topics of 'Binary interaction algorithms for the simulation of flocking and swarming dynamics'. Together they form a unique fingerprint.

Cite this