The preconditioned iterative methods with variable parameters for saddle point problem
From MaRDI portal
Publication:2335524
DOI10.1016/j.amc.2018.03.118zbMath1427.65042OpenAlexW2800004928WikidataQ129971735 ScholiaQ129971735MaRDI QIDQ2335524
Publication date: 14 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.03.118
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On HSS-based sequential two-stage method for non-Hermitian saddle point problems
- An efficient numerical method for preconditioned saddle point problems
- On preconditioned Uzawa methods and SOR methods for saddle-point problems
- Performance and analysis of saddle point preconditioners for the discrete steady-state Navier-Stokes equations
- A class of iterative methods for solving saddle point problems
- Preconditioners for saddle point problems arising in computational fluid dynamics
- Two new variants of nonlinear inexact Uzawa algorithms for saddle-point problems
- Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hemitian positive semidefinite linear systems
- On generalized parameterized inexact Uzawa method for a block two-by-two linear system
- An adaptive inverse iteration for Maxwell eigenvalue problem based on edge elements
- On generalized successive overrelaxation methods for augmented linear systems
- An Efficient Linear Solver for Nonlinear Parameter Identification Problems
- On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
- Analysis of iterative methods for saddle point problems: a unified approach
- An Iterative Method with Variable Relaxation Parameters for Saddle-Point Problems
- The Numerical Solution of Equality-Constrained Quadratic Programming Problems
- Algorithm 866
- A Preconditioning Technique for Indefinite Systems Resulting from Mixed Approximations of Elliptic Problems
- The Convergence Factor of Preconditioned Algorithms of the Arrow–Hurwicz Type
- Mixed and Hybrid Finite Element Methods
- A Preconditioned Iterative Method for Saddlepoint Problems
- Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
- Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems
- An Efficient Iterative Method for the Generalized Stokes Problem
- An Iteration for Indefinite Systems and Its Application to the Navier--Stokes Equations
- An Optimal Preconditioner for a Class of Saddle Point Problems with a Penalty Term
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- Block Triangular and Skew-Hermitian Splitting Methods for Positive-Definite Linear Systems
- A null space algorithm for mixed finite-element approximations of Darcy's equation
- Block-diagonal and indefinite symmetric preconditioners for mixed finite element formulations
- Nonlinear Inexact Uzawa Algorithms for Linear and Nonlinear Saddle-point Problems
- SOR-like methods for augmented systems
