Abstract | ||
---|---|---|
A comprehensive review of methods for the solution of general and Toeplitz bidiagonal systems of equations on vector computers is performed in this paper. The methods analyzed here are the R -Cyclic Reduction and the Divide and Conquer families of algorithms. For the case of strictly diagonal dominant systems, the early termination of R -Cyclic Reduction and Divide and Conquer algorithms is studied. Also, the Overlapped Partitions Method is analyzed. The methods studied here are tuned for vector processors with different techniques that are explained and analyzed. In particular, one vector processor of the Convex C-3480 is used as a case study and final conclusions for vector and parallel computers are given. |
Year | DOI | Venue |
---|---|---|
1996 | 10.1016/S0167-8191(96)00028-2 | Parallel Computing |
Keywords | Field | DocType |
toeplitz vector bidiagonal solvers,partition method,divide and conquer,vector computer,diagonal dominant system,bidiagonal systems,cyclic reduction,system of equations,parallel computer,vector processor | Diagonal,System of linear equations,Computer science,Parallel computing,Regular polygon,Toeplitz matrix,Theoretical computer science,Divide and conquer algorithms,Vector processor,Cyclic reduction,Partition method | Journal |
Volume | Issue | ISSN |
22 | 8 | Parallel Computing |
Citations | PageRank | References |
8 | 0.67 | 15 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Josep-Lluis Larriba-Pey | 1 | 245 | 21.70 |
Juan J. Navarro | 2 | 323 | 42.90 |
Àngel Jorba | 3 | 15 | 3.61 |
Oriol Roig | 4 | 219 | 15.02 |