Matrix compensation and diagonal compensation
Let \(A\) be a symmetric positive definite matrix which is decomposed as \(A=B+R\) in some natural way. Typically \(B\) has a special sparsity pattern and \(R\) can be considered as a ``rest. A matrix \(D\) is called a compensative matrix of \(R\) if \(D-R\) is positive semidefinite. Now define \(M=B+D\), so \(M\) is a compensative matrix of \(A\). \(M\) can be an efficient preconditioner of \(A\). In the paper diagonal compensation is generalized to positive definite matrices. The aim is to preserve the positivity of matrices. Several results are proved on the condition of the preconditioned matrices but no numerical examples are given.
- The method of diagonal compensation of reduced matrix entries and multilevel iteration
- scientific article; zbMATH DE number 1286374
- scientific article; zbMATH DE number 958443
- Constraint preconditioners for symmetric indefinite matrices
- Diagonally compensated reduction and related preconditioning methods
- A class of first order factorization methods
- A generalized SSOR method
- Convergence of block iterative methods for linear systems arising in the numerical solution of Euler equations
- Diagonally compensated reduction and related preconditioning methods
- Graph perturbations
- scientific article; zbMATH DE number 3854346 (Why is no real title available?)
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- Iterative Solution Methods
- On a class of matrices which arise in the numerical solution of Euler equations
This page was built for publication: Matrix compensation and diagonal compensation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917856)