z-logo
Premium
A substructure‐based iterative inner solver coupled with Uzawa's algorithm for the Stokes problem
Author(s) -
Zsaki Attila,
Rixen Daniel,
Paraschivoiu Marius
Publication year - 2003
Publication title -
international journal for numerical methods in fluids
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.938
H-Index - 112
eISSN - 1097-0363
pISSN - 0271-2091
DOI - 10.1002/fld.612
Subject(s) - solver , feti , mathematics , lagrange multiplier , domain decomposition methods , mortar methods , iterative method , finite element method , algorithm , generalized minimal residual method , augmented lagrangian method , mathematical analysis , mathematical optimization , physics , thermodynamics
A domain decomposition method with Lagrange multipliers for the Stokes problem is developed and analysed. A common approach to solve the Stokes problem, termed the Uzawa algorithm, is to decouple the velocity and the pressure. This approach yields the Schur complement system for the pressure Lagrange multiplier which is solved with an iterative solver. Each outer iteration of the Uzawa procedure involves the inversion of a Laplacian in each spatial direction. The objective of this paper is to effectively solve this inner system (the vector Laplacian system) by applying the finite‐element tearing and interconnecting (FETI) method. Previously calculated search directions for the FETI solver are reused in subsequent outer Uzawa iterations. The advantage of the approach proposed in this paper is that pressure is continuous across the entire computational domain. Numerical tests are performed by solving the driven cavity problem. An analysis of the number of outer Uzawa iterations and inner FETI iterations is reported. Results show that the total number of inner iterations is almost numerically scalable since it grows asymptotically with the mesh size and the number of subdomains. Copyright © 2003 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here