A parallel algorithm for solving Toeplitz linear systems (Q1294265): Difference between revisions
From MaRDI portal
Latest revision as of 10:47, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel algorithm for solving Toeplitz linear systems |
scientific article |
Statements
A parallel algorithm for solving Toeplitz linear systems (English)
0 references
1 February 2000
0 references
For solving Toeplitz linear systems it is considered a cyclic reduction of the system by solving a system which contains the Toeplitz tridiagonal part and then correcting by accounting for the remaining elements in the coefficient matrix. The total number of operations for the sequential solution is given by \(6n+5\log_2n+4t\), where \(t\) is the number of components that needed to be corrected.
0 references
Toeplitz matrix
0 references
Toeplitz linear systems
0 references
cyclic reduction
0 references
parallel computation
0 references
algorithm
0 references
0 references
0 references
