Optimization of one class of nonsymmetrizable algorithms for saddle point problems

DOI10.1515/RNAM-2002-0604zbMath1025.65020OpenAlexW2320403230MaRDI QIDQ4796487

Yu. V. Bychenkov

Publication date: 17 November 2003

Published in: Russian Journal of Numerical Analysis and Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/rnam-2002-0604

zbMATH Keywords

convergenceiterative methodsaddle point problemsArrow-Hurwicz algorithmsuccessive overrelaxation methodoptimal parametersymmetric indefinite matricesnondegenerate systemKobelkov algorithm

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (1)

Optimization of the generalized method of Hermitian and skew-Hermitian splitting iterations for solving symmetric saddle-point problems

This page was built for publication: Optimization of one class of nonsymmetrizable algorithms for saddle point problems