Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-08T14:20:14.405Z Has data issue: false hasContentIssue false
  • English
  • Français

Numerical solution of saddle point problems

Published online by Cambridge University Press:  19 April 2005

Michele Benzi ,
Gene H. Golub  and
Jörg Liesen
Michele Benzi
Affiliation:
Department of Mathematics and Computer Science, Emory University, Atlanta, Georgia 30322, USA, E-mail: benzi@mathcs.emory.edu
Gene H. Golub
Affiliation:
Scientific Computing and Computational Mathematics Program, Stanford University, Stanford, California 94305-9025, USA, E-mail: golub@sccm.stanford.edu
Jörg Liesen
Affiliation:
Institut für Mathematik, Technische Universität Berlin, D-10623 Berlin, Germany, E-mail: liesen@math.tu-berlin.de
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Large linear systems of saddle point type arise in a wide variety of applications throughout computational science and engineering. Due to their indefiniteness and often poor spectral properties, such linear systems represent a significant challenge for solver developers. In recent years there has been a surge of interest in saddle point problems, and numerous solution techniques have been proposed for this type of system. The aim of this paper is to present and discuss a large selection of solution methods for linear systems in saddle point form, with an emphasis on iterative methods for large and sparse problems.

Information

Type
Research Article
Information
Acta Numerica , Volume 14 , May 2005 , pp. 1 - 137
Copyright
© 2005 Cambridge University Press