A fast immersed boundary method for external incompressible viscous flows using lattice Green's functions
Sebastian Liska, Tim Colonius

TL;DR
This paper introduces a novel parallel immersed boundary method utilizing lattice Green's functions for efficient simulation of three-dimensional viscous incompressible flows on unbounded domains, significantly reducing computational cost.
Contribution
The paper presents a new immersed boundary method that combines lattice Green's functions, adaptive grids, and specialized solvers for efficient, accurate flow simulations on unbounded domains.
Findings
Accurately simulates flows around flat plates and spheres at Reynolds numbers up to 3,700.
Reduces computational time by limiting operations to regions near the immersed surface.
Demonstrates high fidelity and efficiency in complex flow simulations.
Abstract
A new parallel, computationally efficient immersed boundary method for solving three-dimensional, viscous, incompressible flows on unbounded domains is presented. Immersed surfaces with prescribed motions are generated using the interpolation and regularization operators obtained from the discrete delta function approach of the original (Peskin's) immersed boundary method. Unlike Peskin's method, boundary forces are regarded as Lagrange multipliers that are used to satisfy the no-slip condition. The incompressible Navier-Stokes equations are discretized on an unbounded staggered Cartesian grid and are solved in a finite number of operations using lattice Green's function techniques. These techniques are used to automatically enforce the natural free-space boundary conditions and to implement a novel block-wise adaptive grid that significantly reduces the run-time cost of solutions by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
