Displaying similar documents to “A new optimized iterative method for solving M -matrix linear systems”

A dual-parameter double-step splitting iteration method for solving complex symmetric linear equations

Beibei Li, Jingjing Cui, Zhengge Huang, Xiaofeng Xie (2024)

Applications of Mathematics

Similarity:

We multiply both sides of the complex symmetric linear system A x = b by 1 - i ω to obtain a new equivalent linear system, then a dual-parameter double-step splitting (DDSS) method is established for solving the new linear system. In addition, we present an upper bound for the spectral radius of iteration matrix of the DDSS method and obtain its quasi-optimal parameter. Theoretical analyses demonstrate that the new method is convergent when some conditions are satisfied. Some tested examples are...

On the subspace projected approximate matrix method

Jan Brandts, Ricardo Reis da Silva (2015)

Applications of Mathematics

Similarity:

We provide a comparative study of the Subspace Projected Approximate Matrix method, abbreviated SPAM, which is a fairly recent iterative method of computing a few eigenvalues of a Hermitian matrix A . It falls in the category of inner-outer iteration methods and aims to reduce the costs of matrix-vector products with A within its inner iteration. This is done by choosing an approximation A 0 of A , and then, based on both A and A 0 , to define a sequence ( A k ) k = 0 n of matrices that increasingly better...

The new iteration methods for solving absolute value equations

Rashid Ali, Kejia Pan (2023)

Applications of Mathematics

Similarity:

Many problems in operations research, management science, and engineering fields lead to the solution of absolute value equations. In this study, we propose two new iteration methods for solving absolute value equations A x - | x | = b , where A ∈ ℝ n × n is an M -matrix or strictly diagonally dominant matrix, b ∈ ℝ n and x ∈ ℝ n is an unknown solution vector. Furthermore, we discuss the convergence of the proposed two methods under suitable assumptions. Numerical experiments are given to verify the feasibility, robustness...

Nonsingularity, positive definiteness, and positive invertibility under fixed-point data rounding

Jiří Rohn (2007)

Applications of Mathematics

Similarity:

For a real square matrix A and an integer d ≥ 0 , let A ( d ) denote the matrix formed from A by rounding off all its coefficients to d decimal places. The main problem handled in this paper is the following: assuming that A ( d ) has some property, under what additional condition(s) can we be sure that the original matrix A possesses the same property? Three properties are investigated: nonsingularity, positive definiteness, and positive invertibility. In all three cases it is shown that there exists...

Circulant matrices with orthogonal rows and off-diagonal entries of absolute value 1

Daniel Uzcátegui Contreras, Dardo Goyeneche, Ondřej Turek, Zuzana Václavíková (2021)

Communications in Mathematics

Similarity:

It is known that a real symmetric circulant matrix with diagonal entries d ≥ 0 , off-diagonal entries ± 1 and orthogonal rows exists only of order 2 d + 2 (and trivially of order 1 ) [Turek and Goyeneche 2019]. In this paper we consider a complex Hermitian analogy of those matrices. That is, we study the existence and construction of Hermitian circulant matrices having orthogonal rows, diagonal entries d ≥ 0 and any complex entries of absolute value 1 off the diagonal. As a particular case, we consider...