scholarly journals Well-Posed Boundary Conditions for the Navier--Stokes Equations

2005 ◽  
Vol 43 (3) ◽  
pp. 1231-1255 ◽  
Author(s):  
Jan Nordström ◽  
Magnus Svärd
Keyword(s):  
Boundary Conditions ◽  
Stokes Equations ◽  
Navier Stokes ◽  
Navier Stokes Equations ◽  
Well Posed

Parallel iterative finite-element algorithms for the Navier–Stokes equations with nonlinear slip boundary conditions

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Kangrui Zhou ◽  
Yueqiang Shang
Keyword(s):  
Finite Element ◽  
Boundary Conditions ◽  
Parallel Algorithms ◽  
Stokes Equations ◽  
Navier Stokes ◽  
Slip Boundary Conditions ◽  
Navier Stokes Equations ◽  
Slip Boundary ◽  
Parallel Iterative ◽  
Nonlinear Slip Boundary Conditions

AbstractBased on full domain partition, three parallel iterative finite-element algorithms are proposed and analyzed for the Navier–Stokes equations with nonlinear slip boundary conditions. Since the nonlinear slip boundary conditions include the subdifferential property, the variational formulation of these equations is variational inequalities of the second kind. In these parallel algorithms, each subproblem is defined on a global composite mesh that is fine with size h on its subdomain and coarse with size H (H ≫ h) far away from the subdomain, and then we can solve it in parallel with other subproblems by using an existing sequential solver without extensive recoding. All of the subproblems are nonlinear and are independently solved by three kinds of iterative methods. Compared with the corresponding serial iterative finite-element algorithms, the parallel algorithms proposed in this paper can yield an approximate solution with a comparable accuracy and a substantial decrease in computational time. Contributions of this paper are as follows: (1) new parallel algorithms based on full domain partition are proposed for the Navier–Stokes equations with nonlinear slip boundary conditions; (2) nonlinear iterative methods are studied in the parallel algorithms; (3) new theoretical results about the stability, convergence and error estimates of the developed algorithms are obtained; (4) some numerical results are given to illustrate the promise of the developed algorithms.

Sign in / Sign up

Export Citation Format

Share Document