A parallel algorithm for solving Toeplitz linear systems

Garey, LE

doi:10.1016/S0096-3003(98)00028-9

A parallel algorithm for solving Toeplitz linear systems

1999-05-01

14

PRE

AI

DOI：10.1016/S0096-3003(98)00028-9

原文链接

原文求助

摘要

En 中文

Numerical methods of solution are considered for systems which are Toeplitz and symmetric. In our case, the coefficient matrix is essentially tridiagonal and sparse. There are two distinct approaches to be considered each of which is efficient in its own way. Here we will combine the two approaches which will allow application of the cyclic reduction method to coefficient matrices of more general forms. The convergence of the approximations to the exact solution will also be examined. Solving linear systems by the adapted cyclic reduction method can be parallel processed. (C) 1999 Elsevier Science Inc. All rights reserved.

Keyword:

odd/even reduction

Toeplitz matrix

approximate solution

A parallel algorithm for solving Toeplitz linear systems

摘要

AI总结

期刊

机构

引用论文