The Conjugate Orthogonal Conjugate Gradient (COCG) method has been recognized as an
attractive Lanczos-type Krylov subspace method for solving complex symmetric linear …

This book describes, in a basic way, the most useful and effective iterative solvers and
appropriate preconditioning techniques for some of the most important classes of large and …

In this paper, a new iteration method is proposed for solving the complex symmetric linear
systems. In theory, we show that the convergence factor or the upper bound of the spectral …

In many fields of scientific computing and data science, we frequently face the problem of
solving large and sparse linear systems of the form Ax= b, which is one of the most time …

Motivated by the celebrated extending applications of the well-established complex
Biconjugate Gradient (CBiCG) method to deal with large three-dimensional electromagnetic …

The description of discrete electromagnetic fields is achieved with the Maxwell grid
equations, a set of matrix equations representing a spatial discretisation of Maxwell's …

We propose an iterative solver with a folded preconditioner for large sparse systems of
linear algebraic equations (SLAEs), which are obtained as a result of a vector finite element …

In this paper, we introduce and analyze an accelerated preconditioning modification of the
Hermitian and skew-Hermitian splitting (APMHSS) iteration method for solving a broad class …

The conjugate orthogonal conjugate gradient (COCG) method has been considered an
attractive part of the Lanczos-type Krylov subspace method for solving complex symmetric …

We present two iterative algorithms for solving real nonsymmetric and complex non-
Hermitian linear systems of equations and that were developed from variants of the …