In solving various problems of mathematical physics, it is often necessary to repeatedly find the solution of systems of linear algebraic equations. To solve these systems, various iterative numerical methods can be employed, such as Krylov subspace and/or multigrid methods. One po- pular approach to reduce computation time is the utilization of graphics processing units (GPUs). In this work, we investigate the efficiency of using GPUs to accelerate the solution of systems of linear algebraic equations employing the Bi-Conjugate Gradient Stabilized method with an algebraic multigrid preconditioner and various smoothers. These methods were implemented within the XAMG library for both GPU and CPU architectures. Testing was performed on both a local workstation and a cluster node, including efficiency comparisons between the sparse matrix-vector multiplication implementations in the XAMG library and those in the cuSPARSE library. The testing performed shows that the average speedup of the SLAEs solution depends on the method used and varies from 7 to 9 on the workstation and from 5. 5 to 7 on the cluster node. It is also demonstrated that solving SLAEs on GPU in the XAMG library is 1. 25 faster than in the hypre library.
Kuprii et al. (2026) studied this question.