A fast solver for the Stokes equations with distributed forces in complex geometries

被引:57
作者
Biros, G [1 ]
Ying, LX [1 ]
Zorin, D [1 ]
机构
[1] NYU, Courant Inst Math Sci, New York, NY 10012 USA
基金
美国国家科学基金会;
关键词
Stokes equations; fast solvers; integral equations; double-layer potential; fast multipole methods; embedded domain methods; immersed interface methods; fictitious domain methods; cartesian grid methods; moving boundaries;
D O I
10.1016/j.jcp.2003.08.011
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We present a new method for the solution of the Stokes equations. The main features of our method are: (1) it can be applied to arbitrary geometries in a black-box fashion; (2) it is second-order accurate; and (3) it has optimal algorithmic complexity. Our approach, to which we refer as the embedded boundary integral method (EBI), is based on Anita Mayo's work for the Poisson's equation: "The Fast Solution of Poisson's and the Biharmonic Equations on Irregular Regions", SIAM Journal on Numerical Analysis, 21 (1984) 285-299. We embed the domain in a rectangular domain, for which fast solvers are available, and we impose the boundary conditions as interface (jump) conditions on the velocities and tractions. We use an indirect boundary integral formulation for the homogeneous Stokes equations to compute the jumps. The resulting equations are discretized by Nystrom's method. The rectangular domain problem is discretized by finite elements for a velocity-pressure formulation with equal order interpolation bilinear elements (Q1-Q1). Stabilization is used to circumvent the inf-sup condition for the pressure space. For the integral equations, fast matrix-vector multiplications are achieved via an N log N algorithm based on a block representation of the discrete integral operator, combined with (kernel independent) singular value decomposition to sparsity low-rank blocks. The regular grid solver is a Krylov method (conjugate residuals) combined with an optimal two-level Schwartz-preconditioner. For the integral equation we use GMRES. We have tested our algorithm on several numerical examples and we have observed optimal convergence rates. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:317 / 348
页数:32
相关论文
共 57 条
[1]  
[Anonymous], 38 AER SCI M EXH REN
[2]  
ANTAKI JF, 2000, P SUP 2000 ACM IEEE
[3]  
Balay S, 1997, MODERN SOFTWARE TOOLS FOR SCIENTIFIC COMPUTING, P163
[4]  
BALAY S, 2001, PETSC HOME PAGE
[5]   A method for computing nearly singular integrals [J].
Beale, JT ;
Lai, MC .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 2001, 38 (06) :1902-1925
[6]  
BIROS G, 2002, P INT ASS BOUND EL M
[7]  
BOCHEV P, 2001, SAND20010733J SAND N
[8]   DIRECT SOLUTION OF DISCRETE POISSON EQUATION ON IRREGULAR REGIONS [J].
BUZBEE, BL ;
DORR, FW ;
GEORGE, JA ;
GOLUB, GH .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1971, 8 (04) :722-&
[9]   DOMAIN DECOMPOSITION ALGORITHMS FOR INDEFINITE ELLIPTIC PROBLEMS [J].
CAI, XC ;
WIDLUND, OB .
SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1992, 13 (01) :243-258
[10]  
Chan TonyF., 1994, Domain decomposition algorithms