Two-level iterative methods for solving the saddle point problems

Research output: Contribution to journalConference articlepeer-review

Abstract

Iterative processes in the Krylov subspaces for solving large ill conditioned saddle-type SLAEs with sparse matrices arising in finite difference, finite volume, and finite element approximations of multidimensional boundary value problems with complex geometric and functional properties of the initial data, characteristic of many relevant applications are studied. Combined two-level iterative algorithms using efficient Chebyshev acceleration and variational the conjugate directions methods, as well as the Golub-Kahan bi-diagonalization algorithms in the Krylov subspaces are considered. Examples of two-dimensional and three-dimensional filtration problems are used to study the resource consumption and computational performance of the proposed algorithms, as well as their scalable parallization on the multiprocessor systems with distributed and hierarchical shared memory.

Original languageEnglish
Article number012004
JournalJournal of Physics: Conference Series
Volume1715
Issue number1
DOIs
Publication statusPublished - 4 Jan 2021
EventInternational Conference on Marchuk Scientific Readings 2020, MSR 2020 - Akademgorodok, Novosibirsk, Russian Federation
Duration: 19 Oct 202023 Oct 2020

Fingerprint

Dive into the research topics of 'Two-level iterative methods for solving the saddle point problems'. Together they form a unique fingerprint.

Cite this