Convergence of relaxation iterative methods for saddle point problem

DOI10.1016/J.AMC.2014.11.047MaRDI QIDQ902975zbMATH OpenOpenAlexFDO

Authors Jae Heon Yun

Publication date 4 January 2016

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2014.11.047

zbMATH Keywords

preconditionerKrylov subspace methodsaddle point problemGSSOR methodMIAOR methodUSSOR method

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)

Recommendations

• On semi-convergence of a class of relaxation methods for singular saddle point problems
• SSOR-like methods for saddle point problems
• On equivalence of optimal relaxed block iterative methods for the singular nonsymmetric saddle point problem
• Acceleration of one-parameter relaxation methods for singular saddle point problems
• Fast one-parameter relaxation method with a scaled preconditioner for saddle point problems

Cites work

• scientific article; zbMATH DE number 3366440 (Why is no real title available?)
• A modified SSOR iterative method for augmented systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Fast Nonsymmetric Iterations and Preconditioning for Navier–Stokes Equations
• Generalized AOR method for the augmented system
• Minimum residual methods for augmented systems
• Modified SOR-like method for the augmented system
• Numerical methods for generalized least squares problems
• On generalized successive overrelaxation methods for augmented linear systems
• On generalized symmetric SOR method for augmented systems
• On parameterized inexact Uzawa methods for generalized saddle point problems
• On the augmented system approach to sparse least-squares problems
• Optimal parameters of the generalized symmetric SOR method for augmented systems
• Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hemitian positive semidefinite linear systems
• Preconditioned conjugate gradient method for generalized least squares problems
• SOR-like methods for augmented systems
• SSOR-like methods for saddle point problems
• Stability of Augmented System Factorizations in Interior-Point Methods
• Symmetric SOR method for augmented systems
• Variants of the Uzawa method for saddle point problem

Cited in

(10)

• A note on the optimal parameters of USSOR method for solving linear least squares problems
• Fast one-parameter relaxation method with a scaled preconditioner for saddle point problems
• Convergence of a class of stationary iterative methods for saddle point problems
• Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms
• Convergence of the cyclical relaxation method for linear inequalities
• On semi-convergence of a class of relaxation methods for singular saddle point problems
• Semi-convergence and relaxation parameters for a class of SIRT algorithms
• SSOR-like methods for saddle point problems
• Acceleration of one-parameter relaxation methods for singular saddle point problems
• A modified ASOR-like method for augmented linear systems

This page was built for publication: Convergence of relaxation iterative methods for saddle point problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q902975)