Limiting accuracy of segregated solution methods for nonsymmetric saddle point problems
From MaRDI portal
Publication:2480914
DOI10.1016/j.cam.2007.03.021zbMath1136.65037OpenAlexW1982804731MaRDI QIDQ2480914
Pavel Jiránek, Miroslav Rozložnik
Publication date: 7 April 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2007.03.021
algorithmsnumerical examplesKrylov subspace methodsnull-space projection methodrounding error analysisnonsymmetric saddle point problemsnonsymmetric iterative methodsSchur complement reduction method
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme
- On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
- Iterative methods for stabilized mixed velocity-pressure finite elements
- Numerical solution of saddle point problems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Iterative solution techniques for the stokes and Navier‐Stokes equations
- Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
- Estimating the Attainable Accuracy of Recursively Computed Residual Methods
- Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Constraint Preconditioning for Indefinite Linear Systems
- Inexact Krylov Subspace Methods for Linear Systems
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- Methods of conjugate gradients for solving linear systems
- The N‐Step Iteration Procedures
This page was built for publication: Limiting accuracy of segregated solution methods for nonsymmetric saddle point problems
