Conjugate Gradient Methods for Saddle Point Systems

Number of the records: 1

1.

SYSNO ASEP	0403740
Document Type	C - Proceedings Paper (int. conf.)
R&D Document Type	Conference Paper
Title	Conjugate Gradient Methods for Saddle Point Systems
Author(s)	Lukšan, Ladislav (UIVT-O)_{SAI, RID} Vlček, Jan (UIVT-O)_{SAI, RID, ORCID}
Source Title	Proceedings of the XIIIth summer school software and algorithms of numerical mathematics. - Plzeň : University of West Bohemia, 1999 - ISBN 80-7082-566-9
Pages	s. 223-230
Number of pages	8 s.
Action	SANM'99. Summer School on Software and Algorithms of Numerical Mathematics /13./
Event date	06.09.1999-10.09.1999
VEvent location	Nečtiny
Country	CZ - Czech Republic
Language	eng - English
Country	CZ - Czech Republic
Subject RIV	BA - General Mathematics
R&D Projects	IAA2030706 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
CEZ	1030915
Annotation	Conjugate gradient methods have proved to be very efficient for solving saddle point systems, especially with indefinite preconditioning. These systems are idefinite and have a 2x2 block structure. We study various structured conjugate gradient methods and prove their theoretical properties.
Workplace	Institute of Computer Science
Contact	Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
Year of Publishing	2001

Number of the records: 1