scientific article; zbMATH DE number 1069613

From MaRDI portal
Publication:4356575





The paper is a detailed and well written review of various Lanczos-type solvers for large linear systems with sparse nonsymmetric matrices. A list of about 150 references is given. Special attention is paid to possible breakdowns of the algorithms and ways to cure them. The important role of preconditioning is underlined and several examples of good preconditioners are given. Reviewer's remarks: One of the most effective approaches to grid systems \(Ax= b\) should be mentioned. It deals with the symmetrization \(B^{-1}A^* B^{-1}(Ax-b)= 0\), where \(B= B^*>0\) is a good model operator for \(A\) [see \textit{E. G. D'yakonov}, Optimization in solving elliptic problems (1996; Zbl 0852.65087)]. It enables one to use modified Richardson iterations with proper parameters and their adaption, as well. For the entire collection see [Zbl 0868.00024].




Cited in
(41)


Describes a project that uses

Uses Software






This page was built for publication:

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