|
This article is cited in 1 scientific paper (total in 1 paper)
Computational Mathematics
Parallel algebraic solvers library Krylov
D. S. Butyuginab, Ya. L. Guryevaa, V. P. Il'ina, D. V. Perevozkina, A. V. Petukhova, I. N. Skopina a Institute of Computational Mathematics and Mathematical Geophysics SB RAS (Novosibirsk, Russian Federation)
b Novosibirsk State University
Abstract:
Article describes functional capabilities and software implementation peculiarities of parallel algorithms library Krylov, which is oriented on the solution of large systems of linear algebraic equations with sparse symmetric and unsymmetric matrices (positive definite and semi-definite) obtained from discrete approximations of multidimensional boundary value problems for partial differential equations on unstructured meshes. The library includes two-level iterative methods in Krylov subspaces; preconditioning of the latter is based on the balanced decomposition of the computational domain with variable sizes of subdomain overlapping and different boundary conditions on interfacing boundaries. Program implementations use typical compressed sparse matrix data formats. Results of numerical experiments are presented which demonstrate the efficiency of parallelization for typical ill-conditioned problems.
Keywords:
preconditioned iterative algorithms; Krylov subspaces; domain decomposition methods; sparse algebraic systems; numerical experiments.
Received: 14.06.2013
Citation:
D. S. Butyugin, Ya. L. Guryeva, V. P. Il'in, D. V. Perevozkin, A. V. Petukhov, I. N. Skopin, “Parallel algebraic solvers library Krylov”, Vestn. YuUrGU. Ser. Vych. Matem. Inform., 2:3 (2013), 92–105
Linking options:
https://www.mathnet.ru/eng/vyurv95 https://www.mathnet.ru/eng/vyurv/v2/i3/p92
|
Statistics & downloads: |
Abstract page: | 153 | Full-text PDF : | 52 | References: | 8 |
|