Limiting accuracy of segregated solution methods for nonsymmetric saddle point problems

✍ Scribed by Pavel Jiránek; Miroslav Rozložník

• Publisher: Elsevier Science
• Year: 2008
• Tongue: English
• Weight: 352 KB
• Volume: 215
• Category: Article
• ISSN: 0377-0427
• DOI: 10.1016/j.cam.2007.03.021

✦ Synopsis

Nonsymmetric saddle point problems arise in a wide variety of applications in computational science and engineering. The aim of this paper is to discuss the numerical behavior of several nonsymmetric iterative methods applied for solving the saddle point systems via the Schur complement reduction or the null-space projection approach. Krylov subspace methods often produce the iterates which fluctuate rather strongly. Here we address the question whether large intermediate approximate solutions reduce the final accuracy of these two-level (inner-outer) iteration algorithms. We extend our previous analysis obtained for symmetric saddle point problems and distinguish between three mathematically equivalent back-substitution schemes which lead to a different numerical behavior when applied in finite precision arithmetic. Theoretical results are then illustrated on a simple model example.