Robustness and Accuracy in Pipelined Bi-Conjugate Gradient Stabilized Method: A Comparative Study
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916215053615104 |
|---|---|
| author | Havdiak, Mykhailo Aliaga, Jose I. Iakymchuk, Roman |
| author_facet | Havdiak, Mykhailo Aliaga, Jose I. Iakymchuk, Roman |
| contents | In this article, we propose an accuracy-assuring technique for finding a solution for unsymmetric linear systems. Such problems are related to different areas such as image processing, computer vision, and computational fluid dynamics. Parallel implementation of Krylov subspace methods speeds up finding approximate solutions for linear systems. In this context, the refined approach in pipelined BiCGStab enhances scalability on distributed memory machines, yielding to substantial speed improvements compared to the standard BiCGStab method. However, it's worth noting that the pipelined BiCGStab algorithm sacrifices some accuracy, which is stabilized with the residual replacement technique. This paper aims to address this issue by employing the ExBLAS-based reproducible approach. We validate the idea on a set of matrices from the SuiteSparse Matrix Collection. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_13216 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Robustness and Accuracy in Pipelined Bi-Conjugate Gradient Stabilized Method: A Comparative Study Havdiak, Mykhailo Aliaga, Jose I. Iakymchuk, Roman Mathematical Software Distributed, Parallel, and Cluster Computing In this article, we propose an accuracy-assuring technique for finding a solution for unsymmetric linear systems. Such problems are related to different areas such as image processing, computer vision, and computational fluid dynamics. Parallel implementation of Krylov subspace methods speeds up finding approximate solutions for linear systems. In this context, the refined approach in pipelined BiCGStab enhances scalability on distributed memory machines, yielding to substantial speed improvements compared to the standard BiCGStab method. However, it's worth noting that the pipelined BiCGStab algorithm sacrifices some accuracy, which is stabilized with the residual replacement technique. This paper aims to address this issue by employing the ExBLAS-based reproducible approach. We validate the idea on a set of matrices from the SuiteSparse Matrix Collection. |
| title | Robustness and Accuracy in Pipelined Bi-Conjugate Gradient Stabilized Method: A Comparative Study |
| topic | Mathematical Software Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2404.13216 |