Parallel scalability study of three dimensional additive Schwarz preconditioners in non-overlapping domain decomposition

Simple item page
dc.contributor.authorGiraud, L.en
dc.contributor.authorHaidar, A.en
dc.contributor.authorWatson, Layne T.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:37:12Zen
dc.date.available2013-06-19T14:37:12Zen
dc.date.issued2007en
dc.description.abstractIn this paper we study the parallel scalability of variants of additive Schwarz preconditioners for three dimensional non-overlapping domain decomposition methods. To alleviate the computational cost, both in terms of memory and floating-point complexity, we investigate variants based on a sparse approximation or on mixed 32- and 64-bit calculation. The robustness of the preconditioners is illustrated on a set of linear systems arising from the finite element discretization of elliptic PDEs through extensive parallel experiments on up to 1000 processors. Their efficiency from a numerical and parallel performance view point are studied.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000940/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000940/01/mixPC07.pdfen
dc.identifier.trnumberTR-07-03en
dc.identifier.urihttp://hdl.handle.net/10919/19610en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectParallel computationen
dc.titleParallel scalability study of three dimensional additive Schwarz preconditioners in non-overlapping domain decompositionen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
mixPC07.pdf
Size:
256.49 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports