Limiting accuracy of segregated solution methods for nonsymmetric saddle point problems
From MaRDI portal
Publication:2480914
Recommendations
- Maximum Attainable Accuracy of Inexact Saddle Point Solvers
- scientific article; zbMATH DE number 1241444
- Numerical solution of saddle point problems
- Convergence of Some Iterative Methods for Symmetric Saddle Point Linear Systems
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
Cites work
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 671777 (Why is no real title available?)
- Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Constraint Preconditioning for Indefinite Linear Systems
- Estimating the Attainable Accuracy of Recursively Computed Residual Methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Inexact Krylov Subspace Methods for Linear Systems
- Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
- Iterative methods for stabilized mixed velocity-pressure finite elements
- Iterative solution techniques for the stokes and Navier‐Stokes equations
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- Methods of conjugate gradients for solving linear systems
- Numerical solution of saddle point problems
- On the solution of equality constrained quadratic programming problems arising in optimization
- Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme
- The N‐Step Iteration Procedures
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
Cited in
(2)
This page was built for publication: Limiting accuracy of segregated solution methods for nonsymmetric saddle point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480914)