Publisher URL: https://elibm.org/article/10006039
Title: Joint domain-decomposition H-LU preconditioners for saddle point problems
Language: English
Authors: Le Borne, Sabine  
Oliveira, Suely 
Keywords: Data-sparse approximation; Factorization; Hierarchical matrices; Oseen equations; Preconditioning
Issue Date: 1-Dec-2007
Publisher: Kent State University
Source: Electronic Transactions on Numerical Analysis 26 (): 285-298 (2007-12-01)
Abstract (english): 
For saddle point problems in fluid dynamics, several popular preconditioners exploit the block structure of the problem to construct block triangular preconditioners. The performance of such preconditioners depends on whether fast, approximate solvers for the linear systems on the block diagonal (representing convection-diffusion problems) as well as for the Schur complement (in the pressure variables) are available. In this paper, we will introduce a completely different approach in which we ignore this given block structure. We will instead compute an approximate LU-factorization of the complete system matrix using hierarchical matrix techniques. In particular, we will use domain-decomposition clustering with an additional local pivoting strategy to order the complete index set. As a result, we obtain an H-matrix structure in which an H-LU factorization is computed more efficiently and with higher accuracy than for the corresponding block structure based clustering. H-LU preconditioners resulting from the block and joint approaches will be discussed and compared through numerical results. Copyright © 2007, Kent State University.
URI: http://hdl.handle.net/11420/10620
ISSN: 1068-9613
Journal: Electronic transactions on numerical analysis 
Document Type: Article
Appears in Collections:Publications without fulltext

Show full item record

Page view(s)

30
Last Week
0
Last month
1
checked on Jun 9, 2023

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
checked on Jun 30, 2022

Google ScholarTM

Check

Add Files to Item

Note about this record

Export

Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.