A preconditioned scheme for nonsymmetric saddle-point problems

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

In this paper, we present an effective preconditioning technique for solving nonsymmetric saddle-point problems. In particular, we consider those saddle-point problems that arise in the numerical simulation of particulate flows-flow of solid particles in incompressible fluids, using mixed finite element discretization of the Navier-Stokes equations. These indefinite linear systems are solved using a preconditioned Krylov subspace method with an indefinite preconditioner. This creates an inner-outer iteration, in which the inner iteration is handled via a preconditioned Richardson scheme. We provide an analysis of our approach that relates the convergence properties of the inner to the outer iterations. Also optimal approaches are proposed for the implicit construction of the Richardson's iteration preconditioner. The analysis is validated by numerical experiments that demonstrate the robustness of our scheme, its lack of sensitivity to changes in the fluid-particle system, and its scalability.

Original languageEnglish
Title of host publicationHigh-Performance Scientific Computing: Algorithms and Applications
PublisherSpringer-Verlag London Ltd
Pages219-250
Number of pages32
Volume9781447124375
ISBN (Electronic)9781447124375
ISBN (Print)1447124367, 9781447124368
DOIs
Publication statusPublished - 1 Oct 2012
Externally publishedYes

Fingerprint

Flow of solids
Fluids
Navier Stokes equations
Linear systems
Scalability
Computer simulation
Experiments

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Baggag, A. (2012). A preconditioned scheme for nonsymmetric saddle-point problems. In High-Performance Scientific Computing: Algorithms and Applications (Vol. 9781447124375, pp. 219-250). Springer-Verlag London Ltd. https://doi.org/10.1007/978-1-4471-2437-5_11

A preconditioned scheme for nonsymmetric saddle-point problems. / Baggag, Abdelkader.

High-Performance Scientific Computing: Algorithms and Applications. Vol. 9781447124375 Springer-Verlag London Ltd, 2012. p. 219-250.

Research output: Chapter in Book/Report/Conference proceedingChapter

Baggag, A 2012, A preconditioned scheme for nonsymmetric saddle-point problems. in High-Performance Scientific Computing: Algorithms and Applications. vol. 9781447124375, Springer-Verlag London Ltd, pp. 219-250. https://doi.org/10.1007/978-1-4471-2437-5_11
Baggag A. A preconditioned scheme for nonsymmetric saddle-point problems. In High-Performance Scientific Computing: Algorithms and Applications. Vol. 9781447124375. Springer-Verlag London Ltd. 2012. p. 219-250 https://doi.org/10.1007/978-1-4471-2437-5_11
Baggag, Abdelkader. / A preconditioned scheme for nonsymmetric saddle-point problems. High-Performance Scientific Computing: Algorithms and Applications. Vol. 9781447124375 Springer-Verlag London Ltd, 2012. pp. 219-250
@inbook{ab7d459306b34fe4b46bb74288a33786,
title = "A preconditioned scheme for nonsymmetric saddle-point problems",
abstract = "In this paper, we present an effective preconditioning technique for solving nonsymmetric saddle-point problems. In particular, we consider those saddle-point problems that arise in the numerical simulation of particulate flows-flow of solid particles in incompressible fluids, using mixed finite element discretization of the Navier-Stokes equations. These indefinite linear systems are solved using a preconditioned Krylov subspace method with an indefinite preconditioner. This creates an inner-outer iteration, in which the inner iteration is handled via a preconditioned Richardson scheme. We provide an analysis of our approach that relates the convergence properties of the inner to the outer iterations. Also optimal approaches are proposed for the implicit construction of the Richardson's iteration preconditioner. The analysis is validated by numerical experiments that demonstrate the robustness of our scheme, its lack of sensitivity to changes in the fluid-particle system, and its scalability.",
author = "Abdelkader Baggag",
year = "2012",
month = "10",
day = "1",
doi = "10.1007/978-1-4471-2437-5_11",
language = "English",
isbn = "1447124367",
volume = "9781447124375",
pages = "219--250",
booktitle = "High-Performance Scientific Computing: Algorithms and Applications",
publisher = "Springer-Verlag London Ltd",

}

TY - CHAP

T1 - A preconditioned scheme for nonsymmetric saddle-point problems

AU - Baggag, Abdelkader

PY - 2012/10/1

Y1 - 2012/10/1

N2 - In this paper, we present an effective preconditioning technique for solving nonsymmetric saddle-point problems. In particular, we consider those saddle-point problems that arise in the numerical simulation of particulate flows-flow of solid particles in incompressible fluids, using mixed finite element discretization of the Navier-Stokes equations. These indefinite linear systems are solved using a preconditioned Krylov subspace method with an indefinite preconditioner. This creates an inner-outer iteration, in which the inner iteration is handled via a preconditioned Richardson scheme. We provide an analysis of our approach that relates the convergence properties of the inner to the outer iterations. Also optimal approaches are proposed for the implicit construction of the Richardson's iteration preconditioner. The analysis is validated by numerical experiments that demonstrate the robustness of our scheme, its lack of sensitivity to changes in the fluid-particle system, and its scalability.

AB - In this paper, we present an effective preconditioning technique for solving nonsymmetric saddle-point problems. In particular, we consider those saddle-point problems that arise in the numerical simulation of particulate flows-flow of solid particles in incompressible fluids, using mixed finite element discretization of the Navier-Stokes equations. These indefinite linear systems are solved using a preconditioned Krylov subspace method with an indefinite preconditioner. This creates an inner-outer iteration, in which the inner iteration is handled via a preconditioned Richardson scheme. We provide an analysis of our approach that relates the convergence properties of the inner to the outer iterations. Also optimal approaches are proposed for the implicit construction of the Richardson's iteration preconditioner. The analysis is validated by numerical experiments that demonstrate the robustness of our scheme, its lack of sensitivity to changes in the fluid-particle system, and its scalability.

UR - http://www.scopus.com/inward/record.url?scp=84949175582&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84949175582&partnerID=8YFLogxK

U2 - 10.1007/978-1-4471-2437-5_11

DO - 10.1007/978-1-4471-2437-5_11

M3 - Chapter

SN - 1447124367

SN - 9781447124368

VL - 9781447124375

SP - 219

EP - 250

BT - High-Performance Scientific Computing: Algorithms and Applications

PB - Springer-Verlag London Ltd

ER -