Publisher DOI: | 10.1007/s00791-015-0236-0 | Title: | Preconditioning sparse grad-div/augmented Lagrangian stabilized saddle point systems | Language: | English | Authors: | Le Borne, Sabine ![]() Rebholz, Leo G. |
Keywords: | augmented lagrangian;grad-div stabilization;oseen problem;preconditioner;schur complement;sparse grad-div | Issue Date: | 1-Mar-2015 | Publisher: | Springer | Source: | Computing and Visualization in Science 6 (16): 259-269 (2015) | Abstract (english): | This paper deals with the analysis of preconditioning techniques for a recently introduced sparse grad-div stabilization of the Oseen problem. The finite element discretization error for the Oseen problem can be reduced through the addition of a grad-div stabilization term to the momentum equation of the Oseen problem. Such a stabilization has an interesting effect on the properties of the discrete linear system of equations, in particular on the convergence properties of iterative solvers. Comparing to unstabilized systems, it swaps the levels of difficulties for solving the two main subproblems, i.e., solving for the first diagonal block and solving a Schur complement problem, that occur in preconditioners based on block triangular factorizations. In this paper we are concerned with a sparse variant of grad-div stabilization which has been shown to have a stabilization effect similar to the full grad-div stabilization while leading to a sparser system matrix. Our focus lies on the subsequent iterative solution of the discrete system of equations. |
URI: | http://hdl.handle.net/11420/4964 | ISSN: | 1433-0369 | Institute: | Mathematik E-10 | Document Type: | Article | Journal: | Computing and visualization in science |
Appears in Collections: | Publications without fulltext |
Show full item record
Page view(s)
80
Last Week
1
1
Last month
2
2
checked on Jun 27, 2022
SCOPUSTM
Citations
5
Last Week
0
0
Last month
0
0
checked on Jun 22, 2022
Google ScholarTM
Check
Add Files to Item
Note about this record
Cite this record
Export
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.