On parameterized inexact Uzawa methods for generalized saddle point problems
type: Item
instance of: scholarly article
title: On parameterized inexact Uzawa methods for generalized saddle point problems
zbMATH Open document ID: 1144.65020
author: Zeng-Qi Wang
author: Zhong-Zhi Bai
published in: Linear Algebra and its Applications
publication date: 2008-05-15T00:00:00Z
review text: The authors present a development of a parametrized inexact Uzawa algorithm that they introduced in a previous paper, to the class of large sparse generalized saddle point problems. They prove convergence of the extended algorithm and also determine its quasi-optimal iteration parameters and convergence factors.
reviewed by: Constantin Popa
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65F50
zbMATH DE Number: 5275773
zbMATH Keywords: generalized saddle point problem
zbMATH Keywords: parametrized inexact Uzawa method
zbMATH Keywords: acceleration technique
zbMATH Keywords: convergence
zbMATH Keywords: quasi-optimal relaxation parameter
zbMATH Keywords: quasi-optimal convergence factor
zbMATH Keywords: algorithm
MaRDI profile type: Publication
full work available at URL: j.laa.2008.01.018
OpenAlex ID: W2026635066
cites work: Q3266142
cites work: Iterative Solution Methods
cites work: On the convergence of the generalized matrix multisplitting relaxed methods
cites work: A class of modified block SSOR preconditioners for symmetric positive definite systems of linear equations
cites work: Modified block SSOR preconditioners for symmetric positive definite linear systems
cites work: Structured preconditioners for nonsingular matrices of block two-by-two structures
cites work: On generalized successive overrelaxation methods for augmented linear systems
cites work: Q4874936
cites work: Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems
cites work: Mixed and Hybrid Finite Element Methods
cites work: Fast Uzawa algorithm for generalized saddle point problems
cites work: Fast Uzawa algorithms for solving non‐symmetric stabilized saddle point problems
cites work: Conjugate Gradient Methods for Toeplitz Systems
cites work: Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
cites work: Minimum residual methods for augmented systems
cites work: Q3038523
cites work: Q5689624
cites work: SOR-like methods for augmented systems
cites work: An iterative method with variable relaxation parameters for saddle-point problems
cites work: A generalized successive overrelaxation method for least squares problems
cites work: On the Location of Zeros of Certain Classes of Polynomials with Applications to Numerical Analysis
cites work: Preconditioning of elliptic problems by approximation in the transform domain
cites work: On the convergence of the generalized AOR method
cites work: On the convergence of the MAOR method
cites work: Iterative Krylov Methods for Large Linear Systems
cites work: Q5342712
cites work: Generalized extrapolation principle and convergence of some generalized iterative methods
cites work: Convergence for a general form of the GAOR method and its application to the MSOR method
cites work: Q5604166
DOI: 10.1016/J.LAA.2008.01.018
description: scientific article; zbMATH DE number 5275773