Novel Approach for Solving the Discrete Stokes Problems Based on Augmented Lagrangian and Global Techniques with Applications for Stokes Problems

Abstract

In this paper, a novel augmented Lagrangian preconditioner based on the global Arnoldi for accelerating the convergence of Krylov subspace methods is applied to linear systems of equations with a block three-by-three structure, and these systems typically arise from discretizing the Stokes equations using mixed finite-element methods. Spectral analyses are established for the exact versions of these preconditioners. Finally, the obtained numerical results claim that our novel approach is more efficient and robust for solving the discrete Stokes problems. The efficiency of our new approach is evaluated by measuring the computational time.

Keywords

Stokes equation / Saddle point problem / Krylov subspace method / Global Krylov subspace method / Augmented Lagrangian-based preconditioning / 65F10 / 65F08

References

[1] Arnoldi WE. The principle of minimized iterations in the solution of the matrix eigenvalue problem. Quart. Appl. Math., 1951, 9: 17-29

[2] Badahmane A, Bentbib AH, Sadok H. Preconditioned global Krylov subspace methods for solving saddle point problems with multiple right-hand sides. Electron. Trans. Numer. Anal., 2019, 51: 495-511

[3] Bai Z-Z, Golub GH. Accelerated Hermitian and skew-Hermitian splitting iteration methods for saddle-point problems. IMA J. Numer. Anal., 2007, 27: 1-23

[4] Bai Z-Z, Golub GH, Ng MK. Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems. SIAM J. Matrix Anal. Appl., 2003, 24: 603-626

[5] Bai Z-Z, Golub GH, Pan J-Y. Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hermitian positive semidefinite linear systems. Numer. Math., 2004, 98: 1-32

[6] Bai Z-Z, Parlett BN, Wang Z-Q. On generalized successive overrelaxation methods for augmented linear systems. Numer. Math., 2005, 102: 1-38

[7] Bai Z-Z, Wang Z-Q. On parameterized inexact Uzawa methods for generalized saddle point problems. Linear Algebra Appl., 2008, 428: 2900-2932

[8] Benzi M, Golub GH, Liesen J. Numerical solution of saddle point problems. Acta Numer., 2005, 14: 1-137

[9] Bramble JH, Pasciak JE, Vassilev AT. Analysis of the inexact Uzawa algorithm for saddle point problems. SIAM J. Numer. Anal., 1997, 34: 1072-1092

[10] Ebadi G, Alipour N, Vuik C. Deflated and augmented global Krylov subspace methods for the matrix equations. Appl. Numer. Math., 2016, 99: 137-150

[11] Elman HC, Silvester DJ, Wathen AJFinite Elements and Fast Iterative Solvers with Applications in Incompressible Fluid Dynamics, 2005New YorkOxford University Press

[12] Golub GH, Wu X, Yuan J-Y. SOR-like methods for augmented systems. BIT, 2001, 41: 71-85

[13] Guo P, Li C-X, Wu S-L. A modified SOR-like method for the augmented systems. J. Comput. Appl. Math., 2015, 274: 58-69

[14] Jbilou K, Sadok H, Tinzefte A. Oblique projection methods for linear systems with multiple right-hand sides. Electron. Trans. Numer. Anal., 2005, 20: 119-138

[15] Saad Y. A flexible inner-outer preconditioned GMRES algorithm. SIAM J. Sci. Comput., 1993, 14: 461-469

[16] Saad YIterative Methods for Sparse Linear Systems, 2003Philadelphia, PASIAM

[17] Saad Y, Schultz MH. A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comp., 1986, 7: 856-869

[18] Wang N-N, Li J-C. A class of new extended shift-splitting preconditioners for saddle point problems. J. Comput. Appl. Math., 2019, 357: 123-145

[19] Zhang J-J, Shang J-J. A class of Uzawa-SOR methods for saddle point problems. Appl. Math. Comput., 2010, 216: 2163-2168

[20] Zheng Q-Q, Ma C-F. Preconditioned AHSS-PU alternating splitting iterative methods for saddle point problems. Comput. Appl. Math., 2016, 273: 217-225

RIGHTS & PERMISSIONS

Shanghai University