.png){kind=icon}
Return
A parallel algorithm for solving Toeplitz linear systems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0096-3003(98)00028-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
odd/even reduction
Toeplitz matrix
approximate solution
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
.png){kind=icon}
