Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Multi-preconditioned domain decomposition methods in the krylov subspaces. / Ilin, Valery P.
Numerical Analysis and Its Applications - 6th International Conference, NAA 2016, Revised Selected Papers. ed. / Dimov; Farago; L Vulkov. Springer-Verlag GmbH and Co. KG, 2017. p. 95-106 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10187 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - Multi-preconditioned domain decomposition methods in the krylov subspaces
AU - Ilin, Valery P.
PY - 2017/1/1
Y1 - 2017/1/1
N2 - We consider the algebraic and geometric issues of the advanced parallel domain decomposition methods (DDMs) for solving very large non-symmetric systems of linear algebraic equations (SLAEs) that arise in the finite volume or the finite element approximation of the multi-dimensional boundary value problems on the non-structured grids. The main approaches in question for DDM include the balancing decomposition of the grid computational domain into parameterized overlapping or non-overlapping subdomains with different interface conditions on the internal boundaries. Also, we use two different sructures of the contacting the neigbour grid subdomains: with definition or without definition of the node dividers (separators) as the special grid subdomain. The proposed Schwarz parallel additive algorithms are based on the “total-flexible” multi-preconditioned semi-conjugate direction methods in the Krylov block subspaces. The acceleration of two-level iterative processes is provided by means of aggregation, or coarse grid correction, with different orders of basic functions, which realize a low - rank approximation of the original matrix. The auxiliary subsystems in subdomains are solved by direct or by the Krylov iterative methods. The parallel implementation of algorithms is based on hybrid programming with MPI-processes and multi-thread computing for the upper and the low levels of iterations, respectively. We describe some characteristic features of the computational technologies of DDMs that are realized within the framework of the library KRYLOV in the Institute of Computational Mathematics and Mathematical Geophysics, SB RAS, Novosibirsk. The technical requirements for this code are based on the absence of the program constraints on the degree of freedom and on the number of processor units. The conceptions of the creating the unified numerical envirement for DDMs are presented and discussed.
AB - We consider the algebraic and geometric issues of the advanced parallel domain decomposition methods (DDMs) for solving very large non-symmetric systems of linear algebraic equations (SLAEs) that arise in the finite volume or the finite element approximation of the multi-dimensional boundary value problems on the non-structured grids. The main approaches in question for DDM include the balancing decomposition of the grid computational domain into parameterized overlapping or non-overlapping subdomains with different interface conditions on the internal boundaries. Also, we use two different sructures of the contacting the neigbour grid subdomains: with definition or without definition of the node dividers (separators) as the special grid subdomain. The proposed Schwarz parallel additive algorithms are based on the “total-flexible” multi-preconditioned semi-conjugate direction methods in the Krylov block subspaces. The acceleration of two-level iterative processes is provided by means of aggregation, or coarse grid correction, with different orders of basic functions, which realize a low - rank approximation of the original matrix. The auxiliary subsystems in subdomains are solved by direct or by the Krylov iterative methods. The parallel implementation of algorithms is based on hybrid programming with MPI-processes and multi-thread computing for the upper and the low levels of iterations, respectively. We describe some characteristic features of the computational technologies of DDMs that are realized within the framework of the library KRYLOV in the Institute of Computational Mathematics and Mathematical Geophysics, SB RAS, Novosibirsk. The technical requirements for this code are based on the absence of the program constraints on the degree of freedom and on the number of processor units. The conceptions of the creating the unified numerical envirement for DDMs are presented and discussed.
KW - Coarse grid corection
KW - Domain decomposition
KW - Hierarchical memory
KW - Hybrid programming
KW - Krylov subspaces
KW - Multi-dimensional boundary value problems
KW - Multi-preconditioning
KW - Scalable parallelism
KW - SCHWARZ
UR - http://www.scopus.com/inward/record.url?scp=85018431817&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-57099-0_9
DO - 10.1007/978-3-319-57099-0_9
M3 - Conference contribution
AN - SCOPUS:85018431817
SN - 9783319570983
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 95
EP - 106
BT - Numerical Analysis and Its Applications - 6th International Conference, NAA 2016, Revised Selected Papers
A2 - Dimov, null
A2 - Farago, null
A2 - Vulkov, L
PB - Springer-Verlag GmbH and Co. KG
T2 - 6th International Conference on Numerical Analysis and Its Applications, NAA 2016
Y2 - 14 June 2016 through 21 June 2016
ER -
ID: 10263008