A new iterative method for large sparse saddle point problems

DOI10.1080/00207160008804959zbMath0959.65051OpenAlexW2033896073WikidataQ126244175 ScholiaQ126244175MaRDI QIDQ4489987

Chang-jun Li, David J. Evans

Publication date: 16 April 2001

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160008804959

zbMATH Keywords

iterative methodpreconditionerlarge sparse saddle point problems

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 (10)

Optimum parameter for the SOR-like method for augmented systems ⋮ Generalized AOR method for the augmented system ⋮ Modified iterative method for augmented system ⋮ A generalization of the local Hermitian and skew-Hermitian splitting iteration methods for the non-Hermitian saddle point problems ⋮ A class of preconditioned generalized local PSS iteration methods for non-Hermitian saddle point problems ⋮ Modified SOR-like method for the augmented system ⋮ On local Hermitian and skew-Hermitian splitting iteration methods for generalized saddle point problems ⋮ On the iterative algorithm for large sparse saddle point problems ⋮ Two-parameter GSOR method for the augmented system ⋮ A variant of the AOR method for augmented systems

Cites Work

• A generalized successive overrelaxation method for least squares problems
• Unnamed Item

This page was built for publication: A new iterative method for large sparse saddle point problems