Preconditioning Linear Saddle Point Problems

Torgeir Rusten () and Ragnar Winther ()
Additional contact information
Torgeir Rusten: SINTEF
Ragnar Winther: University of Oslo, Dept. of Informatics

Chapter 13 in Numerical Methods and Software Tools in Industrial Mathematics, 1997, pp 281-298 from Springer

Abstract: Abstract In this paper we discuss how certain saddle point problems, arising from discretizations of partial differential equations, should be preconditioned in order to obtain iterative methods which converge with a rate independent of the discretization parameters. The results for the discrete systems are motivated from corresponding results for the continuous systems. Our general approach is illustrated by studying Stokes’ problem, a mixed formulation of second order elliptic equations and a variational problem motivated from scattered data approximation.

Date: 1997
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-1984-2_13

Ordering information: This item can be ordered from
http://www.springer.com/9781461219842

DOI: 10.1007/978-1-4612-1984-2_13

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().