A Preconditioned Iterative Method for Saddlepoint Problems
- 1 July 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 13 (3) , 887-904
- https://doi.org/10.1137/0613054
Abstract
A preconditioned iterative method for indefinite linear systems corresponding to certain saddlepoint problems is suggested. The block structure of the systems is utilized in order to design effective preconditioners, while the governing iterative solver is a standard minimum residual method. The method is applied to systems derived from discretizations of the Stokes problem and mixed formulations of second-order elliptic problems.Keywords
This publication has 23 references indexed in Scilit:
- A domain decomposition technique for stokes problemsApplied Numerical Mathematics, 1990
- Preconditioning indefinite systems arising from mixed finite element discretization of second-order elliptic problemsPublished by Springer Nature ,1990
- Some iterative methods for incompressible flow problemsComputer Physics Communications, 1989
- The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systemsNumerische Mathematik, 1988
- A preconditioning technique for indefinite systems resulting from mixed approximations of elliptic problemsMathematics of Computation, 1988
- Mixed finite elements for second order elliptic problems in three variablesNumerische Mathematik, 1987
- Global estimates for mixed methods for second order elliptic equationsMathematics of Computation, 1985
- Solution of Large Linear Systems of Equations by Conjugate Gradient Type MethodsPublished by Springer Nature ,1983
- Analysis of some mixed finite element methods related to reduced integrationMathematics of Computation, 1982
- An analysis of the finite element method using Lagrange multipliers for the stationary Stokes equationsMathematics of Computation, 1976