Maximum Attainable Accuracy of Inexact Saddle Point Solvers

DOI10.1137/060659727zbMath1156.65029OpenAlexW1984091866MaRDI QIDQ3537450

Pavel Jiránek, Miroslav Rozložnik

Publication date: 6 November 2008

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/060659727

zbMATH Keywords

saddle point problemsKrylov subspace methodrounding error analysisSchur complement reductionnull-space projection methods

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Roundoff error (65G50) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (2)

On nonlinear inexact Uzawa algorithms for stabilized saddle point problems ⋮ On the Numerical Behavior of Matrix Splitting Iteration Methods for Solving Linear Systems

Uses Software

• mctoolbox

This page was built for publication: Maximum Attainable Accuracy of Inexact Saddle Point Solvers