Research reports

Short-term recurrences for indefinite preconditioning of saddle point problems

by M. Rozloznik and V. Simoncini

(Report number 2000-08)

Abstract
In this paper we analyze the null-space projection (constraint) indefinite preconditioner applied to the solution of large-scale saddle point problems. Nonsymmetric Krylov subspace solvers are considered and it is shown that the behavior of short-term recurrence methods can be related to the behavior of preconditioned conjugate gradient method (PCG). Theoretical properties of PCG are studied in detail and simple procedures for correcting possible misconvergence are proposed. The numerical behavior of the scheme on a real application problem is discussed and the maximum attainable accuracy of the approximate solution computed in finite precision arithmetic is estimated.

Keywords:

BibTeX
@Techreport{RS00_267,
  author = {M. Rozloznik and V. Simoncini},
  title = {Short-term recurrences for indefinite preconditioning of saddle point problems},
  institution = {Seminar for Applied Mathematics, ETH Z{\"u}rich},
  number = {2000-08},
  address = {Switzerland},
  url = {https://www.sam.math.ethz.ch/sam_reports/reports_final/reports2000/2000-08.pdf },
  year = {2000}
}

Disclaimer
© Copyright for documents on this server remains with the authors. Copies of these documents made by electronic or mechanical means including information storage and retrieval systems, may only be employed for personal use. The administrators respectfully request that authors inform them when any paper is published to avoid copyright infringement. Note that unauthorised copying of copyright material is illegal and may lead to prosecution. Neither the administrators nor the Seminar for Applied Mathematics (SAM) accept any liability in this respect. The most recent version of a SAM report may differ in formatting and style from published journal version. Do reference the published version if possible (see SAM Publications).

JavaScript has been disabled in your browser