A boundary integral method for simulating the dynamics of inextensible vesicles suspended in a viscous fluid in 2D

  • Authors:

  • Shravan K. Veerapaneni;Denis Gueyffier;Denis Zorin;George Biros

  • Affiliations:

  • School of Engineering and Applied Sciences, University of Pennsylvania, Philadelphia, PA 19104, United States;Courant Institute of Mathematical Sciences, New York University, New York 10012, United States;Courant Institute of Mathematical Sciences, New York University, New York 10012, United States;College of Computing, Georgia Institute of Technology, Atlanta GA 30332, United States

  • Venue:
  • Journal of Computational Physics
  • Year:
  • 2009

Quantified Score

Hi-index 31.51

Visualization

Abstract

We present a new method for the evolution of inextensible vesicles immersed in a Stokesian fluid. We use a boundary integral formulation for the fluid that results in a set of nonlinear integro-differential equations for the vesicle dynamics. The motion of the vesicles is determined by balancing the non-local hydrodynamic forces with the elastic forces due to bending and tension. Numerical simulations of such vesicle motions are quite challenging. On one hand, explicit time-stepping schemes suffer from a severe stability constraint due to the stiffness related to high-order spatial derivatives and a milder constraint due to a transport-like stability condition. On the other hand, an implicit scheme can be expensive because it requires the solution of a set of nonlinear equations at each time step. We present two semi-implicit schemes that circumvent the severe stability constraints on the time step and whose computational cost per time step is comparable to that of an explicit scheme. We discretize the equations by using a spectral method in space, and a multistep third-order accurate scheme in time. We use the fast multipole method (FMM) to efficiently compute vesicle-vesicle interaction forces in a suspension with a large number of vesicles. We report results from numerical experiments that demonstrate the convergence and algorithmic complexity properties of our scheme.