Positive semidefinite/positive semidefinite splitting iteration methods for solving nonsingular non-Hermitian positive semidefinite systems

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.

Authors

Publication Details

Journal
ArXiv.org
Published
2025-03-04
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Positive semidefinite/positive semidefinite splitting iteration methods for solving nonsingular non-Hermitian positive semidefinite systems

Davod Khojasteh Salkuyeh, Mohsen Masoudi
ArXiv.org
Matrix Theory and Algorithms
article

Positive semidefinite/positive semidefinite splitting iteration methods for solving nonsingular non-Hermitian positive semidefinite systems

Davod Khojasteh Salkuyeh, Mohsen Masoudi
article en

Abstract

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.

ArXiv.org
Openalex Percentile: Top 69%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Positive semidefinite/positive semidefinite splitting iteration methods for solving nonsingular non-Hermitian positive semidefinite systems — Davod Khojasteh Salkuyeh, Mohsen Masoudi · ArXiv.org (2025) | TGRS Research Map | TGRS