Preconditioners for generalized saddle-point problems

Files
TR Number
Date
2006
Journal Title
Journal ISSN
Volume Title
Publisher
Siam Publications
Abstract

We propose and examine block-diagonal preconditioners and variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. That is, we consider the nonsymmetric, nonsingular case where the ( 2,2) block is small in norm, and we are particularly concerned with the case where the ( 1,2) block is different from the transposed ( 2,1) block. We provide theoretical and experimental analyses of the convergence and eigenvalue distributions of the preconditioned matrices. We also extend the results of [ de Sturler and Liesen, SIAM J. Sci. Comput., 26 ( 2005), pp. 1598 - 1619] to matrices with nonzero ( 2,2) block and to the use of approximate Schur complements. To demonstrate the effectiveness of these preconditioners we show convergence results, spectra, and eigenvalue bounds for two model Navier - Stokes problems.

Description
Keywords
point problems, generalized saddle-point problems, iterative methods, preconditioning, Krylov subspace methods, eigenvalue bounds, indefinite linear-systems, Navier-Stokes equations, fast iterative, solution, block preconditioners, approximation, Optimization, inexact, part, mathematics, applied
Citation
Siefert, C.; De Sturler, E., "Preconditioners for generalized saddle-point problems," SIAM J. Numer. Anal., 44(3), 1275-1296, (2006). DOI: 10.1137/040610908