Konuşmacılar
Açıklama
Kaczmarz algorithm is an iterative projection method for solving system of linear equations that arise in science and engineering problems in different domains. In addition to classical Kaczmarz, randomized and parallel variants have been proposed. The main issue for a parallel approach is that each Kaczmarz iteration depends on the previous one, therefore the requirement of communicating frequently results in a large overhead. In this study, a new distributed parallel approach that reduces the communication overhead is proposed. The proposed scheme partitions the problem so that the Kaczmarz iterations on different blocks are less dependent. Frequency constant in our method is being used for adjusting the communication frequency. We also decrease the communication overhead by allowing communication between processes only if they have the shared non-zero column. The sequential experiments are performed using problems from different domains to compare the effects of various partitioning methods on the communication overhead and performance. Finally, we show parallel speedup of the proposed scheme on larger problems.