On the iterative algorithm for large sparse saddle point problems

DOI10.1016/j.amc.2005.11.052zbMath1104.65028OpenAlexW2160556597MaRDI QIDQ2507831

Xiaofeng Ling, Xiaozhe Hu

Publication date: 5 October 2006

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

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

zbMATH Keywords

numerical examplespreconditioningspectral radiuseigenvalue distributionrelaxation parameterUzawa's algorithmconvergence condition

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

A note on the iterative algorithm for large sparse saddle point problems, On the iterative algorithm for saddle point problems, On local Hermitian and skew-Hermitian splitting iteration methods for generalized saddle point problems

Cites Work

• Unnamed Item
• Iterative techniques for time dependent Stokes problems
• Fast Uzawa algorithm for generalized saddle point problems
• A class of iterative methods for solving saddle point problems
• Two new variants of nonlinear inexact Uzawa algorithms for saddle-point problems
• An Iterative Method with Variable Relaxation Parameters for Saddle-Point Problems
• A Preconditioning Technique for Indefinite Systems Resulting from Mixed Approximations of Elliptic Problems
• Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
• A new iterative method for large sparse saddle point problems
• On the Nonlinear Inexact Uzawa Algorithm for Saddle-Point Problems
• On the Location of Zeros of Certain Classes of Polynomials with Applications to Numerical Analysis
• SOR-like methods for augmented systems