ISSN:
1070-5325
Keywords:
Preconditioning
;
Diagonal compensation
;
Eigenvalue bounds
;
Engineering
;
Engineering General
Source:
Wiley InterScience Backfile Collection 1832-2000
Topics:
Mathematics
Notes:
When solving linear algebraic equations with large and sparse coefficient matrices, arising, for instance, from the discretization of partial differential equations, it is quite common to use preconditioning to accelerate the convergence of a basic iterative scheme. Incomplete factorizations and sparse approximate inverses can provide efficient preconditioning methods but their existence and convergence theory is based mostly on M-matrices (H-matrices). In some application areas, however, the arising coefficient matrices are not H-matrices. This is the case, for instance, when higher-order finite element approximations are used, which is typical for structural mechanics problems. We show that modification of a symmetric, positive definite matrix by reduction of positive offdiagonal entries and diagonal compensation of them leads to an M-matrix. This diagonally compensated reduction can take place in the whole matrix or only at the current pivot block in a recursive incomplete factorization method. Applications for constructing preconditioning matrices for finite element matrices are described.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1002/nla.1680010207
Permalink
