Positive semidefinite/positive semidefinite splitting iteration methods for solving nonsingular non-Hermitian positive semidefinite systems
By: Davod Khojasteh Salkuyeh, Mohsen Masoudi
Potential Business Impact:
Solves hard math problems faster for computers.
This article introduces an iterative method for solving nonsingular non-Hermitian positive semidefinite systems of linear equations. To construct the iteration process, the coefficient matrix is split into two non-Hermitian positive semidefinite matrices along with an arbitrary Hermitian positive definite shift matrix. Several conditions are established to guarantee the convergence of method and suggestions are provided for selecting the matrices involved in the desired splitting. We explore selection process of the shift matrix and determine the optimal parameter in a specific scenario. The proposed method aims to generalize previous approaches and improve the conditions for convergence theorems. In addition, we examine two special cases of this method and compare the induced preconditioners with some state-of-art preconditioners. Numerical examples are given to demonstrate effectiveness of the presented preconditioners.
Similar Papers
A Lie algebra view of matrix splittings
Numerical Analysis
Makes computer math problems solve much faster.
On alternating-conjugate splitting methods
Numerical Analysis
Makes computer math problems solve better over time.
Polynomial and Parallelizable Preconditioning for Block Tridiagonal Positive Definite Matrices
Optimization and Control
Speeds up robots solving hard math problems.