A parallel algorithm for solving Toeplitz linear systems (Q1294265): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A new method for solving symmetric circulant tridiagonal systems of linear equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fast algorithm for solving special tridiagonal systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient algorithms for solving nonlinear Volterra integro-differential equations with two point boundary conditions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fast method for solving second Order boundary value volterra Integro-differential equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An approximate solution for a system with a symmetric matrix / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4002466 / rank | |||
Normal rank |
Revision as of 20:12, 28 May 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