Domain decomposition PCG methods for serial and parallel processing

Papadrakakis, M; Bitzarakis, S

dc.contributor.author	Papadrakakis, M	en
dc.contributor.author	Bitzarakis, S	en
dc.date.accessioned	2014-03-01T01:11:54Z
dc.date.available	2014-03-01T01:11:54Z
dc.date.issued	1996	en
dc.identifier.issn	0965-9978	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/11851
dc.subject	Domain decomposition	en
dc.subject.classification	Computer Science, Interdisciplinary Applications	en
dc.subject.classification	Computer Science, Software Engineering	en
dc.subject.other	Algorithms	en
dc.subject.other	Finite element method	en
dc.subject.other	Iterative methods	en
dc.subject.other	Matrix algebra	en
dc.subject.other	Mechanics	en
dc.subject.other	Polynomials	en
dc.subject.other	Vectors	en
dc.subject.other	Domain decomposition	en
dc.subject.other	Preconditioned conjugate gradient method	en
dc.subject.other	Subdomain by subdomain polynomial preconditioner	en
dc.subject.other	Parallel processing systems	en
dc.title	Domain decomposition PCG methods for serial and parallel processing	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/0965-9978(95)00103-4	en
heal.identifier.secondary	http://dx.doi.org/10.1016/0965-9978(95)00103-4	en
heal.language	English	en
heal.publicationDate	1996	en
heal.abstract	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
heal.publisher	ELSEVIER SCI LTD	en
heal.journalName	Advances in Engineering Software	en
dc.identifier.doi	10.1016/0965-9978(95)00103-4	en
dc.identifier.isi	ISI:A1996UR80400021	en
dc.identifier.volume	25	en
dc.identifier.issue	2-3	en
dc.identifier.spage	291	en
dc.identifier.epage	307	en