| Autor: |
Klimonov, I. A., Sveshnikov, V. M. |
| Zdroj: |
Numerical Analysis & Applications; Dec2022, Vol. 15 Issue 4, p353-363, 11p |
| Abstrakt: |
An experimental study of the efficiency of 3D boundary value problem solvers on regular subgrids of quasi-structured parallelepipedal grids is carried out. Five solvers are considered. Three of them are iterative ones: successive over-relaxation, alternating direction implicit, and explicit incomplete factorization with acceleration by conjugate gradients, and two are direct ones: PARDISO and HEMHOLTZ—both from the Intel MKL library. Characteristic features of this study are: 1) each of the subgrids has a small number of nodes; 2) the efficiency is estimated not only for single calculations, but mainly for a series of calculations in each of which a large number of solution cycles is carried out for the problem with different boundary conditions on the same subgrid. The numerical experiments show that the fastest solver under the above conditions is the method of successive over-relaxation. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink