Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2503.02361

Positive semidefinite and positive semidefinite splitting iteration methods for solving nonsingular positive semidefinite systems

Mohsen Masoudi·Davod Khojasteh Salkuyeh
View original source ↗Read source document ↗Export metadata ↓

Abstract

This article introduces an iterative method for solving nonsingular positive semidefinite systems of linear equations. To construct the iteration process, the coefficient matrix is split into two 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.

Explore related subjects

math.NAcs.NA

Keep this discovery

BibTeXRIS

Mohsen Masoudi, Davod Khojasteh Salkuyeh. 2026-09-04. Positive semidefinite and positive semidefinite splitting iteration methods for solving nonsingular positive semidefinite systems. https://doi.org/10.4208/nmtma.oa-2025-0134

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.NA subjectmath.NA subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT↗
arXiv2026

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA↗
arXiv2021

$L^p$-Convergence Rate of Backward Euler Schemes for Monotone SDEs

We give a unified method to derive the strong convergence rate of the backward Euler scheme for monotone SDEs in $L^p(Ω)$-norm, with general $p \ge 4$. The results are applied to the backward Euler scheme of SODEs with polynomial growth coefficients. We also generalize the argument to the Galerkin-based backward Euler scheme of SPDEs with polynomial growth coefficients driven by multiplicative trace-class noise.

math.NA↗