The shifted classical circulant and skew circulant splitting iterative methods for Toeplitz matrices

It is known that every Toeplitz matrix T enjoys a circulant and skew circulant splitting (denoted by CSCS), i.e., T=C-S with C a circulant matrix and S a skew circulant matrix. Based on the variant of such a splitting (also referred to as CSCS), we first develop classical CSCS iterative methods and then introduce shifted CSCS iterative methods for solving hermitian positive definite Toeplitz systems in this paper. The convergence of each method is analyzed. Numerical experiments show that the classical CSCS iterative methods work slightly better than the Gauss-Seidel (GS) iterative methods if the CSCS is convergent and that there is always a constant $\alpha$ such that the shifted CSCS iteration converges much faster than the Gauss-Seidel iteration, no matter whether the CSCS itself is convergent or not.National Natural Science Foundation of China No. 11371075The authors would like to thank the supports of the National Natural Science Foundation of China under Grant No. 11371075, the research innovation program of Hunan province for postgraduate students under Grant No. CX2015B374, the Portuguese Funds through FCT–Fundac˜ao para a Ciˆencia, within the Project UID/MAT/00013/2013.info:eu-repo/semantics/publishedVersio

A bibliography on parallel and vector numerical algorithms

This is a bibliography of numerical methods. It also includes a number of other references on machine architecture, programming language, and other topics of interest to scientific computing. Certain conference proceedings and anthologies which have been published in book form are listed also

Solution of partial differential equations on vector and parallel computers

The present status of numerical methods for partial differential equations on vector and parallel computers was reviewed. The relevant aspects of these computers are discussed and a brief review of their development is included, with particular attention paid to those characteristics that influence algorithm selection. Both direct and iterative methods are given for elliptic equations as well as explicit and implicit methods for initial boundary value problems. The intent is to point out attractive methods as well as areas where this class of computer architecture cannot be fully utilized because of either hardware restrictions or the lack of adequate algorithms. Application areas utilizing these computers are briefly discussed