scientific article; zbMATH DE number 428959

From MaRDI portal
Publication:3137753





The idea of incomplete factorization is to find an approximate LU- decomposition of a given matrix \(A\) with sparse factors and to use it to the preconditioning of \(A\). The incomplete factorization turns out to be one of the most powerful methods of preconditioning for a large class of matrices arising from discretization of differential operators. This book gives an authoritative and selfcontained account of the development of incomplete factorization methods. In particular, the author gives a full account of the results of N. I. Buleev and his followers including himself. However, the most important results of other researchers are also covered. After recalling necessary results of linear algebra in Chapter 1, the author presents the Buleev explicit methods in terms of grid functions as a formal generalization of the decomposition of tridiagonal matrices with a modification proposed by Buleev to improve the preconditioning effect. The grid functions are then used to explain other methods including second order factorization methods, implicit grid methods and the methods of \(h\)-factorization. In Chapter 3 the author presents the matrix form of the incomplete factorization for \(M\)-matrices and block-tridiagonal matrices. The presentation includes applications to the domain decomposition methods and the discussion of the relation between the Buleev method and \(MIC(q)\) methods. Theoretical results on correctness and stability of incomplete factorization and estimates of the rate of convergence are presented in Chapter 4. Some results are extended to the solution of parabolic and convection-diffusion problems. The book is completed with numerical experiments and a discussion of unsolved problems. The list of references comprises 182 items.











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 Q3137753)