Name
Abstract | ||
|---|---|---|
In this paper we study the Spike Algorithm for the solution of tridiagonal systems on vector and parallel computers. More specifically, we concentrate on the case of the Spike Algorithm with savings in the amount of work, for systems of equations with strict diagonal dominance. First, we propose a criterion to determine the amount of work for the Spike Algorithm with savings. This criterion is a function of the diagonal dominance and the maximum error allowed to the solution of the problem. Second, we compare the execution times of the bare Spike Algorithm and the Spike Algorithm with savings on one vector processor of the Convex C-3480. The Spike Algorithm with savings proves to be faster than the bare Spike Algorithm for the many cases. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1016/0165-6074(93)90071-R | Microprocessing and Microprogramming |
Keywords | Field | DocType |
diagonal dominant tridiagonal system,spike algorithm | Diagonal,Tridiagonal matrix,Computer science,Parallel computing,SPIKE algorithm | Journal |
Volume | Issue | ISSN |
39 | 2-5 | Microprocessing and Microprogramming |
Citations | PageRank | References |
2 | 0.45 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Josep-Lluis Larriba-Pey | 1 | 245 | 21.70 |
| Angel Jorba | 2 | 41 | 6.32 |
| Juan J. Navarro | 3 | 323 | 42.90 |