Alternate strip-based substructuring algorithms for elliptic PDEs in two dimensions

Mihai, Loredana Angela ORCID: https://orcid.org/0000-0003-0863-3729 and Craig, Alan W. 2006. Alternate strip-based substructuring algorithms for elliptic PDEs in two dimensions. Ima Journal of Numerical Analysis 26 (2) , pp. 354-380. 10.1093/imanum/dri025

Full text not available from this repository.

Abstract

The alternate strip-based substructuring algorithms are efficient preconditioning techniques for the discrete systems which arise from the finite-element approximation of symmetric elliptic boundary-value problems in 2D Euclidean spaces. The new approach is based on alternate decomposition of the given domain into a finite number of strips. Each strip is a union of non-overlapping subdomains and the global interface between subdomains is partitioned as a union of edges between strips and edges between subdomains that belong to the same strip. Both scalability and efficiency are achieved by alternating the direction of the strips. This approach generates algorithms in two stages and allows the use of a two-grid V cycle. Numerical estimates illustrate the behaviour of the new domain decomposition techniques.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Subjects:	Q Science > QA Mathematics
Uncontrolled Keywords:	domain decomposition; Schwarz methods; Schur complement; iterative substructuring
Publisher:	Oxford University Press
ISSN:	0272-4979
Last Modified:	18 Oct 2022 12:43
URI:	https://orca.cardiff.ac.uk/id/eprint/11003

Citation Data

Cited 1 time in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item