Parallel Cholesky Factorization for Banded Matrices using OpenMP Tasks

arXiv2305.04635MaRDI QIDQ6435751FDOQ6435751

Albin Fredriksson, Felix Liu, S. Markidis

Publication date: 8 May 2023

Abstract: Cholesky factorization is a widely used method for solving linear systems involving symmetric, positive-definite matrices, and can be an attractive choice in applications where a high degree of numerical stability is needed. One such application is numerical optimization, where direct methods for solving linear systems are widely used and often a significant performance bottleneck. An example where this is the case, and the specific type of optimization problem motivating this work, is radiation therapy treatment planning, where numerical optimization is used to create individual treatment plans for patients. To address this bottleneck, we propose a task-based multi-threaded method for Cholesky factorization of banded matrices with medium-sized bands. We implement our algorithm using OpenMP tasks and compare our performance with state-of-the-art libraries such as Intel MKL. Our performance measurements show a performance that is on par or better than Intel MKL (up to ~26%) for a wide range of matrix bandwidths on two different Intel CPU systems.

This page was built for publication: Parallel Cholesky Factorization for Banded Matrices using OpenMP Tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6435751)