Domain decomposition PCG methods for serial and parallel processing

see the original item page
in the repository's web site and access all digital files if the item*



Domain decomposition PCG methods for serial and parallel processing (EN)

Bitzarakis, S (EN)
Papadrakakis, M (EN)

journalArticle (EN)

2014-03-01T01:11:54Z
1996 (EN)


In this paper two domain decomposition formulations are presented in conjunction with the preconditioned conjugate gradient method (PCG) for the solution of large-scale problems in solid and structural mechanics. In the first approach, the PCG method is applied to the global coefficient matrix, while in the second approach it is applied to the interface problem after eliminating the internal degrees of freedom. For both implementations, a subdomain-by-subdomain (SBS) polynomial preconditioner is employed, based on local information of each subdomain. The approximate inverse of the global coefficient matrix or the Schur complement matrix, which acts as the preconditioner, is expressed by a truncated Neumann series resulting in an additive type local preconditioner. Block type preconditioning, where full elimination is performed inside each block, is also studied and compared with the proposed polynomial preconditioning. Copyright (C) Civil-Comp Limited and Elsevier Science Limited. (EN)

Computer Science, Interdisciplinary Applications (EN)
Computer Science, Software Engineering (EN)

Finite element method (EN)
Parallel processing systems (EN)
Preconditioned conjugate gradient method (EN)
Algorithms (EN)
Matrix algebra (EN)
Mechanics (EN)
Subdomain by subdomain polynomial preconditioner (EN)
Polynomials (EN)
Vectors (EN)
Iterative methods (EN)
Domain decomposition (EN)

Advances in Engineering Software (EN)

English

ELSEVIER SCI LTD (EN)




*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)