For iterative solution of saddle point problems, a nonsymmetric preconditioning is studied which, with respect to the upper-left block of the system matrix, can be seen as a variant of SSOR. An idealized situation where the SSOR is taken with respect to the skew-symmetric part plus the diagonal part of the upper-left block is analyzed in detail. Since action of the preconditioner involves solution of a Schur complement system, an inexact form of the preconditioner can be of interest. This results in an inner-outer iterative process. Numerical experiments with solution of linearized Navier-Stokes equations demonstrate efficiency of the new preconditioner, especially when the left-upper block is far from symmetric

Botchev, M.A.

Golub, G.H.

English

For the iterative solution of saddle point problems, a nonsymmetric preconditioner is studied which, with respect to the upper-left block of the system matrix, can be seen as a variant of SSOR. An idealized situation where SSOR is taken with respect to the skew-symmetric part plus the diagonal part of the upper-left block is analyzed in detail. Since action of the preconditioner involves solution of a Schur complement system, an inexact form of the preconditioner can be of interest. This results in an inner-outer iterative process. Numerical experiments with solution of linearized Navier-Stokes equations demonstrate the efficiency of the new preconditioner, especially when the upper-left block is far from symmetric

Bochev, Mikhail A.

University of Twente Research Information

A Class of Nonsymmetric Preconditioners for Saddle Point Problems

For the iterative solution of saddle point problems, a nonsymmetric preconditioner is studied which, with respect to the upper-left block of the system matrix, can be seen as a variant of SSOR. An idealized situation where SSOR is taken with respect to the skew-symmetric part plus the diagonal part of the upper-left block is analyzed in detail. Since action of the preconditioner involves solution of a Schur complement system, an inexact form of the preconditioner can be of interest. This results in an inner-outer iterative process. Numerical experiments with solution of linearized Navier-Stokes equations demonstrate the efficiency of the new preconditioner, especially when the left-upper block is far from symmetric

NARCIS 

A class of nonsymmetric preconditioners for saddle point problems

A backward error analysis of a null space algorithm in sparse quadratic programming.

A generalized SSOR method. Nordisk Tidskr. Informationsbehandling (BIT),

A preconditioner for generalized saddle point problems.

A preconditioner for the steady-state Navier-Stokes equations.

A relaxation strategy for inexact matrix-vector products for Krylov methods.

An ecient iterative method for the generalized Stokes problem.

An iteration for inde systems and its application to the Navier{Stokes equations.

An iterative solver for the Oseen problem and numerical solution of incompressible Navier-Stokes equations.

An optimal preconditioner for a class of saddle point problems with a penalty term.

Analysis of iterative methods for saddle point problems: a uni approach.

Analysis of the inexact Uzawa algorithm for saddle point problems.

Approximate factorization constraint preconditioners for saddlepoint matrices.

Block triangular preconditioners for nonsymmetric saddle point problems:  analysis.

Block-diagonal and constraint preconditioners for nonsymmetric inde linear systems. part i: Theory.

Constraint preconditioning for inde linear systems.

Convergence accelaration of triangular iterative methods based on the skew symmetric part of the matrix.

Ecient implementation of a class of preconditioned conjugate gradient methods.

Ecient preconditioning of the linearized Navier-Stokes equations for incompressible ow.

Fast nonsymmetric iterations and preconditioning for NavierStokes equations.

Finite element approximation of the Navier-Stokes equations.

Finite Element Methods for Maxwell's Equations.

Finite Elements and Fast Iterative Solvers with Applications in Incompressible Fluid Dynamics.

Flexible inner-outer Krylov subspace methods.

GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems.

GMRESR: a family of nested GMRES methods.

Hermitian and skew-Hermitian splitting methods for non-Hermitian positive de linear systems.

Implicit dierence schemes and an iterative method for solving them for a certain class of systems of quasi-linear equations.

Inexact and preconditioned Uzawa algorithms for saddle point problems.

Inexact Krylov subspace methods for linear systems.

Inner and outer iterations for the Chebyshev algorithm.

Iterative linear solvers with approximate matrix-vector products.

Iterative methods for problems in computational uid dynamics. In Iterative methods in scienti computing (Hong Kong,

Iterative methods with preconditioners for inde systems.

Iterative Solution of Large Linear Systems.

Iterative Solution of Large Sparse Systems of Equations.

Iterative solution of strongly nonsymmetric systems of linear algebraic equations.

Matrix Analysis.

Matrix Computations. The Johns Hopkins

Navier-Stokes equations in rotation form: a robust multigrid solver for the velocity problem.

Numerical methods for nonlinear variational problems.

Numerical optimization.

Numerical solution of saddle point problems.

On solving block-structured inde linear systems.

On the solution of equality constrained quadratic programming problems arising in optimization.

Performance and analysis of saddle point preconditioners for the discrete steady-state Navier-Stokes equations.

Preconditioners for generalized saddle-point problems.

Preconditioners for inde systems arising in optimization.

Preconditioners for saddle point problems arising in computational uid dynamics.

Preconditioning for the steady-state Navier-Stokes equations with low viscosity.

Software for the workshop \Theoretical and practical aspects of incompressible CFD&quot;.

SOR-like methods for augmented systems.

Stable  calculation of incompressible ows using the rotation form of convection.

The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems.

The factorization of sparse symmetric inde matrices.

The mathematical theory of  element methods.

The numerical solution of equality constrained quadratic programming problems.

The rate of convergence of conjugate gradients.

The superlinear convergence of GMRES.

Uzawa type algorithms for nonsymmetric saddle point problems.

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.189.1191

A class of nonsymmetric preconditioners for saddle point problems

Abstract

Similar works

Full text

Available Versions

University of Twente Research Information

NARCIS

NARCIS

University of Twente Research Information