ANALYSIS OF THE TRUNCATED SPIKE ALGORITHM

Download

index.pdf

Date

2008-01-01

Author

MİKKELSEN, CCK
Manguoğlu, Murat

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

13
views

22
downloads

The truncated SPIKE algorithm is a parallel solver for linear systems which are banded and strictly diagonally dominant by rows. There are machines for which the current implementation of the algorithm is faster and scales better than the corresponding solver in ScaLAPACK (PDDBTRF/PDDBTRS). In this paper we prove that the SPIKE matrix is strictly diagonally dominant by rows with a degree no less than the original matrix. We establish tight upper bounds on the decay rate of the spikes as well as the truncation error. We analyze the error of the method and present the results of some numerical experiments which show that the accuracy of the truncated SPIKE algorithm is comparable to LAPACK and ScaLAPACK.

Subject Keywords

Analysis

URI

https://hdl.handle.net/11511/40174

Journal

SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS

DOI

https://doi.org/10.1137/080719571

Collections

Department of Computer Engineering, Article

Citation Formats

C. MİKKELSEN and M. Manguoğlu, “ANALYSIS OF THE TRUNCATED SPIKE ALGORITHM,” SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, vol. 30, no. 4, pp. 1500–1519, 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/40174.