We present a multi-threaded solver for symmetric positive definite linear systems where the coefficient matrix of the problem features a bordered-band non-zero pattern. The algorithms that implement this approach heavily rely on a compact storage format, tailored for this type of matrices, that reduces the memory requirements, produces a regular data access pattern, and allows to cast the bulk of the computations in terms of efficient kernels from the Level-3 and Level-2 BLAS. The efficiency of our approach is illustrated by numerical experiments.
CITATION STYLE
Benner, P., Ezzatti, P., Quintana-Ortí, E. S., & Remón, A. (2016). A parallel multi-threaded solver for symmetric positive definite Bordered-Band linear systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9573, pp. 96–105). Springer Verlag. https://doi.org/10.1007/978-3-319-32149-3_10
Mendeley helps you to discover research relevant for your work.